Advanced search
Start date
Betweenand
(Reference retrieved automatically from Google Scholar through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Algorithms for terminal Steiner trees

Full text
Author(s):
Martinez‚ F.V. ; de Pina‚ J.C. ; Soares‚ J.
Total Authors: 3
Document type: Journal article
Source: THEORETICAL COMPUTER SCIENCE; v. 389, n. 1, p. 133-142, 2007.
FAPESP's process: 03/09925-5 - Foundations of computer science: combinatory algorithms and discrete structures
Grantee:Yoshiharu Kohayakawa
Support Opportunities: PRONEX Research - Thematic Grants