The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
Katerina AsdreStavros D. NikolopoulosPublished in: CoRR (2008)
Keyphrases
- endpoints
- graph representation
- solution path
- shortest path
- weighted graph
- graph structure
- fixed number
- strongly connected
- structured data
- directed acyclic graph
- path length
- shortest path problem
- graph model
- stable set
- bipartite graph
- directed graph
- hamiltonian path
- random walk
- sufficient conditions
- bounded degree
- polynomially bounded
- graph based algorithm
- dependency graph
- graph databases
- random graphs
- edge weights
- undirected graph
- spanning tree
- neural network
- graph theory
- connected components
- mobile robot
- search engine