Optimum path packing on wheels: The consecutive case (Q1921239): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(96)00058-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088983627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: Polyhedral investigations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: A cutting plane algorithm and computational results / 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: Q3056948 / rank
 
Normal rank

Latest revision as of 14:02, 24 May 2024

scientific article
Language Label Description Also known as
English
Optimum path packing on wheels: The consecutive case
scientific article

    Statements

    Optimum path packing on wheels: The consecutive case (English)
    0 references
    0 references
    0 references
    0 references
    6 January 1997
    0 references
    0 references
    routing algorithms
    0 references
    VLSI design
    0 references
    wheel
    0 references
    path packing
    0 references
    0 references