Partial order with duality and consistent choice problem
Mathematica Slovaca (1996)
- Volume: 46, Issue: 4, page 327-342
- ISSN: 0139-9918
Access Full Article
topHow to cite
topReferences
top- 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. (1971) Zbl0253.68020
- GAVALEC M., Computational complexity of consistent choice, In: Proc. 5th Conf. of EF TU, Math. Sect., Košice, 1992, pp. 70-74. (1992)
- GAVALEC M.-HUDEC O., Balanced location on a graph, Optimization 35 (1995), 367-372. (1995) Zbl0874.90114MR1396231
- KNUTH D. E.-RAGHUNATHAN A., The problem of compatible representatives, SIAM J. Discrete Math. 5 (1992), 422 427. (1992) Zbl0825.68494MR1172750
- Algorithms and Complexity, Handbook of Theoretical Computer Science, rol. A (J. van Leeuven, ed.), Elsevier, Amsterdam, 1990. (1990) Zbl0925.68008
- TARJAN R. E., Depth-first search and linear graph algorithm, SIAM J. Comput. 1 ( 1972). 146-160. (1972) MR0304178