Improving spanning trees by upgrading nodes (Q1960523): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q214963
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Hans-Christoph Wirth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic theory of graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the location of minisum facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying edges of a network to obtain short subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On budget-constrained flow improvement. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network upgrading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Latest revision as of 11:02, 29 May 2024

scientific article
Language Label Description Also known as
English
Improving spanning trees by upgrading nodes
scientific article

    Statements

    Improving spanning trees by upgrading nodes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2000
    0 references
    NP-hardness
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    spanning tree
    0 references

    Identifiers