On the Hardness of Recognizing Bundles in Time Table Graphs.

Annegret Liebers Dorothea Wagner Karsten Weihe

Published in: Int. J. Found. Comput. Sci. (2000)

Keyphrases

graph matching
database
graph theoretic
computational complexity
directed graph
information theoretic
phase transition
bipartite graph
graph clustering
learning algorithm
graph structure
weighted graph
graph representation
np hardness
series parallel