Generating all patterns of graph partitions within a disparity bound

DOI10.1007/978-3-319-53925-6_10MaRDI QIDQ2980904zbMATH OpenOpenAlexWikidataFDO

Authors Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-Ichi Minato

Publication date 5 May 2017

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

Full work available at URL https://doi.org/10.1007/978-3-319-53925-6_10

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• On finding connected balanced partitions of trees
• Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams
• Maximum balanced 3-partitions of graphs
• Multiply balanced k-partitioning
• Balanced graph partitions

Cites work

• Analytic combinatorics of non-crossing configurations
• Balanced graph partitioning
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
• scientific article; zbMATH DE number 1929926 (Why is no real title available?)
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(2)

• Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting
• Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Generating all patterns of graph partitions within a disparity bound

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