A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for routing in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Flow in Planar Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing through a generalized switchbox / 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: An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms which require nonlinear time to maintain disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and computation. 4th international symposium, ISAAC '93, Hong Kong, December 15--17, 1993. Proceedings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:14, 23 May 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for edge-disjoint paths in planar graphs
scientific article

    Statements

    A linear-time algorithm for edge-disjoint paths in planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 July 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    linear-time algorithm
    0 references
    planar graphs
    0 references
    edge-disjoint paths
    0 references
    evenness condition
    0 references
    theorem of Okamura and Seymour
    0 references