A Rooted-Forest Partition with Uniform Vertex Demand

DOI10.1007/978-3-642-11440-3_17zbMath1274.05381OpenAlexW1599003486MaRDI QIDQ3404442

Shin-ichi Tanigawa, Naoki Katoh

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_17

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: A Rooted-Forest Partition with Uniform Vertex Demand