Tag: ds.algorithms

Found 718 results for 'ds.algorithms'.

---

1) ds.algorithms - How can one construct a densest graph with no k-clique?
2) cc.complexity-theory - Logspace algorithms on graphs with bounded tree width
3) ds.algorithms - Complexity of finding the most likely edge
4) cc.complexity-theory - An interesting variant of maximum matching problem
5) ds.algorithms - Is there an online-algorithm to keep track of components in a changing undirected graph?
6) ds.algorithms - Finding a simple dual of a simple graph in some surface
7) ds.algorithms - Reachability in Dynamic Line Graph
8) ds.algorithms - MSOL optimization problems on graphs of bounded cliquewidth, with cardinality predicates
9) ds.algorithms - What is the complexity of this weighted b-edge matching problem?
10) ds.algorithms - Decomposition by Clique Separators
11) ds.algorithms - Graph families which have polynomial time algorithms for computing the chromatic number
12) ds.algorithms - Given a network flow, are there bounds on the change in weight on nodes?
13) ds.algorithms - What is the initialization time of a link-cut tree?
14) ds.algorithms - Inexact labelled binary tree matching
15) ds.algorithms - Bob's Sale (reordering of pairs with constraints to minimize sum of products)
16) ds.algorithms - For a given binary-search tree obtain an isomorphic splay tree
17) cc.complexity-theory - Examples where the uniqueness of the solution makes it easier to find
18) cc.complexity-theory - Generating a tower defense maze, aka Finding the K most vital nodes ("nodewise interdiction") in an unweighted grid-graph
19) cc.complexity-theory - Graph problems which are NP-Complete on directed graphs but polynomial on undirected graphs
20) ds.algorithms - Fastest polynomial time algorithm for solving minimum cost maximum flow problems in bipartite graphs
21) cc.complexity-theory - Learning with (Signed) Errors
22) ds.algorithms - For a Planar Graph, Find the Algorithm that Constructs A Cycle Basis, with each Edge Shared by At Most 2 Cycles
23) ds.algorithms - Fast deletion / contraction in combinatorial embedding
24) ds.algorithms - Lattice problems
25) cc.complexity-theory - My exact divide-conquer algorithm for counting antichain in a poset?
26) cc.complexity-theory - What is the complexity of computing a compatible 3-coloring of a complete graph?
27) ds.algorithms - Ant colony optimization for traveling salesman problem with changing graph-nodes/vertices
28) ds.algorithms - Does an algorithm exist to efficiently maintain connectedness information for a DAG in presence of inserts/deletes?
29) ds.algorithms - Finding a dual of a graph
30) cc.complexity-theory - Problems that are counter-intuitively solvable in practice?
31) ds.algorithms - Kolmogorov complexity of D and D+d
32) ds.algorithms - Making a minimum-width tree decomposition lean in polynomial time
33) ds.algorithms - Maximal classes for which largest independent set can be found in polynomial time?
34) ds.algorithms - Finding odd holes in circulant Paley graphs
35) cc.complexity-theory - Imperfect subgraph isomorphism
36) ds.algorithms - What is the fastest known algorithm for computing a 1.99-approximation of Vertex Cover?
37) ds.algorithms - Nontrivial algorithm for computing a sliding window median
38) ds.algorithms - What is the fastest known algorithm for finding conjugacy classes?
39) ds.algorithms - Revision Tracking Graph
40) ds.algorithms - Finding k shortest Paths with Eppstein's Algorithm
41) ds.algorithms - Label-disjoint paths in directed graphs
42) cc.complexity-theory - 2FA state complexity of k-Clique?
43) ds.algorithms - Gentle introduction to graph isomorphism for bounded valance graphs
44) ds.algorithms - Is DAG subset sum approximable?
45) cc.complexity-theory - Complexity of a satisfiability problem
46) ds.algorithms - Treewidth and Packing
47) cc.complexity-theory - Cartesian factorization of a finite set of n-tuples
48) ds.algorithms - Hardness of Subgraph isomorphism problem for sparse pattern graph
49) ds.algorithms - Finding the longest path between two nodes in a bidirectional unweighted graph
50) ds.algorithms - Longest path in Complete Directed Graphs

---