Optimal subgraphs in a weighted digraph

DOI10.1007/BF01069629MaRDI QIDQ3950327zbMATH OpenOpenAlexFDO

Authors Dmitrii 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 complexitydirected treesefficient algorithmsoptimal subgraphsoptimum branchingspanning forestweighted digraph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3338382 (Why is no real title available?)
• Optimum branchings
• Packing rooted directed cuts in a weighted directed graph

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

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