Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams
DOI10.4230/LIPICS.SEA.2018.21zbMATH Open1493.68277arXiv1804.02160MaRDI QIDQ5140733FDOQ5140733
Authors: Yu Nakahata, Jun Kawahara, Shoji Kasahara 
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1804.02160
Recommendations
- Generating all patterns of graph partitions within a disparity bound
- Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams
- Enumeration of the partitions with minimum diameter
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- An effective multilevel tabu search approach for balanced graph partitioning
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Computing the Tutte polynomial of a graph of moderate size
- Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
- Generating all patterns of graph partitions within a disparity bound
Cited In (3)
This page was built for publication: Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140733)
