Variations of the maximum leaf spanning tree problem for bipartite graphs

Information Processing Letters

Volumn 97, Issue 4, 2006, Pages 129-132

  Li, P C ^a   Toulouse, M ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Bipartite graphs; Computational complexity; Maximum leaf spanning trees; NP complete

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING;

BIPARTITE GRAPHS; MAXIMUM LEAF SPANNING TREES; NP-COMPLETE; POLYNOMIAL-TIME;

TREES (MATHEMATICS);

EID: 29344436014     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.011     Document Type: Article

References (5)

1. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 Freeman New York
2. C. Moore, and J.M. Robson Hard tiling problems with simple tiles Discrete Comput. Geom. 26 4 2001 573 590
3. P. Lemke The Maximum Leaf Spanning Tree Problem for Cubic Graphs is NP-Complete IMA publication no. 428 1988 University of Minnesota
4. M.S. Rahman, and M. Kaykobad Complexities of some interesting problems on spanning trees Inform. Process. Lett. 94 2005 93 97
5. J.A. Storer Constructing full spanning trees for cubic graphs Inform. Process. Lett. 13 1981 8 11