Strength and reinforcement of a network and tree packing

DOI10.1007/BF01068376zbMath0800.68614MaRDI QIDQ4007379

V. A. Trubin

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

complexitycoveringpackingspanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Optimization of computations, Integral packing of trees and branchings, Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cites Work

• Connectivity and edge-disjoint spanning trees
• A decomposition of a graph into dense subgraphs
• Minimum cuts, modular functions, and matroid polyhedra
• Optimal attack and reinforcement of a network
• A new approach to the maximum-flow problem
• Minimum partition of a matroid into independent subsets