×

Found 3 Documents (Results 1–3)

Minimum cost homomorphisms with constrained costs. (English) Zbl 1476.68110

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 194-206 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting partitions of graphs. (English) Zbl 1260.68176

Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 227-236 (2012).
MSC:  68Q25 05C70 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Approximation of minimum cost homomorphisms. (English) Zbl 1365.05203

Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 587-598 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Year of Publication

Main Field