Planar disjoint-paths completion
DOI10.1007/S00453-015-0046-2zbMATH Open1350.68121DBLPjournals/algorithmica/AdlerKT16OpenAlexW2901461299WikidataQ59891863 ScholiaQ59891863MaRDI QIDQ329285FDOQ329285
Authors: Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos 
Publication date: 21 October 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/104729/1/PDPC_adler.pdf
Recommendations
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- On the complexity of DNA physical mapping
- Graph minors. XIII: The disjoint paths problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- Computing the Minimum Fill-In is NP-Complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Graph minors. XXI. graphs with unique linkages
- Tight bounds for linkages in planar graphs
- Title not available (Why is that?)
- Contraction Bidimensionality: The Accurate Picture
- Graph minors. XXII. Irrelevant vertices in linkage problems
- Title not available (Why is that?)
- Finding topological subgraphs is fixed-parameter tractable
- Monadic second-order evaluations on tree-decomposable graphs
Cited In (5)
This page was built for publication: Planar disjoint-paths completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329285)
