The Graph Minor Algorithm with Parity Conditions
From MaRDI portal
Publication:5494959
DOI10.1109/FOCS.2011.52zbMath1292.68127WikidataQ56235101 ScholiaQ56235101MaRDI QIDQ5494959
Ken-ichi Kawarabayashi, Paul Wollan, Bruce A. Reed
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs ⋮ Tight bounds for divisible subdivisions ⋮ Chordless Cycle Packing Is Fixed-Parameter Tractable ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints ⋮ Tight Cycle Relaxations for the Cut Polytope
This page was built for publication: The Graph Minor Algorithm with Parity Conditions
