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

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.

Spoorthy GundaPallavi JainDaniel LokshtanovSaket SaurabhPrafullkumar Tale
Published in: ACM Trans. Comput. Theory (2021)
Keyphrases
  • undirected graph
  • graph matching
  • approximation algorithms
  • structured data
  • special case
  • np hard
  • query language
  • directed graph
  • graph theory
  • graph structure
  • graph model
  • complex structures