Enumeration of Enumeration Algorithms

In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.

[1]  S. Hakimi,et al.  Generation and Realization of Trees and k-Trees , 1964 .

[2]  Adrian Dumitrescu,et al.  Enumerating Triangulation Paths , 2000, CCCG.

[3]  Shin-Ichi Nakano,et al.  Efficient Generation of Plane Triangulations without Repetitions , 2001, ICALP.

[4]  Trevor I. Fenner,et al.  A Binary Tree Representation and Related Algorithms for Generating Partitions , 1980, Comput. J..

[5]  Jorge Urrutia,et al.  Finding maximum cliques in circle graphs , 1981, Networks.

[6]  Christian Komusiewicz,et al.  Isolation concepts for clique enumeration: Comparison and computational experiments , 2009, Theor. Comput. Sci..

[7]  Andrea Marino,et al.  Via Linear-Time Delay Pitch Enumeration , 2013 .

[8]  Sumio Masuda,et al.  Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph , 1992, J. Algorithms.

[9]  Pinar Heggernes,et al.  Graph-Theoretic Concepts in Computer Science , 2016, Lecture Notes in Computer Science.

[10]  John McKay,et al.  Algorithm 371: Partitions in natural order [A1] , 1970, Commun. ACM.

[11]  Jayme Luiz Szwarcfiter,et al.  Generating All Forest Extensions of a Partially Ordered Set , 2003, CIAC.

[12]  Joe Sawada.  A Fast Algorithm for Generating Nonisomorphic Chord Diagrams , 2002, SIAM J. Discret. Math..

[13]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Finding All Feedback Vertices , 1978, Inf. Process. Lett..

[14]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[15]  C. Greg Plaxton,et al.  On the spanning trees of weighted graphs , 1988, Comb..

[16]  Sergei Bespamyatnikh.  Enumerating pseudo-triangulations in the plane. , 2002 .

[17]  Takeaki Uno.  An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph , 1996, ISAAC.

[18]  Frank Ruskey,et al.  On Rotations and the Generation of Binary Trees , 1993, J. Algorithms.

[19]  Shin-Ichi Nakano,et al.  Listing All st-Orientations , 2011, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[20]  Jayme Luiz Szwarcfiter,et al.  Generating all the Acyclic Orientations of an Undirected Graph , 1999, Inf. Process. Lett..

[21]  Hiroshi Nagamochi,et al.  Constant Time Generation of Biconnected Rooted Plane Graphs , 2010, FAW.

[22]  Frank Ruskey,et al.  Generating Linear Extensions Fast , 1994, SIAM J. Comput..

[23]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[24]  James F. Korsh,et al.  Shifts and Loopless Generation of k-Ary Trees , 1998, Inf. Process. Lett..

[25]  Pim van 't Hof,et al.  Maximal Induced Matchings in Triangle-Free Graphs , 2016, J. Graph Theory.

[26]  Frank Ruskey,et al.  Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) , 2000, J. Algorithms.

[27]  Joseph Y.-T. Leung,et al.  Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.

[28]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[29]  Carla D. Savage,et al.  Gray Code Enumeration of Families of Integer Partitions , 1995, J. Comb. Theory, Ser. A.

[30]  Takeaki Uno,et al.  Listing Chordal Graphs and Interval Graphs , 2006, WG.

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

[32]  Akihisa Tamura,et al.  EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH , 1993 .

[33]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[34]  Nagiza F. Samatova,et al.  A scalable, parallel algorithm for maximal clique enumeration , 2009, J. Parallel Distributed Comput..

[35]  Nadia Creignou,et al.  Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight , 2011, SAT.

[36]  J. Char.  Master circuit matrix , 1968 .

[37]  David Eppstein,et al.  K-Best Enumeration , 2014, Bull. EATCS.

[38]  Roberto Grossi,et al.  Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs , 2011, ESA.

[39]  R. Bowen.  The generation of minimal triangle graphs , 1967 .

[40]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[41]  Joe Sawada,et al.  Finding and listing induced paths and cycles , 2013, Discret. Appl. Math..

