Complexity of the maximum leaf spanning tree problem on planar and regular graphs.
Alexander ReichPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- spanning tree
- planar graphs
- computational cost
- graph model
- weighted graph
- graph matching
- graph theory
- polynomial time complexity
- minimum spanning tree
- neural network
- directed graph
- computational complexity
- objective function
- bipartite graph
- graph structure
- worst case
- upper bound
- space complexity
- graph theoretic
- edge weights
- video sequences
- curved surfaces
- web pages