Free Access
| Issue |
RAIRO-Oper. Res.
Volume 25, Number 3, 1991
|
|
|---|---|---|
| Page(s) | 241 - 264 | |
| DOI | https://doi.org/10.1051/ro/1991250302411 | |
| Published online | 06 February 2017 | |
- 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
- 2. B. ASPVALL, M. F. PLASS and R. E. TARJAN, A Linear Time Algorithm for Testing the Thrue of Certain Quantified Boolean Formulas, Inf. Proc. Lett., 1979, 8, pp. 121-123. [MR: 526451] [Zbl: 0398.68042] [Google Scholar]
- 3. S. COOK, The Complexity of Theorem Proving Procedures, Proc. 3rd ACM Symp. on Theory of Comput., 1971, pp. 151-158. [Zbl: 0253.68020] [Google Scholar]
- 4. M. DAVIS and H. PUTNAM, A Computing Procedure for Qualification Theory, J. of ACM, 1960, 7, pp. 201-215. [MR: 134439] [Zbl: 0212.34203] [Google Scholar]
- 5. K. W. DEMING, Independence Numbers of Graphs - an Extension of the Konig-Egervary Property, Discr. Math., 1979, 27, pp. 23-24. [Zbl: 0404.05034] [Google Scholar]
- 6. S. EVEN, A. ITAI and A. SHAMIR, On the Complexity of Timetable and Multicomodity flow Problems, SIAM J. Comput., 1976, 5, pp. 691-703. [MR: 471974] [Zbl: 0358.90021] [Google Scholar]
- 7. F. GAVRIL, Testing for Equality Between Maximum Matching and Minimum Node Covering, Inf. Proc. Lett., 1977, 6, pp. 199-202. [MR: 471429] [Zbl: 0367.05056] [Google Scholar]
- 8. P. HANSEN, B. JAUMARD and M. MINOUX, Linear Expected-Time Algorithm for Deriving all Logical Conclusion Implied by a set of Boolean Inequalities, Math. Prog., 1986, 34, pp. 223-231. [MR: 838481] [Zbl: 0596.90067] [Google Scholar]
- 9. R. M. KARP, The Transitive Closure of a Random Digraph, Rondom structures and algorithms, 1990, 1, pp. 73-93. [MR: 1068492] [Zbl: 0712.68076] [Google Scholar]
- 10. R. PETRESCHI and B. SIMEONE, A Switching Algorithm for the Solution of Quadratic Boolean Equations, Inf. Proc. Lett., 1980, 11, pp. 199-202. [MR: 596451] [Zbl: 0461.94015] [Google Scholar]
- 11. W. V. QUINE, A Way to Simplifying Truth Functions. Amer. Math. Monthly, 1955, 52, pp. 627-631. [MR: 75886] [Zbl: 0068.24209] [Google Scholar]
- 12. B. SIMEONE, Quadratic Zero-Uno Programming, Boolean Functions and Graphs, Ph. D. Diss., Univ. of Waterloo, Ontario, 1979. [Google Scholar]
- 13. B. SIMEONE, Consistency of Quadratic Boolean Equations and the Konig-Egervary Property for Graphs, Ann. Discr. Math., 1985, 25, pp. 281-290. [MR: 808006] [Zbl: 0648.05046] [Google Scholar]
- 14. R. E. TARJAN, Depth First Search and Linear Graph Algorithms, Siam. J. Comput., 1972, 1, (2), pp. 146-160. [MR: 304178] [Zbl: 0251.05107] [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.