A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion.
Akanksha AgrawalSudeshna KolayDaniel LokshtanovSaket SaurabhPublished in: CoRR (2015)
Keyphrases
- learning algorithm
- graph structure
- expectation maximization
- computational complexity
- memory efficient
- worst case
- hamiltonian cycle
- preprocessing
- dynamic programming
- simulated annealing
- matching algorithm
- objective function
- undirected graph
- block matching
- search space
- probabilistic model
- segmentation algorithm
- detection algorithm
- clustering method
- directed graph
- dominating set
- maximum flow
- maximum cardinality
- random graphs
- minimum spanning tree
- tree structure
- np hard
- optimal solution
- bayesian networks