Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.

Marin Bougeret Nicolas Bousquet Rodolphe Giroudeau Rémi Watrigant

Published in: SOFSEM (2014)

Keyphrases

parameterized complexity
graph mining
graph databases
subgraph isomorphism
graph properties
graph data
undirected graph
fixed parameter tractable
np hard
bounded treewidth
directed graph
global constraints
graph theoretic
random graphs
symmetry breaking
approximation algorithms
connected components
optimal solution