Polyhedral study of the connected subgraph problem (Q468440): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2014.08.026 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6366566 / rank
 
Normal rank
Property / zbMATH Keywords
 
connected subgraph
Property / zbMATH Keywords: connected subgraph / rank
 
Normal rank
Property / zbMATH Keywords
 
polytope
Property / zbMATH Keywords: polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
matching
Property / zbMATH Keywords: matching / rank
 
Normal rank
Property / zbMATH Keywords
 
partition
Property / zbMATH Keywords: partition / rank
 
Normal rank
Property / zbMATH Keywords
 
separation
Property / zbMATH Keywords: separation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.08.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979589380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3109933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. II: Properties and classes of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / 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: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2014.08.026 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:27, 9 December 2024

scientific article
Language Label Description Also known as
English
Polyhedral study of the connected subgraph problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references