The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298): 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: Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal length of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four problems on graphs with excluded minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected spanning subgraphs and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized steiner problem in series-parallel networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 24 May 2024

scientific article
Language Label Description Also known as
English
The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
scientific article

    Statements

    The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 1996
    0 references
    0 references
    traveling-salesman polytope
    0 references
    linear-inequality description
    0 references
    2-connected Steiner subgraphs
    0 references