Graphs such that every two edges are contained in a shortest cycle.
Nathalie HomobonoClaudine PeyratPublished in: Discret. Math. (1989)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- real world graphs
- shortest path
- edge weights
- graph structure
- directed edges
- spectral embedding
- graph mining
- graph theory
- graph matching
- complex structures
- graph representation
- random graphs
- series parallel
- structured objects
- connected components
- pattern recognition
- massive graphs
- approximation algorithms
- graph theoretic
- edge detector
- subgraph isomorphism
- bayesian networks