Compact structure for sparse undirected graphs based on a clique graph partition.
Felipe GlariaCecilia HernándezSusana LadraGonzalo NavarroLilian SalinasPublished in: Inf. Sci. (2021)
Keyphrases
- undirected graph
- graph structure
- vertex set
- directed graph
- directed acyclic graph
- graph structures
- gaussian graphical models
- spanning tree
- adjacency matrix
- graph properties
- random graphs
- graphical models
- min cut
- connected components
- graph representation
- maximum weight
- disjoint paths
- approximation algorithms
- complex networks
- multicommodity flow
- random walk
- minimum cost
- structured data
- normalized cut
- maximum clique
- graph theoretic
- average degree
- weighted graph