Strength of a graph and packing of trees and branchings

DOI10.1007/BF01125543MaRDI QIDQ1895050zbMATH OpenFDO

Authors V. A. Trubin

Publication date 6 August 1995

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

Full work available at URL https://doi.org/10.1007/BF01125543

Mathematics Subject Classification ID

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

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• A new approach to the maximum-flow problem
• Computing the Strength of a Graph
• Connectivity and edge-disjoint spanning trees
• Fractional covers for forests and matchings
• scientific article; zbMATH DE number 219924 (Why is no real title available?)
• Optimal attack and reinforcement of a network
• Packing and covering with integral feasible flows in integral supply-demand networks
• Testing membership in matroid polyhedra

Cited in

(5)

• Optimization of computations
• Integral packing of trees and branchings
• Computing weighted strength and applications to partitioning
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Finding the maximum subgraph of prescribed strength

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895050)