×

Found 250 Documents (Results 1–100)

A convenient graph connectedness for digital imagery. (English) Zbl 1474.68442

Kozubek, Tomáš (ed.) et al., High performance computing in science and engineering. 4th international conference, HPCSE 2019, Karolinka, Czech Republic, May 20–23, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12456, 150-162 (2021).
PDFBibTeX XMLCite
Full Text: DOI

One-way trail orientations. (English) Zbl 1504.05105

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 6, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A Hamiltonian cycle in the square of a 2-connected graph in linear time. (English) Zbl 1403.05077

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1645-1649 (2018).
MSC:  05C45 05C40
PDFBibTeX XMLCite
Full Text: Link

A semi-automatic proof of strong connectivity. (English) Zbl 1403.68221

Paskevich, Andrei (ed.) et al., Verified software. Theories, tools, and experiments. 9th international conference, VSTTE 2017, Heidelberg, Germany, July 22–23, 2017. Revised selected papers. Cham: Springer (ISBN 978-3-319-72307-5/pbk; 978-3-319-72308-2/ebook). Lecture Notes in Computer Science 10712, 49-65 (2017).
MSC:  68T15 05-04 05C20 05C40
PDFBibTeX XMLCite
Full Text: DOI HAL

On packing spanning arborescences with matroid constraint. (English) Zbl 1378.05021

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 451-457 (2017).
MSC:  05B35 52B40
PDFBibTeX XMLCite
Full Text: DOI Link

Verified efficient implementation of Gabow’s strongly connected component algorithm. (English) Zbl 1416.68168

Klein, Gerwin (ed.) et al., Interactive theorem proving. 5th international conference, ITP 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14–17, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8558, 325-340 (2014).
MSC:  68T15 05C20 05C40 05C85
PDFBibTeX XMLCite
Full Text: DOI

Complex analysis. In the spirit of Lipman Bers. 2nd revised ed. (English) Zbl 1262.30002

Graduate Texts in Mathematics 245. New York, NY: Springer (ISBN 978-1-4419-7322-1/hbk; 978-1-4419-7323-8/ebook). xviii, 306 p. (2013).
MSC:  30-01 32-01
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field