Sökning: id:"swepub:oai:lup.lub.lu.se:1322b88d-f2ea-461c-a46f-225bd8aee829" >
Directed Hamiltonic...
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
-
- Björklund, Andreas (författare)
- Lund University,Lunds universitet,Institutionen för datavetenskap,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Computer Science,Departments at LTH,Faculty of Engineering, LTH
-
Kaski, Petteri (författare)
-
Koutis, Ioannis (författare)
-
(creator_code:org_t)
- 2017
- 2017
- Engelska 14 s.
-
Ingår i: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). ; , s. 1-91
- Relaterad länk:
-
http://dx.doi.org/10... (free)
-
visa fler...
-
https://lup.lub.lu.s...
-
https://doi.org/10.4...
-
visa färre...
Abstract
Ämnesord
Stäng
- We are motivated by a tantalizing open question in exact algorithms: can we detect whether an n-vertex directed graph G has a Hamiltonian cycle in time significantly less than 2^n? We present new randomized algorithms that improve upon several previous works: 1. We show that for any constant 0
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)