A heuristic for listing almost-clique minimal separators of a graph.
Hisao TamakiPublished in: CoRR (2021)
Keyphrases
- maximum independent set
- maximum weight
- independent set
- graph properties
- graph theory
- maximum clique
- graph search
- quasi cliques
- breadth first search
- graph theoretic
- search algorithm
- random walk
- depth first search
- optimal solution
- minimum spanning tree
- graph model
- graph representation
- weighted graph
- bipartite graph
- directed graph
- simulated annealing
- structured data
- clique tree
- tabu search
- graph structure
- genetic algorithm
- dynamic programming
- solution quality
- heuristic function
- directed acyclic graph
- graph partitioning
- undirected graph
- spanning tree
- graph databases