Shortest Two Disjoint Paths in Polynomial Time

Andreas Björklund; Thore Husfeldt

doi:10.1007/978-3-662-43948-7_18

Shortest Two Disjoint Paths in Polynomial Time

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Originalsprog	Engelsk
Titel	Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I
Antal sider	12
Publikationsdato	2014
ISBN (Trykt)	978-3-662-43947-0
ISBN (Elektronisk)	978-3-662-43948-7
DOI	https://doi.org/10.1007/978-3-662-43948-7_18
Status	Udgivet - 2014

Navn	Lecture Notes in Computer Science
Vol/bind	8572
ISSN	0302-9743

Adgang til dokumentet

10.1007/978-3-662-43948-7_18

Best Paper Award: Best Paper at ICALP 2014, Track A: Algorithms, Complexity and Games
Husfeldt, T. (Modtager), 9 jul. 2014
Pris: Priser, stipendier, udnævnelser

Citationsformater

@inproceedings{f97460fe1d6940c0ab95966772b1b080,

title = "Shortest Two Disjoint Paths in Polynomial Time",

author = "Andreas Bj{\"o}rklund and Thore Husfeldt",

year = "2014",

doi = "10.1007/978-3-662-43948-7_18",

language = "English",

isbn = "978-3-662-43947-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

booktitle = "Automata, Languages, and Programming",

}

Shortest Two Disjoint Paths in Polynomial Time. / Björklund, Andreas; Husfeldt, Thore.
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 2014. (Lecture Notes in Computer Science, Bind 8572).

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Shortest Two Disjoint Paths in Polynomial Time

Adgang til dokumentet

Priser

Best Paper Award: Best Paper at ICALP 2014, Track A: Algorithms, Complexity and Games

Citationsformater