On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.
Alan Diêgo Aurélio CarneiroFábio ProttiUéverton dos Santos SouzaPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- fine grained
- complexity analysis
- coarse grained
- directed graph
- theoretical analysis
- undirected graph
- labeled graphs
- access control
- hamiltonian cycle
- edge weights
- vertex set
- lower bound
- minimum weight
- tightly coupled
- b spline
- random walk
- graph structure
- structured data
- weighted graph
- first order logic
- directed acyclic graph
- computational complexity
- spanning tree
- attributed graphs
- query processing