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

On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.

Chamanvir KaurNeeldhara Misra
Published in: CALDAM (2020)
Keyphrases
  • spanning tree
  • parameterized complexity
  • undirected graph
  • minimum spanning trees
  • edge disjoint
  • minimum spanning tree
  • edge weights
  • weighted graph
  • fixed parameter tractable
  • search algorithm
  • constraint satisfaction