Publisher
Springer International Publishing
Reference14 articles.
1. Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1–3), 21–46 (1996).
https://doi.org/10.1016/0166-218X(95)00026-N
2. Bauer, R., Krug, M., Wagner, D.: Enumerating and generating labeled $$k$$-degenerate Graphs. In: ANALCO 2010, pp. 90–98. Society for Industrial and Applied Mathematics (2010).
https://doi.org/10.1137/1.9781611973006.12
3. Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l’institut Henri Poincaré (B) Probabilités et Statistiques 3(4), 433–438 (1967)
4. Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques. In: ICALP 2016, pp. 148:1–148:15 (2016).
https://doi.org/10.4230/LIPIcs.ICALP.2016.148
5. Lecture Notes in Computer Science;A Conte,2017