Login / Signup

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.

Omer GiménezPetr HlinenýMarc Noy
Published in: SIAM J. Discret. Math. (2006)
Keyphrases
  • independent set
  • maximum clique
  • graph matching
  • graph properties
  • bounded degree
  • directed graph
  • pattern recognition
  • pairwise
  • weighted graph
  • graph representation
  • minimum spanning tree
  • maximum independent set