On the Tractability of Yen's Algorithm and Contact Graph Modeling in Contact Graph Routing.
Olivier De JonckèreJuan A. FraireScott BurleighPublished in: WiSEE (2023)
Keyphrases
- graph based algorithm
- graph structure
- computational complexity
- learning algorithm
- graph partitioning
- dominating set
- solution path
- similarity measure
- detection algorithm
- graph search
- dynamic programming
- graph construction
- graph theoretical
- random graphs
- minimum spanning tree
- undirected graph
- spanning tree
- graph model
- adjacency graph
- weighted graph
- matching algorithm
- np hard
- graph theory
- k means
- shortest path problem
- clustering method
- breadth first search
- maximum flow
- segmentation algorithm
- finding the shortest path
- objective function
- polynomial time complexity
- search algorithm
- maximum weight
- probabilistic model
- markov random field
- structured data
- path length
- graph representation
- ant colony optimization
- connected components
- spectral clustering
- bipartite graph