×

Found 106 Documents (Results 1–100)

Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. (English) Zbl 1354.68302

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 197-208 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subgraphs satisfying MSO properties on \(z\)-topologically orderable digraphs. (English) Zbl 1406.68048

Gutin, Gregory (ed.) et al., Parameterized and exact computation. 8th international symposium, IPEC 2013, Sophia Antipolis, France, September 4–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03897-1/pbk). Lecture Notes in Computer Science 8246, 123-136 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Random walks on some basic classes of digraphs. (English) Zbl 1405.68136

Liu, Zhiming (ed.) et al., Theoretical aspects of computing – ICTAC 2013. 10th international colloquium, Shanghai, China, September 4–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39717-2/pbk). Lecture Notes in Computer Science 8049, 122-140 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 3

Main Field

Software