| Title:
|
Partial order with duality and consistent choice problem (English) |
| Author:
|
Gavalec, Martin |
| Language:
|
English |
| Journal:
|
Mathematica Slovaca |
| ISSN:
|
0139-9918 |
| Volume:
|
46 |
| Issue:
|
4 |
| Year:
|
1996 |
| Pages:
|
327-342 |
| . |
| Category:
|
math |
| . |
| MSC:
|
06A06 |
| MSC:
|
68Q25 |
| idZBL:
|
Zbl 0890.06002 |
| idMR:
|
MR1472627 |
| . |
| Date available:
|
2009-09-25T11:16:49Z |
| Last updated:
|
2012-08-01 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/136678 |
| . |
| Reference:
|
[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 0253.68020 |
| Reference:
|
[2] GAVALEC M.: Computational complexity of consistent choice.In: Proc. 5th Conf. of EF TU, Math. Sect., Košice, 1992, pp. 70-74. |
| Reference:
|
[3] GAVALEC M.-HUDEC O.: Balanced location on a graph.Optimization 35 (1995), 367-372. Zbl 0874.90114, MR 1396231 |
| Reference:
|
[4] KNUTH D. E.-RAGHUNATHAN A.: The problem of compatible representatives.SIAM J. Discrete Math. 5 (1992), 422 427. Zbl 0825.68494, MR 1172750 |
| Reference:
|
[5]
: Algorithms and Complexity.Handbook of Theoretical Computer Science, rol. A (J. van Leeuven, ed.), Elsevier, Amsterdam, 1990. Zbl 0925.68008 |
| Reference:
|
[6] TARJAN R. E.: Depth-first search and linear graph algorithm.SIAM J. Comput. 1 ( 1972). 146-160. MR 0304178 |
| . |