[42]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[43]  Andrea Torsello,et al.  A Continuous-Based Approach for Partial Clique Enumeration , 2007, GbRPR.

[44]  Sanjiv Kapoor,et al.  Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs , 1991, WADS.

[45]  Harold N. Gabow,et al.  Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..

[46]  Louis Ibarra,et al.  Generating and characterizing the perfect elimination orderings of a chordal graph , 2003, Theor. Comput. Sci..

[47]  Doron Rotem,et al.  Generation of Binary Trees from Ballot Sequences , 1978, JACM.

[48]  Sandra Mitchell Hedetniemi,et al.  Constant Time Generation of Rooted Trees , 1980, SIAM J. Comput..

[49]  Marie-France Sagot,et al.  A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs , 2013, Algorithms for Molecular Biology.

[50]  E. Rodney Canfield,et al.  A loop-free algorithm for generating the linear extensions of a poset , 1995 .

[51]  J. Ben Rosen,et al.  Algorithms for the quickest path problem and the enumeration of quickest paths , 1991, Comput. Oper. Res..

[52]  Herbert Weinblatt,et al.  A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph , 1972, JACM.

[53]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[54]  Wolfgang Lindenberg,et al.  Clique detection for nondirected graphs: Two new algorithms , 1979, Computing.

[55]  David Avis,et al.  Generating rooted triangulations without repetitions , 1996, Algorithmica.

[56]  Takeaki Uno,et al.  Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs , 1997, ISAAC.

[57]  Ivan Stojmenovic,et al.  Fast algorithms for genegrating integer partitions , 1998, Int. J. Comput. Math..

[58]  Dieter Kratsch,et al.  Listing All Minimal Separators of a Graph , 1998, SIAM J. Comput..

[59]  Masahiro Takagi,et al.  Listing all rectangular drawings with certain properties , 2004 .

[60]  Jean-Paul Laumond.  Enumeration of Articulation Pairs of a Planar Graph , 1985, Inf. Process. Lett..

[61]  Tomomi Matsui,et al.  Finding All the Edge Colorings in Bipartite Graphs , 1994 .

[62]  Takeaki Uno,et al.  On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs , 2013, ISAAC.

[63]  Vladimir Gurvich,et al.  Enumerating Spanning and Connected Subsets in Graphs and Matroids , 2007 .

[64]  Shin-Ichi Nakano,et al.  Efficient Enumeration of All Ladder Lotteries with k Bars , 2014, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[65]  Horst W. Hamacher,et al.  On finding the K best cuts in a network , 1984 .

[66]  Takeaki Uno.  A New Approach for Speeding Up Enumeration Algorithms , 1998, ISAAC.

[67]  Shin-Ichi Nakano,et al.  Constant Time Generation of Trees with Specified Diameter , 2004, WG.

[68]  Maciej M. Syslo,et al.  An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph , 1981, SIAM J. Comput..

[69]  Chandra R. Chegireddy,et al.  Algorithms for finding K-best perfect matchings , 1987, Discret. Appl. Math..

[70]  K. Thulasiraman,et al.  Complexity of computation of a spanning tree enumeration algorithm , 1984 .

[71]  Frank Ruskey,et al.  An efficient algorithm for generating necklaces with fixed density , 1999, SODA '99.

[72]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[73]  Kouichi Hirata,et al.  On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay , 2009, SOFSEM.

[74]  Frank Ruskey,et al.  Generating Necklaces and Strings with Forbidden Substrings , 2000, COCOON.

[75]  Marcin Krzywkowski,et al.  An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree , 2013, FAW-AAIM.

[76]  Yehoshua Sagiv,et al.  Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties , 2008, J. Comput. Syst. Sci..

[77]  Shin-Ichi Nakano,et al.  Constant Time Generation of Linear Extensions , 2005, WALCOM.

[78]  Kazuo Iwama,et al.  Enumeration of isolated cliques and pseudo-cliques , 2009, TALG.

[79]  Fabrizio Grandoni,et al.  Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications , 2008, TALG.

[80]  D. Kroft,et al.  All paths through a maze , 1967 .

[81]  Weifa Liang,et al.  Efficient Enumeration of all Minimal Separators in a Graph , 1997, Theor. Comput. Sci..

