scientific article; zbMATH DE number 5777935

zbMATH Open1198.05027MaRDI QIDQ3581682FDOQ3581682

Authors: P. C. Lie, Michel Toulouse 

Publication date: 2 September 2010

Title of this publication is not available (Why is that?)

Recommendations

• The maximum-leaf spanning tree problem: Formulations and facets
• Complexity of the maximum leaf spanning tree problem on planar and regular graphs
• An exact algorithm for the maximum leaf spanning tree problem
• An exact algorithm for the maximum leaf spanning tree problem
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• An approximation algorithm for the maximum leaf spanning arborescence problem
• An exact algorithm for the maximum leaf spanning tree problem.
• Maximizing spanning trees in almost complete graphs
• Maximizing spanning trees in almost complete graphs
• Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Cited In (4)

• Complexity of the maximum leaf spanning tree problem on planar and regular graphs
• The connected domination number of grids
• Connected Domination
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581682)