A polynomial time recognition algorithm for probe interval graphs.
Julie L. JohnsonJeremy P. SpinradPublished in: SODA (2001)
Keyphrases
- recognition algorithm
- graph isomorphism
- recognition process
- polynomial time complexity
- bounded treewidth
- iris recognition
- human identification
- computational complexity
- planar graphs
- np complete
- special case
- palmprint
- graph matching
- face databases
- directed graph
- approximation algorithms
- graph databases
- computer vision