\(w\)-density and \(w\)-balanced property of weighted graphs

DOI10.1007/s11766-002-0015-9zbMath1016.05067OpenAlexW185869779MaRDI QIDQ1847635

Hao Sun, Sheng Gui Zhang, Xue Liang Li

Publication date: 11 December 2002

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-002-0015-9

zbMATH Keywords

characterizationpolynomial-time algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items

Comparison of relative density of two random geometric digraph families in testing spatial clustering

Cites Work

• Unnamed Item
• Unnamed Item
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Minimum cuts and related problems
• On the Complexity of Cooperative Solution Concepts
• Balanced graphs and network flows
• A review of random graphs