An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
Kazuhiro KuritaKunihiro WasaHiroki ArimuraTakeaki UnoPublished in: CoRR (2019)
Keyphrases
- undirected graph
- dynamic programming
- learning algorithm
- computational complexity
- objective function
- maximum common subgraph
- polynomial time complexity
- graph partitioning
- graph model
- worst case
- probabilistic model
- k means
- optimal solution
- expectation maximization
- computationally efficient
- detection algorithm
- graph matching
- simulated annealing
- subgraph isomorphism
- adjacency graph