Retractions onto series-parallel posets

Discrete Mathematics

Volumn 308, Issue 11, 2008, Pages 2104-2114

  Dalmau, Víctor ^a   Krokhin, Andrei ^b   Larose, Benoit ^c  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b DURHAM UNIVERSITY   (United Kingdom)

^c Civil and Environmental Engineering   (Canada)

Author keywords

Complexity; Poset retraction; Posets; Series parallel

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; FINITE DIFFERENCE METHOD; PARALLEL ALGORITHMS; TOPOLOGY;

POSET RETRACTION; SERIES-PARALLEL;

PROBLEM SOLVING;

EID: 40649129038     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.08.010     Document Type: Article

References (21)

1. Benke M. Some complexity bounds for subtype inequalities. Theoret. Comput. Sci. 212 (1999) 3-27
2. V. Dalmau, J. Pearson, Set functions and width 1 problems, in: Proceedings of the 5th International Conference on Constraint Programming, CP'99, Lecture Notes in Computer Science, vol. 1713, Springer, Berlin, 1999, pp. 159-173.
3. Duffus D., and Rival I. A structure theory for ordered sets. Discrete Math. 35 (1981) 53-118
4. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28 (1998) 57-104
5. Hell P., and Nešetřil J. On the complexity of H-coloring. J. Combin. Theory, Ser. B 48 (1990) 92-110
6. Hell P., and Rival I. Absolute retracts and varieties of reflexive graphs. Canad. J. Math. 39 (1987) 544-567
7. Jawhari M., Misane D., and Pouzet M. Retracts: graphs and ordered sets from metric point of view. Contemp. Math. 57 (1986) 175-226
8. Kun G., and Szabó Cs. Order varieties and monotone retractions of finite posets. Order 18 (2001) 79-88
9. Larose B., and Zádori L. The complexity of the extendibility problem for finite posets. SIAM J. Discrete Math. 17 1 (2003) 114-121
10. Larose B., and Zádori L. Finite posets and topological spaces in locally finite varieties. Algebra Universalis 52 2-3 (2005) 119-136
11. P. Lincoln, J. Mitchell, Algorithmic aspects of type interference with subtypes, in: Proceedings of the 19th ACM Symposium on Principles of Programming Languages, POPL'92, 1992, pp. 293-304.
12. K. Lodaya, P. Weil, Series-parallel posets: algebra, automata and languages, in: Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science, STACS'98, 1998, pp. 555-565.
13. Möhring R.H. Computationally tractable classes of ordered sets. Algorithms and Order (Ottawa, 1987) (1989), Kluwer, Dordrecht 105-193
14. Möhring R.H., and Schäffter M.W. Scheduling series-parallel orders subject to 0 / 1-communication delays. Parallel Comput. 25 (1999) 23-40
15. Nevermann P., and Rival I. Holes in ordered sets. Graphs Combin. 11 (1985) 339-350
16. Pratt V., and Tiuryn J. Satisfiability of inequalities in a poset. Fund. Inform. 28 (1996) 165-182
17. Rival I. Stories about order and the letter N (en). Contemp. Math. 57 (1986) 263-285
18. Spanier E. Algebraic Topology (1966), McGraw-Hill, New York
19. Szabó Cs., and Zádori L. Idempotent totally symmetric operations on finite posets. Order 18 (2001) 39-47
20. Valdes J., Tarjan R.E., and Lawler E.L. The recognition of series-parallel digraphs. SIAM J. Comput. 11 (1982) 298-313
21. Zádori L. Series parallel posets with nonfinitely generated clones. Order 10 (1993) 305-316