Optimal Parallel Algorithms for Cut Vertices, Bridges, and Hamiltonian Path in Bounded Interval Tolerance Graphs.
Gur Saran AdharPublished in: ICPADS (2001)
Keyphrases
- parallel algorithm
- hamiltonian path
- graph theoretic
- planar graphs
- parallel computation
- weighted graph
- vertex set
- random graphs
- dynamic programming
- cluster of workstations
- pc cluster
- shared memory
- optimal solution
- labeled graphs
- parallel implementations
- parallel programming
- maximal cliques
- attributed graphs
- graph theory
- constraint satisfaction
- general purpose
- discovery of association rules