Para depositar en Docta Complutense, identifícate con tu correo @ucm.es en el SSO institucional: Haz clic en el desplegable de INICIO DE SESIÓN situado en la parte superior derecha de la pantalla. Introduce tu correo electrónico y tu contraseña de la UCM y haz clic en el botón MI CUENTA UCM, no autenticación con contraseña.
 

The problem of the optimal biobjective spanning tree

Loading...
Thumbnail Image

Full text at PDC

Publication date

1998

Advisors (or tutors)

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Science
Citations
Google Scholar

Citation

Abstract

This paper studies the problem of finding the set of optimal spanning trees of a connected graph, considering two cost functions defined on the set of edges. This problem is NP-hard and the solution is described through an algorithm that builds the family of efficient trees. This algorithm needs two procedures that solve the following uniobjective problems: the construction of all the spanning trees of a connected graph and the construction of the whole set of minimum cost spanning trees. The computational results obtained are shown in Section 5. (C) 1998 Elsevier Science B.V. All rights reserved.

Research Projects

Organizational Units

Journal Issue

Description

Keywords

Collections