On enumerating all minimal solutions of feedback problems
- 1 March 2002
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 117 (1-3) , 253-265
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Generating the Acyclic Orientations of a GraphJournal of Algorithms, 1998
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected GraphsSIAM Journal on Computing, 1997
- The maximum clique problemJournal of Global Optimization, 1994
- On generating all maximal independent setsInformation Processing Letters, 1988
- Hard Enumeration Problems in Geometry and CombinatoricsSIAM Journal on Algebraic Discrete Methods, 1986
- Feedback vertex sets and cyclically reducible graphsJournal of the ACM, 1985
- Enumeration of all minimum feedback edge sets in a directed graphInternational Journal of Systems Science, 1980
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978
- The identification of a minimal feedback vertex set of a directed graphIEEE Transactions on Circuits and Systems, 1975
- Trie memoryCommunications of the ACM, 1960