Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.
Yu NakahataJun KawaharaShoji KasaharaPublished in: SEA (2018)
Keyphrases
- connected components
- decision diagrams
- binary decision diagrams
- binary images
- graph mining
- multi valued
- level set
- boolean functions
- strongly connected components
- multi dimensional
- dynamic programming
- real world graphs
- planning problems
- markov decision processes
- undirected graph
- random walk
- connected component labeling
- data sets