• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

Neeldhara MisraFahad PanolanAshutosh RaiVenkatesh RamanSaket Saurabh
Published in: Algorithmica (2019)
Keyphrases
  • graph theory
  • learning algorithm
  • data structure
  • computational cost
  • computational complexity
  • data mining
  • search algorithm
  • worst case
  • random walk
  • computationally efficient
  • complex networks
  • connected subgraphs