The third Ramsey numbers for graphs with at most four edges.
Yuansheng YangPeter RowlinsonPublished in: Discret. Math. (1994)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- undirected graph
- real world graphs
- graph structure
- edge weights
- graph mining
- data sets
- spectral embedding
- graph structures
- graph model
- graph matching
- graph partitioning
- edge detector
- structured objects
- edge information
- graph databases
- graph representation
- graph theoretic
- random graphs
- directed edges
- minimum cost
- massive graphs
- database
- scale space
- subgraph isomorphism
- random walk
- graph construction
- power law