Thinh D. Nguyen
Abstract
Given an undirected connected graph $G(V, E)$, constructing a spanning tree is a well studied problem with polynomial time algorithms. If we restrict the spanning tree to be "regular" as defined below, it turns out that this becomes a very hard problem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Given an undirected connected graph $G(V, E)$, constructing a spanning tree is a well studied problem with polynomial time algorithms. If we restrict the spanning tree to be "regular" as defined below, it turns out that this becomes a very hard problem.
Key concepts: Spanning tree, Connected dominating set, k-minimum spanning tree, Minimum spanning tree, Combinatorics, Minimum degree spanning tree, Distributed minimum spanning tree, Euclidean minimum spanning tree