Planar disjoint-paths completion
type: Item
instance of: scholarly article
title: Planar disjoint-paths completion
zbMATH Open document ID: 1350.68121
author: Isolde Adler
author: Stavros G. Kolliopoulos
author: Dimitrios M. Thilikos
published in: Algorithmica
publication date: 2016-10-21T00:00:00Z
full work available at URL: PDPC adler.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6642154
zbMATH Keywords: completion problems
zbMATH Keywords: disjoint paths
zbMATH Keywords: planar graphs
Wikidata QID: Q59891863
MaRDI profile type: Publication
OpenAlex ID: W2901461299
cites work: Tight Bounds for Linkages in Planar Graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: On the complexity of DNA physical mapping
cites work: Q5315023
cites work: Contraction Bidimensionality: The Accurate Picture
cites work: Q4198056
cites work: Finding topological subgraphs is fixed-parameter tractable
cites work: Q3549635
cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
cites work: A shorter proof of the graph minor algorithm: the unique linkage theorem
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Q4273851
cites work: Graph minors. XXII. Irrelevant vertices in linkage problems
cites work: Graph minors. XXI. graphs with unique linkages
cites work: Graph minors. XIII: The disjoint paths problem
DBLP publication ID: journals/algorithmica/AdlerKT16
DOI: 10.1007/S00453-015-0046-2
description: scientific article; zbMATH DE number 6642154