Optimal Listing of Cycles and st-Paths in Undirected Graphs
From MaRDI portal
Publication:5741844
DOI10.1137/1.9781611973105.134zbMath1423.68329arXiv1205.2766OpenAlexW1932436296MaRDI QIDQ5741844
Nadia Pisanti, Etienne Birmelé, Rui Ferreira, Gustavo Sacomoto, Andrea Marino, Romeo Rizzi, Roberto Grossi
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.2766
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Computing and listing \(st\)-paths in public transportation networks, Efficiently Listing Bounded Length st-Paths, Constant amortized time enumeration of Eulerian trails, A general purpose algorithm for counting simple cycles and simple paths of any length, Polynomial-delay and polynomial-space enumeration of large maximal matchings, Unnamed Item, Efficient enumeration of dominating sets for sparse graphs, Unnamed Item, A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number, Refined parameterizations for computing colored cuts in edge-colored graphs
