88,856 research outputs found

    On the complexity of finding multi-constrained spanning trees

    No full text
    AbstractIn this paper we present some new results concerning the classification of undirected spanning tree problems from the viewpoint of their computational complexity. Specifically, we study some problems asking for the existence in an undirected, unweighted graph, of a spanning tree satisfying one or several constraints. Thus we extend to the multi-constrained, unweighted case, the analysis that we have already made in a previous work for the one-constrained, weighted case. The problems are classified as solvable in polynomial time or NP-complete
    corecore