Strength and reinforcement of a network and tree packing (Q4007379): 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: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / 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 decomposition of a graph into dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts, modular functions, and matroid polyhedra / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:15, 16 May 2024

scientific article
Language Label Description Also known as
English
Strength and reinforcement of a network and tree packing
scientific article

    Statements

    Strength and reinforcement of a network and tree packing (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    packing
    0 references
    covering
    0 references
    spanning trees
    0 references
    complexity
    0 references