Partial order with duality and consistent choice problem

Martin Gavalec

Mathematica Slovaca (1996)

  • Volume: 46, Issue: 4, page 327-342
  • ISSN: 0139-9918

How to cite

top

Gavalec, Martin. "Partial order with duality and consistent choice problem." Mathematica Slovaca 46.4 (1996): 327-342. <http://eudml.org/doc/34438>.

@article{Gavalec1996,
author = {Gavalec, Martin},
journal = {Mathematica Slovaca},
keywords = {partial order; polynomial algorithm; NP-completeness; consistent choice problem},
language = {eng},
number = {4},
pages = {327-342},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Partial order with duality and consistent choice problem},
url = {http://eudml.org/doc/34438},
volume = {46},
year = {1996},
}

TY - JOUR
AU - Gavalec, Martin
TI - Partial order with duality and consistent choice problem
JO - Mathematica Slovaca
PY - 1996
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 46
IS - 4
SP - 327
EP - 342
LA - eng
KW - partial order; polynomial algorithm; NP-completeness; consistent choice problem
UR - http://eudml.org/doc/34438
ER -

References

top
  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. (1971) Zbl0253.68020
  2. GAVALEC M., Computational complexity of consistent choice, In: Proc. 5th Conf. of EF TU, Math. Sect., Košice, 1992, pp. 70-74. (1992) 
  3. GAVALEC M.-HUDEC O., Balanced location on a graph, Optimization 35 (1995), 367-372. (1995) Zbl0874.90114MR1396231
  4. KNUTH D. E.-RAGHUNATHAN A., The problem of compatible representatives, SIAM J. Discrete Math. 5 (1992), 422 427. (1992) Zbl0825.68494MR1172750
  5. Algorithms and Complexity, Handbook of Theoretical Computer Science, rol. A (J. van Leeuven, ed.), Elsevier, Amsterdam, 1990. (1990) Zbl0925.68008
  6. TARJAN R. E., Depth-first search and linear graph algorithm, SIAM J. Comput. 1 ( 1972). 146-160. (1972) MR0304178

NotesEmbed ?

top

You must be logged in to post comments.