Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.

Tamara Mchedlidze Antonios Symvonis

Published in: J. Graph Algorithms Appl. (2011)

Keyphrases

structured data
graph mining
maximal frequent
databases
np hard
graph patterns
lower bound
data model
minimum cost
graph databases
equivalence classes
graph isomorphism