Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Generation, enumeration and tiling
|
|
|---|---|---|
| Article Number | 12 | |
| Number of page(s) | 19 | |
| DOI | https://doi.org/10.1051/ita/2025010 | |
| Published online | 15 October 2025 | |
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st edn. W. H. Freeman (1979). [Google Scholar]
- R. Karp, Reducibility Among Combinatorial Problems, 40 (1972) 85–103. [Google Scholar]
- R. Kiesel and A. Schidler, A dynamic maxsat-based approach to directed feedback vertex sets (2022) https://arxiv.org/abs/2211.06109v1. [Google Scholar]
- M. Lemaic, Markov-Chain-Based Heuristics for the Feedback Vertex Set Problem for Digraphs. PhD thesis, Universität zu Köln (2008). [Google Scholar]
- H. Levy and D.W. Low, A contraction algorithm for finding small cycle cutsets. J. Algorithms 9 (1988) 470–493. [CrossRef] [MathSciNet] [Google Scholar]
- H.-M. Lin and J.-Y. Jou, On computing the minimum feedback vertex set of a directed graph by contraction operations. IEEE Trans, Comput. Aided Des. Integr. Circuits Syst. 19 (2000) 295–307. [Google Scholar]
- A. Church and J.B. Rosser, Some properties of conversion. Trans. Am. Math. Soc. 39 (1936) 472–482. [Google Scholar]
- F. Baader and T. Nipkow, Term Rewriting and All That. Cambridge University Press (1998). [Google Scholar]
- H. Ehrig and B.K. Rosen, Parallelism and concurrency of graph manipulations. Theoret. Comput. Sci. 11 (1980) 247–275. [Google Scholar]
- B.K. Rosen, Correctness of parallel programs: the Church-Rosser approach. Theoret. Comput. Sci. 2 (1976) 183–207. [Google Scholar]
- M. Abdenbi, A. Blondin Massé, A. Goupil and O. Marcotte, On the confluence of directed graph reductions preserving feedback vertex set minimality, in Proceedings of the 13th Edition of the Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, edited by S. Brlek and L. Ferrari Bordeaux, France, 24-28th June 2024, vol. 403 of Electronic Proceedings in Theoretical Computer Science. Open Publishing Association (2024) 6–11. [Google Scholar]
- A.V. Aho, R. Sethi and J.D. Ullman, Code optimization and finite Church–Rosser systems, in Design and Optimization of Compilers. Prentice-Hall, Englewood Cliffs, NJ (1972). [Google Scholar]
- A. Lubiw, A note on odd/even cycles. Discrete Appl. Math. 22 (1988) 87–92. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.