Strength of a graph and packing of trees and branchings

DOI10.1007/BF01125543zbMath0939.68727MaRDI QIDQ1895050

V. A. Trubin

Publication date: 6 August 1995

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Optimization of computations ⋮ Computing Weighted Strength and Applications to Partitioning ⋮ Integral packing of trees and branchings ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cites Work

• Unnamed Item
• Testing membership in matroid polyhedra
• Connectivity and edge-disjoint spanning trees
• Fractional covers for forests and matchings
• Optimal attack and reinforcement of a network
• Packing and covering with integral feasible flows in integral supply-demand networks
• A new approach to the maximum-flow problem
• Computing the Strength of a Graph
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Strength of a graph and packing of trees and branchings