A More Powerful Heuristic for Balancing an Unbalanced Graph.
Sukhamay KunduAmit Anil NanavatiPublished in: COMPLEX NETWORKS (2) (2022)
Keyphrases
- depth first search
- structured data
- graph search
- optimal solution
- maximum independent set
- min sum
- breadth first search
- graph structure
- combinatorial optimization
- dynamic programming
- random walk
- graph matching
- graph theory
- weighted graph
- minimum spanning tree
- graph representation
- np hard
- dependency graph
- graph model
- bipartite graph
- spanning tree
- undirected graph
- tabu search
- graph theoretic
- directed acyclic graph
- graph clustering
- search procedure
- simulated annealing
- computationally tractable
- shortest path
- graph based algorithm
- solution quality
- neural network