Scaling laws for maximum coloring of random geometric graphs.
Sem C. BorstMilan BradonjicPublished in: Discret. Appl. Math. (2017)
Keyphrases
- graph theoretical
- uniformly distributed
- graph theory
- graph matching
- geometric information
- topological information
- graph theoretic
- maximum number
- graph mining
- spanning tree
- graph databases
- random graphs
- graph clustering
- structured objects
- graph construction
- subgraph isomorphism
- bayesian networks
- graph model
- randomly generated
- directed graph
- social network analysis
- evolutionary algorithm
- lower bound
- objective function