On the Hardness of Recognizing Bundles in Time Table Graphs.

Annegret Liebers Dorothea Wagner Karsten Weihe

Published in: WG (1999)

Keyphrases

database
graph representation
computational complexity
np hard
bipartite graph
graph theoretic
directed graph
graph matching
graph theory
weighted graph
series parallel
subgraph isomorphism
np hardness
graph structures
automatic recognition
graph structure
learning theory
phase transition
worst case
optimal solution