[82]  Tomomi Matsui.  A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs , 1997, Algorithmica.

[83]  Shin-ichi Tanigawa,et al.  Fast enumeration algorithms for non-crossing geometric graphs , 2008, SCG '08.

[84]  Tomomi Matsui,et al.  Finding all minimum-cost perfect matchings in Bipartite graphs , 1992, Networks.

[85]  Vladimir Gurvich,et al.  An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension , 2000, Parallel Process. Lett..

[86]  Frank Ruskey,et al.  Simple Combinatorial Gray Codes Constructed by Reversing Sublists , 1993, ISAAC.

[87]  Sergei Bespamyatnikh,et al.  An efficient algorithm for enumeration of triangulations , 2002 .

[88]  K. Fukuda,et al.  Finding All The Perfect Matchings in Bipartite Graphs , 1989 .

[89]  W. Mayeda,et al.  Generation of Trees without Duplications , 1965 .

[90]  Volker Stix,et al.  Finding All Maximal Cliques in Dynamic Graphs , 2004, Comput. Optim. Appl..

[91]  Shin-Ichi Nakano,et al.  More Efficient Generation of Plane Triangulations , 2003, Graph Drawing.

[92]  Nimrod Megiddo,et al.  An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..

[93]  Takeaki Uno,et al.  Generating Chordal Graphs Included in Given Graphs , 2006, IEICE Trans. Inf. Syst..

[94]  James C. Tiernan,et al.  An efficient search algorithm to find the elementary circuits of a graph , 1970, CACM.

[95]  Doron Rotem,et al.  An Algorithm to Generate all Topological Sorting Arrangements , 1981, Computer/law journal.

[96]  Tomonari Masada,et al.  Enumeration of regular triangulations , 1996, SCG '96.

[97]  Jianer Chen,et al.  An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set , 2009, FAW.

[98]  Teruo Hikita.  Listing and Counting Subtrees of Equal Size of a Binary Tree , 1983, Inf. Process. Lett..

[99]  Celina M. H. de Figueiredo,et al.  Generating bicliques of a graph in lexicographic order , 2005, Theor. Comput. Sci..

[100]  Douglas R. Shier,et al.  A paradigm for listing (s, t)-cuts in graphs , 2005, Algorithmica.

[101]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[102]  Jean Marcel Pallo,et al.  Generating trees with n nodes and m leaves , 1987 .

[103]  Matthew Dickerson,et al.  Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors , 1992, Int. J. Comput. Geom. Appl..

[104]  Frank Ruskey,et al.  Adjacent Interchange Generation of Combinations , 1988, J. Algorithms.

[105]  Henning Fernau,et al.  edge dominating set: Efficient Enumeration-Based Exact Algorithms , 2006, IWPEC.

[106]  Frank Ruskey,et al.  A Gray Code for the Ideals of a Forest Poset , 1993, J. Algorithms.

[107]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[108]  JOHN S. WHITE.  Algorithm 374: Restricted partition generator [A1] , 1970, CACM.

[109]  Takeaki Uno,et al.  An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem , 2008, Algorithmica.

[110]  Richard Beigel,et al.  Finding maximum independent sets in sparse and general graphs , 1999, SODA '99.

[111]  Lhouari Nourine,et al.  On the Enumeration of Minimal Dominating Sets and Related Notions , 2014, SIAM J. Discret. Math..

[112]  Jeffrey Xu Yu,et al.  Fast Maximal Cliques Enumeration in Sparse Graphs , 2012, Algorithmica.

[113]  Gideon Ehrlich,et al.  Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.

[114]  I. Semba.  An Efficient Algorithm for Generating All Partitions of the Set {1,2,…, n} , 1984 .

[115]  Vladimir Gurvich,et al.  Generating Minimal k-Vertex Connected Spanning Subgraphs , 2007, COCOON.

[116]  Yoshio Okamoto,et al.  Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs , 2005, WG.

[117]  Andrzej Proskurowski.  On the Generation of Binary Trees , 1980, JACM.

[118]  Komei Fukuda,et al.  Finding All Common Bases in Two Matroids , 1995, Discret. Appl. Math..

