698 research outputs found
Isomorphism Testing for Graphs Excluding Small Minors
We prove that there is a graph isomorphism test running in time on -vertex graphs excluding some -vertex graph as a minor. Previously known bounds were (Ponomarenko, 1988) and (Babai, STOC 2016). For the algorithm we combine recent advances in the group-theoretic graph isomorphism machinery with new graph-theoretic arguments
Isomorphism Testing for Graphs Excluding Small Minors
We prove that there is a graph isomorphism test running in time n^{polylog(h)} on n-vertex graphs excluding some h-vertex graph as a minor. Previously known bounds were n^{poly(h)} (Ponomarenko, 1988) and n^{polylog(n)} (Babai, STOC 2016). For the algorithm we combine recent advances in the group-theoretic graph isomorphism machinery with new graph-theoretic arguments
Diameter and Treewidth in Minor-Closed Graph Families
It is known that any planar graph with diameter D has treewidth O(D), and
this fact has been used as the basis for several planar graph algorithms. We
investigate the extent to which similar relations hold in other graph families.
We show that treewidth is bounded by a function of the diameter in a
minor-closed family, if and only if some apex graph does not belong to the
family. In particular, the O(D) bound above can be extended to bounded-genus
graphs. As a consequence, we extend several approximation algorithms and exact
subgraph isomorphism algorithms from planar graphs to other graph families.Comment: 15 pages, 12 figure
Canonizing Graphs of Bounded Tree Width in Logspace
Graph canonization is the problem of computing a unique representative, a
canon, from the isomorphism class of a given graph. This implies that two
graphs are isomorphic exactly if their canons are equal. We show that graphs of
bounded tree width can be canonized by logarithmic-space (logspace) algorithms.
This implies that the isomorphism problem for graphs of bounded tree width can
be decided in logspace. In the light of isomorphism for trees being hard for
the complexity class logspace, this makes the ubiquitous class of graphs of
bounded tree width one of the few classes of graphs for which the complexity of
the isomorphism problem has been exactly determined.Comment: 26 page
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
Motivated by the problem of testing planarity and related properties, we
study the problem of designing efficient {\em partition oracles}. A {\em
partition oracle} is a procedure that, given access to the incidence lists
representation of a bounded-degree graph and a parameter \eps,
when queried on a vertex , returns the part (subset of vertices) which
belongs to in a partition of all graph vertices. The partition should be
such that all parts are small, each part is connected, and if the graph has
certain properties, the total number of edges between parts is at most \eps
|V|. In this work we give a partition oracle for graphs with excluded minors
whose query complexity is quasi-polynomial in 1/\eps, thus improving on the
result of Hassidim et al. ({\em Proceedings of FOCS 2009}) who gave a partition
oracle with query complexity exponential in 1/\eps. This improvement implies
corresponding improvements in the complexity of testing planarity and other
properties that are characterized by excluded minors as well as sublinear-time
approximation algorithms that work under the promise that the graph has an
excluded minor.Comment: 13 pages, 1 figur
A Note on Graphs of Linear Rank-Width 1
We prove that a connected graph has linear rank-width 1 if and only if it is
a distance-hereditary graph and its split decomposition tree is a path. An
immediate consequence is that one can decide in linear time whether a graph has
linear rank-width at most 1, and give an obstruction if not. Other immediate
consequences are several characterisations of graphs of linear rank-width 1. In
particular a connected graph has linear rank-width 1 if and only if it is
locally equivalent to a caterpillar if and only if it is a vertex-minor of a
path [O-joung Kwon and Sang-il Oum, Graphs of small rank-width are pivot-minors
of graphs of small tree-width, arxiv:1203.3606] if and only if it does not
contain the co-K_2 graph, the Net graph and the 5-cycle graph as vertex-minors
[Isolde Adler, Arthur M. Farley and Andrzej Proskurowski, Obstructions for
linear rank-width at most 1, arxiv:1106.2533].Comment: 9 pages, 2 figures. Not to be publishe
- …