Graph-theoretic algorithms for Kolmogorov operators: Approximating solutions and their gradients in elliptic and parabolic problems on manifolds.
Andrew D. DavisDimitrios GiannakisPublished in: CoRR (2021)
Keyphrases
- graph theoretic
- benchmark problems
- approximate solutions
- specific problems
- optimization problems
- partial solutions
- heuristic methods
- graph theory
- computational issues
- combinatorial problems
- greedy algorithms
- test problems
- efficient solutions
- search methods
- similar problems
- practical solutions
- exact and approximate
- boundary value problem
- maximum independent set
- exact algorithms
- random graphs
- test instances
- exact solution
- combinatorial optimization
- np complete
- approximation schemes
- learning algorithm
- maximal cliques
- particle swarm optimization
- simulated annealing
- computational complexity
- graph properties
- hamiltonian path