Optimal subgraphs in a weighted digraph

DOI10.1007/BF01069629zbMath0488.90067OpenAlexW2059344936MaRDI QIDQ3950327

Dmitrii D. Lozovanu

Publication date: 1981

Published in: Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityefficient algorithmsdirected treesspanning forestweighted digraphoptimum branchingoptimal subgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Packing rooted directed cuts in a weighted directed graph
• Optimum branchings
• Unnamed Item

This page was built for publication: Optimal subgraphs in a weighted digraph