A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.
Manuel CáceresMassimo CairoBrendan MumeyRomeo RizziAlexandru I. TomescuPublished in: WG (2021)
Keyphrases
- worst case
- computational cost
- times faster
- detection algorithm
- preprocessing
- learning algorithm
- significant improvement
- estimation algorithm
- segmentation algorithm
- theoretical analysis
- matching algorithm
- experimental evaluation
- cost function
- convergence rate
- dynamic programming
- np hard
- search space
- recognition algorithm
- optimal solution
- tree structure
- graph structure
- denoising
- optimization algorithm
- computationally efficient
- graph cuts
- probabilistic model
- k means
- computational complexity
- search algorithm
- objective function