Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space

From MaRDI portal
Publication:2110607
Jump to:navigation, search

DOI10.1007/978-3-030-60440-0_3OpenAlexW3096408430MaRDI QIDQ2110607

Céline M. F. Swennenhuis, Michał Pilipczuk, Karol Węgrzycki, Jesper Nederlof

Publication date: 21 December 2022

Full work available at URL: https://arxiv.org/abs/2002.04368


zbMATH Keywords

connectivityHamiltonian cyclepolynomial spacetreedepth


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (4)

Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space ⋮ Computing generalized convolutions faster than brute force




This page was built for publication: Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2110607&oldid=14611318"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki