Experimental comparison of 2-satisfiability algorithms
RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 3, pp. 241-264. 
@article{RO_1991__25_3_241_0,
     author = {Petreschi, Rossella and Simeone, Bruno},
     title = {Experimental comparison of 2-satisfiability algorithms},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {241--264},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {3},
     year = {1991},
     mrnumber = {1128467},
     zbl = {0746.05062},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1991__25_3_241_0/}
}
TY  - JOUR
AU  - Petreschi, Rossella
AU  - Simeone, Bruno
TI  - Experimental comparison of 2-satisfiability algorithms
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1991
SP  - 241
EP  - 264
VL  - 25
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1991__25_3_241_0/
LA  - en
ID  - RO_1991__25_3_241_0
ER  - 
%0 Journal Article
%A Petreschi, Rossella
%A Simeone, Bruno
%T Experimental comparison of 2-satisfiability algorithms
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1991
%P 241-264
%V 25
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1991__25_3_241_0/
%G en
%F RO_1991__25_3_241_0
Petreschi, Rossella; Simeone, Bruno. Experimental comparison of 2-satisfiability algorithms. RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 3, pp. 241-264. http://archive.numdam.org/item/RO_1991__25_3_241_0/

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974. | MR | Zbl

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 | Zbl

3. S. Cook, The Complexity of Theorem Proving Procedures, Proc. 3rd ACM Symp. on Theory of Comput., 1971, pp. 151-158. | Zbl

4. M. Davis and H. Putnam, A Computing Procedure for Qualification Theory, J. of ACM, 1960, 7, pp. 201-215. | MR | Zbl

5. K. W. Deming, Independence Numbers of Graphs - an Extension of the Konig-Egervary Property, Discr. Math., 1979, 27, pp. 23-24. | Zbl

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 | Zbl

7. F. Gavril, Testing for Equality Between Maximum Matching and Minimum Node Covering, Inf. Proc. Lett., 1977, 6, pp. 199-202. | MR | Zbl

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 | Zbl

9. R. M. Karp, The Transitive Closure of a Random Digraph, Rondom structures and algorithms, 1990, 1, pp. 73-93. | MR | Zbl

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 | Zbl

11. W. V. Quine, A Way to Simplifying Truth Functions. Amer. Math. Monthly, 1955, 52, pp. 627-631. | MR | Zbl

12. B. Simeone, Quadratic Zero-Uno Programming, Boolean Functions and Graphs, Ph. D. Diss., Univ. of Waterloo, Ontario, 1979.

13. B. Simeone, Consistency of Quadratic Boolean Equations and the Konig-Egervary Property for Graphs, Ann. Discr. Math., 1985, 25, pp. 281-290. | MR | Zbl

14. R. E. Tarjan, Depth First Search and Linear Graph Algorithms, Siam. J. Comput., 1972, 1, (2), pp. 146-160. | MR | Zbl