Complexity of spanning tree problems with leaf-dependent objectives

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-F" /><175::AID-NET2>3.0.CO;2-F 10.1002/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-FzbMath0851.90123OpenAlexW1983365347MaRDI QIDQ4887748

Martine Labbé, Mauro Dell'Amico, Francesco Maffioli

Publication date: 5 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199605)27:3<175::aid-net2>3.0.co;2-f

zbMATH Keywords

optimal spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Memory-efficient enumeration of constrained spanning trees

This page was built for publication: Complexity of spanning tree problems with leaf-dependent objectives