Login / Signup
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs.
Mrinmoy Hota
Madhumangal Pal
Tapan Kumar Pal
Published in:
Comput. Optim. Appl. (2004)
Keyphrases
</>
planar graphs
weighted graph
undirected graph
vertex set
dynamic programming
hamiltonian cycle
optimal solution
upper bound
graph matching
graph theory
optimal design
adjacency matrix
np complete
directed graph
bipartite graph
random graphs