On pairwise compatibility graphs having Dilworth number k.

Tiziana Calamoneri Rossella Petreschi

Published in: Theor. Comput. Sci. (2014)

Keyphrases

pairwise
computational complexity
small number
graph matching
graph model
data sets
databases
artificial intelligence
information systems
np hard
graph structure
fixed number
maximum number
graph partitioning
random graphs