scientific article; zbMATH DE number 5777935

MaRDI QIDQ3581682zbMATH OpenFDO

Authors P. C. Lie, Michel Toulouse

Publication date 2 September 2010

Mathematics Subject Classification ID

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

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

Cited in

(4)

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

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)