Beyond the BEST theorem: fast assessment of Eulerian trails
From MaRDI portal
Publication:2140495
DOI10.1007/978-3-030-86593-1_11OpenAlexW3199375046MaRDI QIDQ2140495FDOQ2140495
Authors: Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi 
Publication date: 20 May 2022
Full work available at URL: https://hal.inria.fr/hal-03498416/file/Estimating_Eulerian_Trails_FCT.pdf
Cites Work
- Powers of tensors and fast matrix multiplication
- Depth-First Search and Linear Graph Algorithms
- Multiplying matrices faster than coppersmith-winograd
- Finding All Spanning Trees of Directed and Undirected Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Eulerian circuits and words with prescribed adjacency patterns
- Decremental strongly-connected components and single-source reachability in near-linear time
- Reverse-Safe Data Structures for Text Indexing
Cited In (6)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- Bounding the number of Eulerian tours in undirected graphs
- Title not available (Why is that?)
- Refined bounds on the number of Eulerian tours in undirected graphs
- Constant amortized time enumeration of Eulerian trails
- Off the Trail: Re-examining the CDCL Algorithm
This page was built for publication: Beyond the BEST theorem: fast assessment of Eulerian trails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140495)
