All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs.
Tiziana CalamoneriDario FrascariaBlerina SinaimeriPublished in: Comput. J. (2013)
Keyphrases
- pairwise
- graph matching
- weighted graph
- graph theoretic
- undirected graph
- random graphs
- attributed graphs
- labeled graphs
- spectral clustering
- pattern recognition
- graph mining
- series parallel
- graph representation
- adjacency matrix
- graph construction
- structured objects
- neural network
- subgraph isomorphism
- connected subgraphs
- small world
- graph data
- edge weights
- spanning tree
- graph theory
- semi supervised
- similarity measure
- social networks