Login / Signup

Computing role assignments of proper interval graphs in polynomial time.

Pinar HeggernesPim van 't HofDaniël Paulusma
Published in: J. Discrete Algorithms (2012)
Keyphrases
  • computational complexity
  • special case
  • graph isomorphism
  • planar graphs
  • database
  • data sets
  • graph matching
  • interval data
  • graph theory
  • graph representation
  • graph clustering
  • series parallel