Guided Graph Generation: Evaluation of Graph Generators in Terms of Network Statistics, and a New Algorithm.
Jérôme KunegisJun SunEiko YonekiPublished in: CoRR (2023)
Keyphrases
- graph based algorithm
- graph structure
- finding the shortest path
- dominating set
- random graphs
- graph theoretical
- fully connected
- objective function
- weighted graph
- graph theory
- spanning tree
- k means
- graph construction
- segmentation algorithm
- clustering method
- path length
- graph model
- computational complexity
- optimal solution
- breadth first search
- graph clustering
- learning algorithm
- undirected graph
- matching algorithm
- dynamic programming
- probabilistic model
- simulated annealing
- directed graph
- search space
- graph connectivity
- maximum weight
- strongly connected
- worst case
- shortest path problem
- random graph models
- junction tree
- graph mining algorithms
- bipartite graph
- edge weights
- network flow
- adjacency graph
- vertex set
- solution path
- ant colony optimization
- structured data
- planar graphs
- shortest path
- depth first search
- peer to peer
- graph search
- random walk