Non-Ramsey Graphs Are c log n-Universal.
Hans Jürgen PrömelVojtech RödlPublished in: J. Comb. Theory, Ser. A (1999)
Keyphrases
- graph matching
- data sets
- lower bound
- directed graph
- graph representation
- graph databases
- database
- graph mining
- labeled graphs
- series parallel
- graph clustering
- graph model
- graph structure
- weighted graph
- undirected graph
- graph partitioning
- graph theory
- graph theoretic
- graph data
- pairwise
- pattern recognition
- information systems
- graph isomorphism