An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width.
Luisa GarganoAdele A. RescignoPublished in: MFCS (2023)
Keyphrases
- spanning tree
- preprocessing
- detection algorithm
- computational cost
- segmentation algorithm
- computational complexity
- expectation maximization
- times faster
- optimization algorithm
- worst case
- minimum spanning tree
- optimal solution
- learning algorithm
- probabilistic model
- k means
- hamiltonian cycle
- objective function
- simple polygon
- matching algorithm
- simulated annealing
- dynamic programming
- search space
- similarity measure