Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:33, 16 May 2024

scientific article
Language Label Description Also known as
English
Steiner trees with \(n\) terminals among \(n+1\) nodes
scientific article

    Statements

    Steiner trees with \(n\) terminals among \(n+1\) nodes (English)
    0 references
    0 references
    16 January 1993
    0 references
    spanning tree
    0 references
    polyhedra
    0 references
    connected undirected graph
    0 references
    terminals
    0 references
    Steiner tree
    0 references

    Identifiers