1729 search results - page 168 / 346 » On Bounds for the k-Partitioning of Graphs |
182
click to vote
TVCG
2012
13 years 9 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
225
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
169
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
152
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
148
click to vote
SIROCCO
2007
15 years 8 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...