Constant Amortized Time Enumeration of Eulerian trails

[1]  G. Loukidis,et al.  Fast Assessment of Eulerian Trails , 2020 .

[2]  Nicole Schweikardt,et al.  Enumeration for FO Queries over Nowhere Dense Graphs , 2018, PODS.

[3]  Kunihiro Wasa,et al.  Enumeration of Enumeration Algorithms , 2016, ArXiv.

[4]  Takeaki Uno,et al.  Constant Time Enumeration by Amortization , 2015, WADS.

[5]  Roberto Grossi,et al.  Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs , 2014, ESA.

[6]  Roberto Grossi,et al.  Optimal Listing of Cycles and st-Paths in Undirected Graphs , 2012, SODA.

[7]  Mihai Pop,et al.  Assembly complexity of prokaryotic genomes using short reads , 2010, BMC Bioinformatics.

[8]  Peter Winkler,et al.  Counting Eulerian Circuits is #P-Complete , 2005, ALENEX/ANALCO.

[9]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[10]  Jarkko Kari,et al.  Synchronizing Finite Automata on Eulerian Digraphs , 2003, MFCS.

[11]  Xin He,et al.  Finding double Euler trails of planar graphs in linear time [CMOS VLSI circuit design] , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..

[13]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[14]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[15]  Robert E. Tarjan,et al.  A Note on Finding the Bridges of a Graph , 1974, Inf. Process. Lett..

[16]  C. Hierholzer,et al.  Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren , 1873 .

[17]  Kuntal Roy,et al.  Optimum Gate Ordering of CMOS Logic Gates using Euler Path Approach: Some Insights and Explanations , 2007, J. Comput. Inf. Technol..

[18]  de Ng Dick Bruijn,et al.  Circuits and Trees in Oriented Linear Graphs , 1951 .