[119]  Vladimir Gurvich,et al.  Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms , 2006, J. Graph Theory.

[120]  Petr A. Golovach,et al.  Enumerating minimal dominating sets in chordal bipartite graphs , 2016, Discret. Appl. Math..

[121]  Shin-Ichi Nakano,et al.  Generating Colored Trees , 2005, WG.

[122]  Kazuo Iwama,et al.  Linear-Time Enumeration of Isolated Cliques , 2005, ESA.

[123]  Marcel Wild.  Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree , 2014, Order.

[124]  Vladimir Gurvich,et al.  Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections , 2004, LATIN.

[125]  Toshiki Saitoh,et al.  Random Generation and Enumeration of Proper Interval Graphs , 2009, WALCOM.

[126]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[127]  Zeev Nutov,et al.  Listing minimal edge-covers of intersecting families with applications to connectivity problems , 2009, Discret. Appl. Math..

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

[129]  Shin-Ichi Nakano.  Enumerating Floorplans with n Rooms , 2001, ISAAC.

[130]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[131]  Brendan D. McKay,et al.  Constant Time Generation of Free Trees , 1986, SIAM J. Comput..

[132]  S. Fisk,et al.  Generations of triangulations of the sphere , 1967 .

[133]  Hsin-Hao Su,et al.  Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights , 2010, Algorithmica.

[134]  J. T. Welch.  Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications , 1965, ACM '65.

[135]  Vladimir Gurvich,et al.  Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems , 2004, IPCO.

[136]  Frank Ruskey,et al.  Generating Binary Trees Lexicographically , 1977, SIAM J. Comput..

[137]  Shmuel Zaks,et al.  Generating Trees and Other Combinatorial Objects Lexicographically , 1979, SIAM J. Comput..

[138]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[139]  Mitre Costa Dourado,et al.  Algorithmic aspects of Steiner convexity and enumeration of Steiner trees , 2014, Ann. Oper. Res..

[140]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[141]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[142]  Selmer M. Johnson.  Generation of permutations by adjacent transposition , 1963 .

[143]  Liang Zhao,et al.  IMPROVED ALGORITHMS FOR ENUMERATING TREE-LIKE CHEMICAL GRAPHS WITH GIVEN PATH FREQUENCY , 2008 .

[144]  Tomomi Matsui,et al.  A Note on K-Best Solutions to the Chinese Postman Problem , 1993, SIAM J. Optim..

[145]  Frank Ruskey.  Listing and Counting Subtrees of a Tree , 1981, SIAM J. Comput..

[146]  Joe Sawada,et al.  Generating Bracelets in Constant Amortized Time , 2001, SIAM J. Comput..

[147]  Frédéric Mazoit.  Listing all the minimal separators of a 3-connected planar graph , 2006, Discret. Math..

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

[149]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[150]  Hiroshi Imai,et al.  Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points , 1997, COCOON.

[151]  Takeo Yamada,et al.  Listing all the minimum spanning trees in an undirected graph , 2010, Int. J. Comput. Math..

[152]  John T. Welch,et al.  A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs , 1966, J. ACM.

[153]  Hisao Tamaki,et al.  Space-efficient enumeration of minimal transversals of a hypergraph , 2000 .

[154]  Frank Ruskey.  Generating t-ary Trees Lexicographically , 1978, SIAM J. Comput..

[155]  Lhouari Nourine,et al.  Enumeration aspects of maximal cliques and bicliques , 2009, Discret. Appl. Math..

[156]  M. C. Er.  Enumerating Ordered Trees Lexicographically , 1985, Comput. J..

[157]  S. L. Hakimi,et al.  On trees of a graph and their generation , 1961 .

[158]  Pim van 't Hof,et al.  Maximal Induced Matchings in Triangle-Free Graphs , 2014, WG.

[159]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[160]  Franz Aurenhammer,et al.  Gray Code Enumeration of Plane Straight-Line Graphs , 2007, Graphs Comb..

[161]  Shuji Tsukiyama,et al.  An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset , 1980, J. ACM.

