Angle-restricted Steiner arborescences for flow map layout (Q2354031): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59782236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized self-approaching curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-constrained minimum networks. I: Fundamentals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network optimization for the design of underground mines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear Steiner arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L_ 1\) shortest paths among polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Arborescence Problem Is NP-Complete / rank
 
Normal rank

Latest revision as of 12:33, 10 July 2024

scientific article
Language Label Description Also known as
English
Angle-restricted Steiner arborescences for flow map layout
scientific article

    Statements

    Identifiers

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