Login / Signup
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Neeldhara Misra
Fahad Panolan
Ashutosh Rai
Venkatesh Raman
Saket Saurabh
Published in:
WG (2013)
Keyphrases
</>
computational cost
graph theory
learning algorithm
computationally efficient
theoretical analysis
graph properties
computational complexity
optimization problems
graph databases
graph theoretic
graph classification
representational power
subgraph mining
connected subgraphs