×

Found 6 Documents (Results 1–6)

Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. (English) Zbl 1268.05046

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 323-328 (2009).
MSC:  05C05 05C85
PDFBibTeX XMLCite
Full Text: DOI

Convex partitions of graphs. (English) Zbl 1341.05198

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 147-151 (2007).
MSC:  05C70 05C69 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field