From copair hypergraphs to median graphs with latent vertices.
Jean-Pierre BarthélemyPublished in: Discret. Math. (1989)
Keyphrases
- graph theory
- adjacency matrix
- weighted graph
- labeled graphs
- maximal cliques
- undirected graph
- random graphs
- attributed graphs
- hamiltonian cycle
- directed edges
- average degree
- planar graphs
- graph partitioning
- directed graph
- edge weights
- median graph
- graph matching
- connected subgraphs
- graph mining
- latent variables
- minimum weight
- spanning tree
- graph databases
- phase transition
- minimum spanning tree
- graph theoretic
- graph representation
- maximum cardinality
- hypergraph model
- graph data
- vertex set
- graph clustering
- complex networks
- graph structure
- connected components