A faster diameter problem algorithm for a chordal graph, with a connection to its center problem.
Steve SeifPublished in: Discret. Math. (2021)
Keyphrases
- learning algorithm
- detection algorithm
- optimization algorithm
- cost function
- objective function
- undirected graph
- times faster
- matching algorithm
- dynamic programming
- np hard
- computational complexity
- computational cost
- worst case
- minimum spanning tree
- graph construction
- recognition algorithm
- spanning tree
- memory efficient
- expectation maximization
- preprocessing
- bipartite graph
- graph structure
- maximum flow
- graph based algorithm
- segmentation algorithm
- significant improvement
- k means
- evolutionary algorithm
- search space