A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.
Derek G. CorneilStephan OlariuLorna StewartPublished in: Inf. Process. Lett. (1995)
Keyphrases
- solution path
- graph representation
- graph theory
- graph theoretic
- hamiltonian path
- random walk
- stable set
- strongly connected
- shortest path problem
- shortest path
- structured data
- graph data
- root node
- graph structure
- graph model
- graphical representation
- bi directional
- dependency graph
- real time
- spanning tree
- graph mining
- weighted graph