Recognition algorithms for orders of small width and graphs of small Dilworth number

Order

Volumn 20, Issue 4, 2003, Pages 351-364

  Felsner, Stefan ^a   Raghavan, Vijay ^b   Spinrad, Jeremy ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Dilworth number; Partial order; Recognition algorithms; Width

Indexed keywords

EID: 18244391201     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:ORDE.0000034609.99940.fb     Document Type: Article

References (31)

1. Arlazarov, V. L., Dinic, E. A., Kronrod, M. A. and Faradzev, I. A.: On economical construction of the transitive closure of a directed graph, Soviet Math. Dokl. 11 (1970), 1209-1210.
2. 0.5), Inf. Proc. Lett. 37 (1991), 237-240.
3. Atkinson, M. D. and Chang, H. W.: Linear extensions of posets of bounded width, Congressus Numerantium 52 (1986), 21-35.
4. Benzaken, C., Hammer, P. L. and de Werra, D.: Threshold characterization of graphs with Dilworth number 2, J. Graph Theory 9 (1985), 245-267.
5. Benzaken, C., Hammer, P. L. and de Werra, D.: Split graphs of Dilworth number two, Discrete Math. 55 (1985), 123-128.
6. Bondy, J. A. and Murty, U. S. R.: Graph Theory with Applications, Elsevier, New York/Macmillan, London, 1976.
7. Cheriyan, J.: Randomized O(M(|V|)) algorithms for problems in matching theory, SIAM J. Comput. 26 (1997), 1635-1655.
8. Chvátal, V. and Hammer, P. L.: Set-packing and threshold graphs, University of Waterloo Research Report CORR73-21, 1973.
9. Chvátal, V. and Hammer, P. L.: Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (1977), 145-162.
10. Colbourn, C. J. and Pulleyblank, W. R.: Minimizing setups in ordered sets of fixed width, Order 1 (1985), 225-228.
11. Gormen, T. H., Leiserson, C. E. and Rivest, R. L.: Introduction to Algorithms, MIT Press, 1990.
12. Coppersmith, D. and Winograd, S.: Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 251-280.
13. Dilworth, R. P.: A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950), 161-166.
14. Dilworth, R. P.: Some combinatorial problems on partially ordered sets, In: Bellman and Hall (eds), Combinatorial Analysis, Proc. Sympos. Appl. Math. 10, 1960, pp. 85-90.
15. Földes, S. and Hammer, P. L.: The Dilworth number of a graph, Ann. Discrete Math. 2 (1978), 211-219.
16. Fulkerson, D. R.: Note on Dilworth's embedding theorem for partially ordered sets, Proc. Amer. Math. Soc. 7 (1956), 701-702.
17. Gavril, F.: Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks 17 (1987), 465-470.
18. Golumbic, M. C.: Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
19. Gorgos, I. M.: Characterization of quasitriangulated graphs, Technical Report, University of Kishinev, 1982.
20. Hoàng, C. T. and Mahadev, N. V. R.: A note on perfect orders, Discrete Math. 74 (1989), 77-84.
21. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2 (1973), 225-231.
22. Mahadev, N. V. R. and Peled, U. N.: Threshold graphs and related topics, Ann. Discrete Math. 56 (1995).
23. McConnell, R. and Spinrad, J.: Linear time transitive orientation, In: ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 19-25.
24. Pappadimitriou, C. H. and Yannakakis, M. Scheduling interval ordered tasks, SIAM J. Comput. 8 (1979), 405-409.
25. Payan, C.: Perfectness and Dilworth number, Discrete Math. 44 (1983), 229-230.
26. Raghavan, V. and Tripathi, A.: Improved diagnosability algorithms, IEEE Trans. Comput. 2 (1991), 143-153.
27. Sidney, J. B. and Steiner, G.: Optimal sequencing by modular decomposition: Polynomial algorithms, Oper. Res. 34 (1986), 606-612.
28. Steiner, G.: Polynomial algorithms to count linear extensions in certain posets, Congressus Numerantium 75 (1990), 71-90.
29. Strassen, V.: Gaussian elimination is not optimal, Numer. Math. 13 (1969), 354-356.
30. Tarjan, R. E.: Data Structures and Network Algorithms, CBMS Series 44, SIAM, Philadelphia, 1983.
31. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6 (1977), 80-82.