×

Found 41 Documents (Results 1–41)

How fast can we reach a target vertex in stochastic temporal graphs? (English) Zbl 1509.68193

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 131, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Counting value sets: algorithm and complexity. (English) Zbl 1344.11084

Howe, Everett W. (ed.) et al., ANTS X. Proceedings of the tenth algorithmic number theory symposium, San Diego, CA, USA, July 9–13, 2012. Berkeley, CA: Mathematical Sciences Publishers (MSP) (ISBN 978-1-935107-00-2/hbk; 978-1-935107-01-9/ebook). The Open Book Series 1, 235-248 (2013).
MSC:  11Y16 11T06 68Q17
PDFBibTeX XMLCite
Full Text: arXiv

Maximum edge-disjoint paths problem in planar graphs. (English) Zbl 1200.05234

Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. 4th international conference, TAMC 2007, Shanghai, China, May 22–25, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72503-9/pbk). Lecture Notes in Computer Science 4484, 566-572 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Algorithmic complexity and communication problems. (Complexité algorithmique et problèmes de communications. Préface de M. Minoux.) (French) Zbl 0765.68005

Collection Technique et Scientifique des Télécommunications. Paris etc.: Masson. XXVII, 228 p. (1992).
MSC:  68-02 68Q25 94-02
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software