×

Found 15 Documents (Results 1–15)

Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364

Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Interval-like graphs and digraphs. (English) Zbl 1494.68195

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 68, 13 p. (2018).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Descriptive complexity of list H-coloring problems in logspace: a refined dichotomy. (English) Zbl 1401.68104

Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 487-498 (2015).
MSC:  68Q19 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Space complexity of list \(H\)-colouring: a dichotomy. (English) Zbl 1421.68073

Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 349-365 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

The dichotomy of list homomorphisms for digraphs. (English) Zbl 1376.68067

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1703-1713 (2011).
PDFBibTeX XMLCite
Full Text: Link

Adjusted interval digraphs. (English) Zbl 1267.05257

Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 83-91 (2009).
MSC:  05C85 05C20
PDFBibTeX XMLCite
Full Text: DOI

Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Database

all top 5

Year of Publication

Main Field