Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.
Paul ErdösGuantao ChenCecil C. RousseauRichard H. SchelpPublished in: Eur. J. Comb. (1993)
Keyphrases
- problems involving
- weighted graph
- labeled graphs
- undirected graph
- connected subgraphs
- subgraph isomorphism
- query graph
- vertex set
- edge weights
- graph databases
- graph mining
- maximal cliques
- subgraph matching
- graph structures
- graph clustering
- multiple objectives
- graph structure
- solving complex
- attributed graphs
- edge information
- maximum common subgraph
- optimization problems
- graph model
- directed acyclic graph
- random graphs
- shortest path
- graph properties
- data structure
- subgraph mining
- directed graph
- graph theory
- graph theoretic
- densely connected
- planar graphs
- edge detection
- reachability queries
- dense subgraphs
- graph mining algorithms
- graph data