Counting Euler Tours in Undirected Bounded Treewidth Graphs

DOI10.4230/LIPIcs.FSTTCS.2015.246zbMath1366.68359arXiv1510.04035OpenAlexW2963761951MaRDI QIDQ5275372

Nikhil Balaji, Venkatesh Ganesan, Samir Datta

Publication date: 13 July 2017

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

zbMATH Keywords

parallel algorithmsHamiltonian cyclesEuler toursbounded treewidthbounded clique-width

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On \textsf{NC} algorithms for problems on bounded rank-width graphs ⋮ Unnamed Item

This page was built for publication: Counting Euler Tours in Undirected Bounded Treewidth Graphs