A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Eiffel / rank
 
Normal rank
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: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing through a Dense Channel with Minimum Total Wire Length / 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: Q4335814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / 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: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vertex-Disjoint Menger Problem in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL ROUTING THROUGH DENSE CHANNELS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for edge-disjoint paths in planar graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127087506 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00048-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095648765 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:56, 30 July 2024

scientific article
Language Label Description Also known as
English
A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
scientific article

    Statements

    A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    planar networks
    0 references
    PlaNet
    0 references
    0 references
    0 references
    0 references
    0 references