On the logical definability of some maximum leaves problems

MaRDI QIDQ4217594zbMATH OpenFDO

Authors Giulia Galbiati, Angelo Morzenti, Francesco Maffioli

Publication date 11 November 1998

zbMATH Keywords

combinatorial optimization problems

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Spanning Trees with Many Leaves
• An exact algorithm for the maximum leaf spanning tree problem.
• Better Algorithms and Bounds for Directed Maximum Leaf Problems
• Complexity of spanning tree problems with leaf-dependent objectives
• Logical definability of NP optimization problems

This page was built for publication: On the logical definability of some maximum leaves problems

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