Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1543313385 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.05980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Two Disjoint Paths in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shortest disjoint paths in planar 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: On the complexity of the disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for computing shortest pairs of disjoint paths / 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: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest vertex-disjoint two-face paths in planar graphs / rank
 
Normal rank

Latest revision as of 03:14, 11 July 2024

scientific article
Language Label Description Also known as
English
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references