Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR ZblGavalec, Martin. Partial order with duality and consistent choice problem. Mathematica slovaca, Tome 46 (1996) no. 4, pp. 327-342. http://geodesic.mathdoc.fr/item/MASLO_1996_46_4_a3/
@article{MASLO_1996_46_4_a3,
author = {Gavalec, Martin},
title = {Partial order with duality and consistent choice problem},
journal = {Mathematica slovaca},
pages = {327--342},
year = {1996},
volume = {46},
number = {4},
mrnumber = {1472627},
zbl = {0890.06002},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1996_46_4_a3/}
}
[1] COOK S. A.: The complexity of theorem proving procedures. In: Proc. Зrd ACM Sуmp. oii the Тheоrу of Cоmputing, ACM, 1971, pp. 151-158. | Zbl
[2] GAVALEC M.: Computational complexity of consistent choice. In: Proc. 5th Conf. of EF TU, Math. Sect., Košice, 1992, pp. 70-74.
[3] GAVALEC M.-HUDEC O.: Balanced location on a graph. Optimization 35 (1995), 367-372. | MR | Zbl
[4] KNUTH D. E.-RAGHUNATHAN A.: The problem of compatible representatives. SIAM J. Discrete Math. 5 (1992), 422 427. | MR | Zbl
[5] Algorithms and Complexity. Handbook of Theoretical Computer Science, rol. A (J. van Leeuven, ed.), Elsevier, Amsterdam, 1990. | Zbl
[6] TARJAN R. E.: Depth-first search and linear graph algorithm. SIAM J. Comput. 1 ( 1972). 146-160. | MR