Automated lattice drawing

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2961, Issue , 2004, Pages 112-127

  Freese, Ralph ^a  

^a UNIVERSITY OF HAWAII   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; BOOLEAN ALGEBRA; COMPUTER AIDED SOFTWARE ENGINEERING; DATA ACQUISITION; GRAPH THEORY; HEURISTIC PROGRAMMING; MATHEMATICAL OPERATORS; SET THEORY; VISUALIZATION; FORMAL CONCEPT ANALYSIS; INFORMATION ANALYSIS;

HASSE DIAGRAMS; LATTICE THEORY; ORDERED SETS; THREE DIMENSION FORCE ALGORITHMS;

COMPUTER SCIENCE; LATTICE THEORY;

DATA REPRESENTATIONS; HASSE DIAGRAMS;

EID: 9444226481     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24651-0_12     Document Type: Conference Paper

References (26)

1. M. E. Adams, Uniquely complemented lattices, The Dilworth Theorems, Selected Papers of Robert P. Dilworth (K. Bogart, R. Freese, and J. Kung, eds.), Birkhäuser, Basel, 1990, pp. 79-84.
2. A. Aeschlimann and J. Schmid, Drawing orders using less ink, Order 9 (1992), 5-13.
3. G. Birkhoff, Lattice theory, Amer. Math. Soc., Providence, R. I., 1948, rev. ed., Colloquium Publications.
4. A. Day, Ch. Herrmann, and R. Wille, On modular lattices with four generators, Algebra Universalis 2 (1972), 317-323.
5. Alan Day and Ralph Freese, A characterization of identities implying congruence modularity, I, Canad. J. Math. 32 (1980), 1140-1167.
6. R. A. Dean, Completely free lattices generated by partially ordered sets, Trans. Amer. Math. Soc. 83 (1956), 238-249.
7. R. Dedekind, Über die von drei Moduln erzeugte Dualgruppe, Math. Annalen 53 (1900), 371-403.
8. R. P. Dilworth, The role of order in lattice theory, Ordered Sets (I. Rival, ed.), D. Reidel, Dordrecht, Holland, 1982, Proc. of the Banff Symposium on Ordered Sets.
9. P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs, Algorithmica 11 (1994), no. 4, 379-403.
10. Ralph Freese, Jaroslav Ježek, and J. B. Nation, Free lattices, Amer. Math. Soc., Providence, 1995, Mathematical Surveys and Monographs, vol. 42.
11. B. Ganter and R. Wille, Formal Concept Analysis, Springer, Berlin, Heidelberg, New York, 1999, ISBN 3-540-62771-5.
12. M. Garey and D. Johnson, Computers and intractability, a guide to the theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979.
13. M. R. Garey and D. S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983), no. 3, 312-316.
14. A. Garg and R. Tamassia, Advances in graph drawing, Algorithms and Complexity, Springer Verlag, Berlin-New York, 1994, Second Italian Conference, CASC '94, Rome Italy, pp. 12-21.
15. Donald E. Knuth, The art of computer programming. Vol. 3, second ed., Addison-Wesley Publishing Co., Reading, Mass., 1998, Searching and Sorting, Addison-Wesley Series in Computer Science and Information Processing.
16. J. E. McLaughlin, Atomic lattices with unique comparable complements, Proc. Amer. Math. Soc. 7 (1956), 864-866.
17. O. Ore, On the foundations of abstract algebra, I, Ann. Math. 36 (1935), 406-437.
18. Constance Reid, The search for E. T. Bell: also known as John Taine, Math. Assoc. Amer., Washington, D. C., 1993.
19. I. Rival, The diagram, Graphs and order, NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., vol. 147, Reidel, Dordrecht, Boston, 1985, pp. 103-133.
20. I. Rival, Reading, drawing, and order, Algebras and orders, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 389, Kluwer Acad. Publ., Dordrecht, 1991, pp. 359-404.
21. I. Rival and B. Sands, Pictures in lattice theory, Algebraic and geometric combinatorics 65 (1982), 341-355.
22. I. Rival and R. Wille, Lattices freely generated by partially ordered sets: which can be "drawn"?, J. Reine Angew. Math. 310 (1979), 56-80.
23. H. L. Rolf, The free lattice generated by a set of chains, Pacific J. Math. 8 (1958), 585-595.
24. M. Skorsky, Endliche Verbände - Diagramme und Eigenschaften, Ph.D. thesis, Technische Hochschule Darmstadt, 1992.
25. J. Stephan, Liniendiagramme von verbänden, Technische Hochschule Darmstadt, Darmstadt, 1987, Diplomarbeit.
26. R. Wille, Lattices in data analysis: how to draw them with a computer, Algorithms and order (I. Rival, ed.), Univ. Ottawa, 1989, pp. 33-58.