[162]  Shin-Ichi Nakano,et al.  Efficient generation of triconnected plane triangulations , 2001, Comput. Geom..

[163]  Hiroshi Nagamochi,et al.  Listing Triconnected Rooted Plane Graphs , 2010, COCOA.

[164]  Mark B. Wells.  Generation of permutations by transposition , 1961 .

[165]  Yota Otachi,et al.  Random generation and enumeration of bipartite permutation graphs , 2009, J. Discrete Algorithms.

[166]  Vladimir Gurvich,et al.  Generating Paths and Cuts in Multi-pole (Di)graphs , 2004, MFCS.

[167]  Yoshio Okamoto,et al.  Counting the number of independent sets in chordal graphs , 2008, J. Discrete Algorithms.

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

[169]  Tomomi Matsui,et al.  Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs , 1995, Combinatorics and Computer Science.

[170]  Carla D. Savage,et al.  A Gray Code for Necklaces of Fixed Density , 1995, SIAM J. Discret. Math..

[171]  Donald E. Knuth,et al.  Lexicographic permutations with restrictions , 1979, Discret. Appl. Math..

[172]  Nachum Dershowitz.  A simplified loop-free algorithm for generating permutations , 1975 .

[173]  Leon J. Osterweil,et al.  An Algorithm for Finding the Elementary Circuits of a Directed Graph ; CU-CS-024-73 , 1973 .

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

[175]  J. Ponstein,et al.  Self-Avoiding Paths and the Adjacency Matrix of a Graph , 1966 .

[176]  Yoshio Okamoto,et al.  On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints , 2008, COCOON.

[177]  Shin-Ichi Nakano,et al.  Generating All Triangulations of Plane Graphs (Extended Abstract) , 2009, WALCOM.

[178]  Joe Sawada,et al.  A fast algorithm to generate necklaces with fixed content , 2003, Theor. Comput. Sci..

[179]  Lhouari Nourine,et al.  On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets , 2012, ISAAC.

[180]  Peter Damaschke,et al.  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction , 2004, Theor. Comput. Sci..

[181]  Frank Ruskey,et al.  Generating Binary Trees by Transpositions , 1988, J. Algorithms.

[182]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

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

[184]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[185]  Wagner's theorem and combinatorial enumeration of 3-polytopes(Computational Geometry and Discrete Geometry) , 1993 .

[186]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[187]  Ante Graovac,et al.  Enumeration of Acyclic Walks in a Graph , 1993, Discret. Appl. Math..

[188]  Brendan D. McKay,et al.  Generation of Cubic graphs , 2011, Discret. Math. Theor. Comput. Sci..

[189]  Leslie Ann Goldberg.  Polynomial space polynomial delay algorithms for listing families of graphs , 1993, STOC '93.

[190]  T. Kamae,et al.  A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected Paths , 1967, IEEE Transactions on Circuit Theory.

[191]  Sheela Ramanna,et al.  Maximal Clique Enumeration in Finding Near Neighbourhoods , 2013, Trans. Rough Sets.

[192]  Jayme Luiz Szwarcfiter,et al.  A Structured Program to Generate all Topological Sorting Arrangements , 1974, Information Processing Letters.

[193]  Yota Otachi,et al.  Efficient enumeration of ordered trees with k leaves , 2012, Theor. Comput. Sci..

[194]  G. Minty,et al.  A Simple Algorithm for Listing All the Trees of a Graph , 1965 .

[195]  Katsuhisa Yamanaka,et al.  Generating all realizers , 2006 .

[196]  Bapiraju Vinnakota,et al.  Enumeration of Binary Trees , 1994, Inf. Process. Lett..

[197]  Sang Nguyen,et al.  A dual simplex algorithm for finding all shortest paths , 1981, Networks.

[198]  David Eppstein,et al.  Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time , 2010, Exact Complexity of NP-hard Problems.

[199]  M. C. Er.  Lexicographic Listing and Ranking of t-Ary Trees , 1987, Comput. J..

[200]  David Zerling,et al.  Generating binary trees using rotations , 1985, JACM.

[201]  Harold Fredricksen,et al.  An algorithm for generating necklaces of beads in two colors , 1986, Discret. Math..

