Complexity of spanning tree problems: Part I (Q1145635): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing capacitated minimal spanning trees efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the capacitated tree problem / rank
 
Normal rank

Latest revision as of 09:37, 13 June 2024

scientific article
Language Label Description Also known as
English
Complexity of spanning tree problems: Part I
scientific article

    Statements

    Complexity of spanning tree problems: Part I (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    complexity of spanning tree problems
    0 references
    network design
    0 references
    optimum weighted trees
    0 references

    Identifiers