×

Found 3,353 Documents (Results 501–600)

On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1485.68171

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 66-79 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Directed path-width of sequence digraphs. (English) Zbl 1521.68099

Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 79-93 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Cut sparsifiers for balanced digraphs. (English) Zbl 1522.05164

Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 277-294 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Primitivity and local primitivity of digraphs and nonnegative matrices. (Russian, English) Zbl 1413.05229

Diskretn. Anal. Issled. Oper. 25, No. 3, 95-125 (2018); translation in J. Appl. Ind. Math. 12, No. 3, 453-469 (2018).
MSC:  05C50 05C20 15B33
PDFBibTeX XMLCite
Full Text: DOI

Dyck-Eulerian digraphs. (English) Zbl 1397.05094

Garijo, Delia (ed.) et al., Discrete mathematics days 2018. Extended abstracts of the 11th “Jornadas de matemática discreta y algorítmica” (JMDA), Sevilla, Spain, June 27–29, 2018. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 68, 239-244 (2018).
MSC:  05C45 05C20 68R15
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

all top 3

Software