[202]  Arkady Kanevsky,et al.  Finding all minimum-size separating vertex sets in a graph , 1993, Networks.

[203]  L. Sunil Chandran,et al.  A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph , 2001, COCOON.

[204]  Hiroki Arimura,et al.  Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application , 2012, COCOON.

[205]  S. Yau,et al.  Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems , 1967, IEEE Transactions on Circuit Theory.

[206]  Gen-Huey Chen,et al.  Algorithms for the constrained quickest path problem and the enumeration of quickest paths , 1994, Comput. Oper. Res..

[207]  G. Danielson,et al.  On finding the simple paths and circuits in a graph , 1968 .

[208]  Hiroki Arimura,et al.  Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph , 2014, ISAAC.

[209]  Petr A. Golovach,et al.  An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets , 2013, ICALP.

[210]  Leen Stougie,et al.  Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets , 2012, Theor. Comput. Sci..

[211]  Christian Komusiewicz,et al.  Isolation concepts for efficiently enumerating dense subgraphs , 2009, Theor. Comput. Sci..

[212]  Frank Ruskey,et al.  Generating linear extensions of posets by transpositions , 1992, J. Comb. Theory, Ser. B.

[213]  E. A. Akkoyunlu,et al.  The Enumeration of Maximal Cliques of Large Graphs , 1973, SIAM J. Comput..

[214]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[215]  Vladimir Gurvich,et al.  Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs , 2005, ISAAC.

[216]  M. C. Er.  Efficient Generation of k-ary Trees in Natural Order (Short Note) , 1992, Comput. J..

[217]  Takeaki Uno.  A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases , 1999, COCOON.

[218]  Dorothea Wagner,et al.  Enumerating and Generating Labeled k-degenerate Graphs , 2010, ANALCO.

[219]  Toshihide Ibaraki,et al.  An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..

[220]  Shin-ichi Nakano,et al.  Generating Biconnected Plane Quadrangulations , 2003 .

[221]  Timothy R. Walsh.  Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time , 1998, J. Algorithms.

[222]  Tomomi Matsui,et al.  Algorithms for finding a Kth best valued assignment , 1994, Discret. Appl. Math..

[223]  E. Gilbert.  Gray codes and paths on the N-cube , 1958 .

[224]  Ina Koch,et al.  Enumerating all connected maximal common subgraphs in two graphs , 2001, Theor. Comput. Sci..

[225]  Benno Schwikowski,et al.  On enumerating all minimal solutions of feedback problems , 2002, Discret. Appl. Math..

[226]  Ryuhei Uehara,et al.  Enumeration of Perfect Sequences of Chordal Graph , 2008, ISAAC.

[227]  Frank Ruskey,et al.  Generating t-ary Trees in A-Order , 1988, Inf. Process. Lett..

[228]  Alberto Martelli.  A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph , 1976, JACM.

[229]  J. Jeffry Howbert,et al.  The Maximum Clique Problem , 2007 .

[230]  Frank Ruskey,et al.  Generating Necklaces , 1992, J. Algorithms.

[231]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[232]  Changjie Tang,et al.  Grammar-Oriented Enumeration of Binary Trees , 1997, Comput. J..

[233]  Luc Segoufin,et al.  Enumerating with constant delay the answers to a query , 2013, ICDT '13.

[234]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[235]  T. V. Narayana,et al.  An Algorithm for Generating Partitions and Its Applications , 1971, J. Comb. Theory, Ser. A.

[236]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[237]  Akihisa Tamura,et al.  Combinatorial face enumeration in arrangements and oriented matroids , 1991, Discret. Appl. Math..

[238]  David Eppstein,et al.  Finding the k Smallest Spanning Trees , 1990, BIT.

[239]  Hiroki Arimura,et al.  Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph , 2013, Discovery Science.

[240]  Vijay Kumar,et al.  Faster Enumeration of All Spanning Trees of a Directed Graph , 1995, WADS.

[241]  Emmanuel Loukakis,et al.  A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically , 1981, Computing.

[242]  Manuel Wettstein,et al.  Counting and Enumerating Crossing-free Geometric Graphs , 2014, SoCG.

