A superclass of Edge-Path-Tree graphs with few cliques.
Nicola ApollonioMassimiliano CaramiaPublished in: Oper. Res. Lett. (2009)
Keyphrases
- weighted graph
- maximal cliques
- graph structure
- shortest path
- spanning tree
- minimum spanning trees
- edge weights
- minimum spanning tree
- undirected graph
- planar graphs
- maximum clique
- tree structure
- root node
- graph theoretic
- graph theory
- strongly connected
- minimum weight
- tree structured data
- edge detection
- disjoint paths
- directed graph
- optimal path
- graph matching
- tree structures
- bipartite graph
- graphical models
- minimum cost
- tree search
- protein interaction networks
- b tree
- hierarchical structure
- association graph
- data structure