Classes of Graphs Which Approximate the Complete Euclidean Graph.
J. Mark KeilCarl A. GutwinPublished in: Discret. Comput. Geom. (1992)
Keyphrases
- graph representation
- graph structure
- weighted graph
- graph theory
- graph databases
- directed graph
- graph construction
- labeled graphs
- graph matching
- graph model
- graph theoretic
- graph clustering
- directed acyclic
- bounded degree
- graph mining
- graph structures
- graph theoretical
- adjacency matrix
- graph search
- graph classification
- graph partitioning
- graph properties
- random graphs
- spanning tree
- subgraph isomorphism
- series parallel
- bipartite graph
- graph patterns
- dynamic graph
- maximum common subgraph
- graph representations
- graph kernels
- evolving graphs
- structural pattern recognition
- reachability queries
- maximum clique
- dense subgraphs
- minimum spanning tree
- graph data
- edge weights
- graph drawing
- connected dominating set
- graph isomorphism
- graphical models
- real world graphs
- graph layout
- web graph
- undirected graph
- connected graphs
- inexact graph matching
- random walk
- social graphs
- structured data
- maximal cliques
- equivalence classes
- attributed graphs
- connected components
- neighborhood graph
- massive graphs
- finding the shortest path
- graph transformation
- proximity graph
- community discovery
- small world
- markov equivalence classes
- directed acyclic graph
- maximum cardinality
- planar graphs
- topological information
- vertex set
- adjacency graph