Beyond the BEST theorem: fast assessment of Eulerian trails
From MaRDI portal
Publication:2140495
DOI10.1007/978-3-030-86593-1_11OpenAlexW3199375046MaRDI QIDQ2140495
Giulia Punzi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Alessio Conte, Roberto Grossi
Publication date: 20 May 2022
Full work available at URL: https://hal.inria.fr/hal-03498416/file/Estimating_Eulerian_Trails_FCT.pdf
Related Items (4)
Constant amortized time enumeration of Eulerian trails ⋮ Bounding the number of Eulerian tours in undirected graphs ⋮ Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs ⋮ Refined bounds on the number of Eulerian tours in undirected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Eulerian circuits and words with prescribed adjacency patterns
- Powers of tensors and fast matrix multiplication
- Finding All Spanning Trees of Directed and Undirected Graphs
- Reverse-Safe Data Structures for Text Indexing
- Decremental strongly-connected components and single-source reachability in near-linear time
- Multiplying matrices faster than coppersmith-winograd
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Beyond the BEST theorem: fast assessment of Eulerian trails
