Beyond the BEST theorem: fast assessment of Eulerian trails

DOI10.1007/978-3-030-86593-1_11MaRDI QIDQ2140495OpenAlexFDO

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3523580 (Why is no real title available?)
• scientific article; zbMATH DE number 1405693 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• Decremental strongly-connected components and single-source reachability in near-linear time
• Depth-First Search and Linear Graph Algorithms
• Finding All Spanning Trees of Directed and Undirected Graphs
• Multiplying matrices faster than coppersmith-winograd
• On Eulerian circuits and words with prescribed adjacency patterns
• Powers of tensors and fast matrix multiplication
• Reverse-safe data structures for text indexing

Cited in

(6)

• Bounding the number of Eulerian tours in undirected graphs
• Refined bounds on the number of Eulerian tours in undirected graphs
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
• scientific article; zbMATH DE number 790424 (Why is no real title available?)
• 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)