Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference15 articles.
1. Brandenburg, F. J. (1989) On the Complexity of Optimal Drawings of Graphs, Preprint, Univ. Passau.
2. Bhatt S. N. and Cosmadakis S. S. (1987) The Complexity of Minimizing Wire Lengths in VLSI Layouts, Inf. Process. Letters 25, 263?267.
3. Czyzowicz J. (1991) Lattice Diagrams with Few Slopes, J. Comb. Theory Series A 56, 96?108.
4. Czyzowicz, J., Pelc, A., Rival, I., and Urrutia, J. (1987) Crooked Diagrams with Few Slopes, Tech. Rep. TR-87-26, University of Ottawa.
5. Ferber, K. and Jürgensen, H. (1969) A Programme for the Drawing of Lattices, in J. Leech (ed.), Computational Problems in Abstract Algebra, Oxford, pp. 83?87.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mapping Sentence and Partial Order Mereology for Perceiving Abstract Art;Psychology and Philosophy of Abstract Art;2016
2. Confluent Hasse Diagrams;Graph Drawing;2012
3. Partial Order and Hasse Diagrams;Ranking and Prioritization for Multi-indicator Systems;2011
4. Basic Principles of Hasse Diagram Technique in Chemistry;Combinatorial Chemistry & High Throughput Screening;2008-11-01
5. Automated Lattice Drawing;Concept Lattices;2004