On covering all cliques of a chordal graph.
Thomas AndreaeCarsten FlotowPublished in: Discret. Math. (1996)
Keyphrases
- graph structure
- weighted graph
- maximal cliques
- undirected graph
- maximum clique
- graph theory
- directed graph
- graphical models
- structured data
- graph theoretic
- graph representation
- np hard
- graph based algorithm
- graph matching
- random walk
- graph databases
- graph model
- graph partitioning
- bipartite graph
- small world
- random graphs
- graph structures
- functional modules
- connected components
- neural network