Integral packing of trees and branchings

DOI10.1007/BF02366792zbMath0840.05088OpenAlexW2024746969MaRDI QIDQ1907770

V. A. Trubin

Publication date: 27 March 1996

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

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

zbMATH Keywords

algorithmdigraphminimum cutbranchingsmaximum flowintegral packing of spanning treesminimum integral covering of a graph by spanning treesnonzero componentsstrictly polynomial algorithms for network strength

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Some directions and results of research in mathematical programming and system analysis ⋮ Main directions in the development of informatics ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)

Cites Work

• Testing membership in matroid polyhedra
• Strength of a graph and packing of trees and branchings
• Packing and covering with integral feasible flows in integral supply-demand networks
• Strength and reinforcement of a network and tree packing
• A Fast Parametric Maximum Flow Algorithm and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Integral packing of trees and branchings