A Fast Heuristic for Computing Geodesic Closures in Large Networks.
Florian SeiffarthTamás HorváthStefan WrobelPublished in: DS (2022)
Keyphrases
- dynamic programming
- complex networks
- combinatorial optimization
- network analysis
- optimal solution
- search algorithm
- simulated annealing
- constraint satisfaction
- network topologies
- beam search
- optical networks
- real time
- heuristic solution
- network size
- geodesic distance
- evolutionary algorithm
- face recognition
- neural network