The Steiner forest problem revisited (Q972355): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple steiner subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785974 / rank
 
Normal rank

Latest revision as of 20:17, 2 July 2024

scientific article
Language Label Description Also known as
English
The Steiner forest problem revisited
scientific article

    Statements

    The Steiner forest problem revisited (English)
    0 references
    0 references
    25 May 2010
    0 references
    Steiner forest
    0 references
    Steiner subgraph
    0 references
    computational complexity analysis
    0 references
    series-parallel graph
    0 references
    outerplanar graph
    0 references

    Identifiers