A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.
Akanksha AgrawalSudeshna KolayDaniel LokshtanovSaket SaurabhPublished in: LATIN (2016)
Keyphrases
- graph structure
- computational complexity
- learning algorithm
- dynamic programming
- undirected graph
- optimal solution
- random walk
- detection algorithm
- convolution kernel
- hamiltonian cycle
- graph based algorithm
- k means
- segmentation algorithm
- worst case
- attributed graphs
- objective function
- expectation maximization
- graphical models
- clustering method
- tree structure
- directed graph
- similarity function
- probabilistic model
- edge weights
- graph construction
- preprocessing
- dominating set