The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs.

Katerina Asdre Stavros D. Nikolopoulos

Published in: Algorithmica (2010)

Keyphrases

endpoints
shortest path
finding the shortest path
polynomially bounded
bipartite graph
graph theory
graph structure
graph representation
graph theoretic
directed graph
graph partitioning
strongly connected
type fuzzy logic systems
neural network
graph kernels
fixed number
graph mining
social network analysis