Variations of the maximum leaf spanning tree problem for bipartite graphs

Authors:
(Ben) P. C. Li;M. Toulouse
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2;Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2
Venue:
Information Processing Letters
Year:
2006

Citing 2
Cited 2

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexities of some interesting problems on spanning trees

Information Processing Letters

Spanning trees with many leaves in regular bipartite graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Minimum entropy orientations

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The maximum leaf spanning tree problem is known to be NP-complete. In [M.S. Rahman, M. Kaykobad, Complexities of some interesting problems on spanning trees, Inform. Process. Lett. 94 (2005) 93-97], a variation on this problem was posed. This variation restricts the problem to bipartite graphs and asks, for a fixed integer K, whether or not the graph contains a spanning tree with at least K leaves in one of the partite sets. We show not only that this problem is NP-complete, but that it remains NP-complete for planar bipartite graphs of maximum degree 4. We also consider a generalization of a related decision problem, which is known to be polynomial-time solvable. We show the problem is still polynomial-time solvable when generalized to weighted graphs.