Planar Disjoint-Paths Completion (Q2891339): Difference between revisions

From MaRDI portal
← Older edit
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Bots
1,895,659 edits
‎Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1530613230 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.04952 / 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: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding topological subgraphs is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs / 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: Q4273851 / 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: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank

Latest revision as of 09:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Planar Disjoint-Paths Completion
scientific article

    Statements

    title
    Planar Disjoint-Paths Completion (English)
    0 references
    author
    Isolde Adler
    0 references
    Dimitrios M. Thilikos
    0 references
    publication date
    15 June 2012
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C10
    0 references
    05C38
    0 references
    zbMATH DE Number
    6046498
    0 references
    zbMATH Keywords
    completion problems
    0 references
    disjoint paths
    0 references
    planar graphs
    0 references
    OpenAlex ID
    W1530613230
    0 references
    arXiv ID
    1511.04952
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2891339&oldid=35284375"
    Powered by MediaWiki