Independent feedback vertex sets for graphs of bounded diameter.
Marthe BonamyKonrad K. DabrowskiCarl FeghaliMatthew JohnsonDaniël PaulusmaPublished in: Inf. Process. Lett. (2018)
Keyphrases
- directed graph
- average degree
- undirected graph
- labeled graphs
- attributed graphs
- graph matching
- graph theory
- vertex set
- connected subgraphs
- phase transition
- hamiltonian cycle
- graph theoretic
- bounded treewidth
- edge weights
- feedback mechanisms
- minimum weight
- graph clustering
- pattern recognition
- graph representation
- user feedback
- relevance feedback