An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
Kazuhiro KuritaKunihiro WasaTakeaki UnoHiroki ArimuraPublished in: IWOCA (2019)
Keyphrases
- undirected graph
- graph isomorphism
- dynamic programming
- worst case
- graph model
- detection algorithm
- graph mining
- subgraph mining
- search space
- k means
- graph partitioning
- similarity measure
- segmentation algorithm
- maximum common subgraph
- graph theory
- clustering method
- computationally efficient
- expectation maximization
- probabilistic model
- np hard
- computational complexity
- data structure