Covering the cliques of a graph with vertices.
Paul ErdösTibor GallaiZsolt TuzaPublished in: Discret. Math. (1992)
Keyphrases
- weighted graph
- maximal cliques
- graph structure
- graph theory
- edge weights
- adjacency matrix
- minimum weight
- graph model
- maximum clique
- shortest path
- undirected graph
- labeled graphs
- vertex set
- graph partitioning
- directed edges
- planar graphs
- graph theoretic
- graph representation
- average degree
- spanning tree
- minimum spanning tree
- random graphs
- data objects
- directed graph
- maximum cardinality
- structured data
- hamiltonian cycle
- image segmentation
- connected graphs
- np hard
- query graph
- random walk
- attributed graphs
- random variables
- subgraph isomorphism
- approximation algorithms