[243]  Eunice E. Santos,et al.  An anytime-anywhere approach for maximal clique enumeration in social network analysis , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[244]  Vladimir Gurvich,et al.  Generating Cut Conjunctions in Graphs and Related Problems , 2007, Algorithmica.

[245]  V. Murti,et al.  Enumeration of all circuits of a graph , 1969 .

[246]  Joan M. Lucas.  The Rotation Graph of Binary Trees is Hamiltonian , 1987, J. Algorithms.

[247]  Shin-Ichi Nakano,et al.  Constant Time Generation of Set Partitions , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[248]  Shin-Ichi Nakano,et al.  Generating All Series-Parallel Graphs , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[249]  Yehoshua Sagiv,et al.  Full disjunctions: polynomial-delay iterators in action , 2006, VLDB.

[250]  Anthony E. Trojanowski.  Ranking and Listing Algorithms for k-ary Trees , 1978, SIAM J. Comput..

[251]  Marcel Wild,et al.  Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion , 2008, J. Discrete Algorithms.

[252]  K. Sörensen,et al.  AN ALGORITHM TO GENERATE ALL SPANNING TREES OF A GRAPH IN ORDER OF INCREASING COST , 2005 .

[253]  Shin-Ichi Nakano,et al.  Efficient generation of plane trees , 2002, Inf. Process. Lett..

[254]  Shin-Ichi Nakano,et al.  Efficient Generation of Rooted Trees , 2003 .

[255]  James Cheng,et al.  Fast algorithms for maximal clique enumeration with limited memory , 2012, KDD.

[256]  M. C. Er.  A Note on Generating Well-Formed Parenthesis Strings Lexicographically , 1983, Comput. J..

[257]  Pierre Hansen,et al.  Chemical trees enumeration algorithms , 1999, 4OR.

[258]  Frank Ruskey,et al.  Binary Tree Gray Codes , 1985, J. Algorithms.

[259]  Shin-Ichi Nakano,et al.  Efficient enumeration of all ladder lotteries and its application , 2010, Theor. Comput. Sci..

[260]  Richard C. T. Lee,et al.  Generating All Maximal Independent Sets on Trees in Lexicographic Order , 1992, Inf. Sci..

[261]  James F. Korsh.  Loopless Generation of k-Ary Tree Sequences , 1994, Inf. Process. Lett..

[262]  Derek G. Corneil,et al.  Corrections to Bierstone's Algorithm for Generating Cliques , 1972, J. ACM.

[263]  Harold Fredricksen,et al.  Necklaces of beads in k colors and k-ary de Bruijn sequences , 1978, Discret. Math..

[264]  Joe Sawada.  Generating rooted and free plane trees , 2006, TALG.

[265]  H. C. Johnston.  Cliques of a graph-variations on the Bron-Kerbosch algorithm , 2004, International Journal of Computer & Information Sciences.

[266]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[267]  Frank Ruskey,et al.  Generating the Linear Extensions of Certain Posets by Transpositions , 1991, SIAM J. Discret. Math..

[268]  Takeaki Uno,et al.  An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths , 2014, Discovery Science.

[269]  Dieter Kratsch,et al.  Finding All Minimal Separators of a Graph , 1994, STACS.

[270]  Carla D. Savage.  Gray Code Sequences of Partitions , 1989, J. Algorithms.

[271]  Shmuel Zaks,et al.  Generation and Ranking of k-ary Trees , 1982, Inf. Process. Lett..

[272]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[273]  Hiroshi Nagamochi,et al.  Generating Internally Triconnected Rooted Plane Graphs , 2010, TAMC.

[274]  Roberto Grossi,et al.  Efficient bubble enumeration in directed graphs , 2012 .

[275]  Dominique Roelants van Baronaigien.  A Loopless Algorithm for Generating Binary Tree Sequences , 1991, Inf. Process. Lett..

[276]  Jack Snoeyink,et al.  Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm , 2006, ALENEX/ANALCO.

[277]  Anne Berry,et al.  Generating All the Minimal Separators of a Graph , 1999, Int. J. Found. Comput. Sci..