×

Found 3 Documents (Results 1–3)

Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs. (English) Zbl 1211.05031

Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 882-891 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs. (English) Zbl 1248.05204

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 76-85 (2009).
MSC:  05C85 05C10 05C20
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field