A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs.
Tiziana CalamoneriMatteo Dell'OreficeAngelo MontiPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- dynamic programming
- minimum spanning tree
- learning algorithm
- preprocessing
- worst case
- graph structure
- spanning tree
- undirected graph
- cost function
- objective function
- np hard
- computational cost
- particle swarm optimization
- search space
- detection algorithm
- graph partitioning
- graph clustering
- directed graph
- matching algorithm
- tree structure
- optimization algorithm
- expectation maximization
- lower bound
- computational complexity