Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size

DOI10.1007/11809678_9zbMath1162.68498OpenAlexW1594927938MaRDI QIDQ3591319

Kazuya Goto, Takehiro Ito, Xiao Zhou, Takao Nishizeki

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size