Weighted graphs with fixed vertex degrees and network flows

DOI10.1134/S1064230707030100MaRDI QIDQ465307zbMATH OpenFDO

Authors A. A. Mironov

Publication date 31 October 2014

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064230707030100

Mathematics Subject Classification ID

Vertex degrees (05C07) Deterministic network models in operations research (90B10)

Recommendations

• Method of characteristic functions for classes of networks with fixed node degrees
• Method of partition of networks with fixed degrees of nodes and network flows
• Transport and network problems with the minimax criterion
• scientific article; zbMATH DE number 774620
• scientific article; zbMATH DE number 484194

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 484194 (Why is no real title available?)
• Method of partition of networks with fixed degrees of nodes and network flows
• Minimax under transportation constraints
• Network models with fixed parameters at the communication nodes. I
• Network models with fixed parameters at the communication nodes. II
• Transportation problems with a minimax criterion

Cited in

(8)

• The line index and minimum cut of weighted graphs
• Transport and network problems with the minimax criterion
• Method of characteristic functions for classes of networks with fixed node degrees
• Vertex-weighted realizations of graphs
• Method of partition of networks with fixed degrees of nodes and network flows
• Minimal invariant sets in a vertex-weighted graph
• MINORS IN WEIGHTED GRAPHS
• scientific article; zbMATH DE number 861415 (Why is no real title available?)

This page was built for publication: Weighted graphs with fixed vertex degrees and network flows

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