Login / Signup
A new heuristic for finding verifiable k-vertex-critical subgraphs.
Alex Gliesch
Marcus Ritt
Published in:
J. Heuristics (2022)
Keyphrases
</>
data structure
dynamic programming
simulated annealing
sufficient conditions
optimal solution
search algorithm
graph mining
pattern mining
search strategies
labeled graphs
maximum clique