×

Found 16 Documents (Results 1–16)

Computational complexity of covering disconnected multigraphs. (English) Zbl 07530226

Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 85-99 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Complexity of the packing coloring problem for trees. (English) Zbl 1202.05025

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 134-145 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Comparing universal covers in polynomial time. (English) Zbl 1142.68456

Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). Lecture Notes in Computer Science 5010, 158-167 (2008).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software