Add to ORKGAbstract—We generalize the seminal Graph Minor algorithm of Robertson and Seymour to the parity version. We give polynomial time algorithms for the following problems: 1) the parity H-minor (Odd Kk-minor) containment prob-lem, and 2) the disjoint paths problem with k terminals and the parity condition for each path, as well as several other related problems. We present an O(mα(m,n)n) time algorithm for these prob-lems for any fixed k, where n,m are the number of vertices and the number of edges, respectively, and the function α(m,n) is the inverse of the Ackermann function (see Tarjan [69]). Note that the first problem includes the problem of testing whether or not a given graph contains k disjoint odd cycle
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ ...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
We study the problem of computing the parity of the number of homomorphisms from an input graph G to...
At the core of the Robertson-Seymour theory of graph minors lies a powerful decomposition theorem wh...
At the core of the Robertson-Seymour theory of graph mi-nors lies a powerful decomposition theorem w...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
At the core of the seminal Graph Minor Theory of Robert-son and Seymour is a powerful theorem which ...
Minor Containment is a fundamental problem in Algorithmic Graph The-ory used as a subroutine in nume...
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theorem which d...
AbstractWe construct algorithms for deciding essentially any minor-closed parameter, with explicit t...
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theorem which d...
A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of ...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ ...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
We study the problem of computing the parity of the number of homomorphisms from an input graph G to...
At the core of the Robertson-Seymour theory of graph minors lies a powerful decomposition theorem wh...
At the core of the Robertson-Seymour theory of graph mi-nors lies a powerful decomposition theorem w...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
At the core of the seminal Graph Minor Theory of Robert-son and Seymour is a powerful theorem which ...
Minor Containment is a fundamental problem in Algorithmic Graph The-ory used as a subroutine in nume...
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theorem which d...
AbstractWe construct algorithms for deciding essentially any minor-closed parameter, with explicit t...
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theorem which d...
A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of ...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ ...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
We study the problem of computing the parity of the number of homomorphisms from an input graph G to...