Irrelevant vertices for the planar disjoint paths problem (Q345131): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/jct/AdlerKKLST17, #quickstatements; #temporary_batch_1731468600454
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963908100 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.2378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms for Minor Containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Linkages in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Disjoint-Paths Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Packing of Odd Cycles in a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the planar branchwidth with respect to the largest grid minor size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch decompositions and minor containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Disjoint Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd cycle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shorter proof of the graph minor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXI. graphs with unique linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXII. Irrelevant vertices in linkage problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some edge-disjoint paths problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jct/AdlerKKLST17 / rank
 
Normal rank

Latest revision as of 04:31, 13 November 2024

scientific article
Language Label Description Also known as
English
Irrelevant vertices for the planar disjoint paths problem
scientific article

    Statements

    Irrelevant vertices for the planar disjoint paths problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    graph minors
    0 references
    treewidth
    0 references
    disjoint paths problem
    0 references

    Identifiers