Diameter in iterated path graphs.

Martin Knor Ludovít Niepel

Published in: Discret. Math. (2001)

Keyphrases

graph theoretic
graph matching
directed graph
graph theory
optimal path
series parallel
shortest path
graph structure
edge weights
graph representation
graph clustering
graph construction
graph structures
subgraph isomorphism
strongly connected
average degree
finding the shortest path