C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.
Neeldhara Misra
Geevarghese Philip
Venkatesh Raman
Saket Saurabh
Published in:
Algorithmica (2014)
Keyphrases
</>
small number
decision problems
data mining
graph representation
graph matching
graph theory
computational complexity
worst case
connected components
graph structure
neighborhood graph
graph databases
graph model
graph mining
computational cost
pairwise
bayesian networks
feature selection