Login / Signup
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.
Yu Nakahata
Jun Kawahara
Shoji Kasahara
Published in:
CoRR (2018)
Keyphrases
</>
connected components
binary decision diagrams
decision diagrams
binary images
graph mining
undirected graph
multi valued
level set
strongly connected components
real world graphs
data structure
gray scale
boolean functions
digital circuits
directed graph