Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem.
Alan Diêgo Aurélio CarneiroFábio ProttiUéverton S. SouzaPublished in: COCOON (2018)
Keyphrases
- fine grained
- complexity analysis
- coarse grained
- directed graph
- undirected graph
- theoretical analysis
- minimum weight
- vertex set
- tightly coupled
- hamiltonian cycle
- lower bound
- weighted graph
- labeled graphs
- edge weights
- access control
- graph structure
- first order logic
- bipartite graph
- random walk
- attributed graphs
- spanning tree
- computational complexity
- data lineage
- massively parallel
- b spline
- structured data
- graphical models
- artificial intelligence
- objective function
- information retrieval