scientific article; zbMATH DE number 432740
bendingcovering graphsdecision- makingdiagramenumerationgraphical data structures for ordered setshierarchyice flow analysismethods of graphical representation of ordered setsmonitoringplanarityrepresentation of ordered sets on surfacesslopestretchingsurveytopological graph theoryupward drawing
Planar graphs; geometric and topological aspects of graph theory (05C10) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02) Combinatorics of partially ordered sets (06A07) Ordered topological structures (06F30) Paired and multiple comparisons; multiple testing (62J15) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)
This paper presents a survey of methods for graphical representation of an ordered set as a two- or three-dimensional figure. Among all graphical data structures for ordered sets, upward drawing is chosen as an appropriate formalism. The role of data structures and ordered sets in decision-making is discussed. The paper presents a study of the relations between several characteristics of ordered sets and the correspondent form of the graphical representation (e.g. planarity, slope, hierarchy, bending and stretching). Transformations of upward drawings (pullups and pushdowns) for the graph structures are described. Several theorems are presented which relate characteristics of covering graphs (orientations) with the number of necessary and sufficient transformations and other numerical characteristics of the enumeration problem. In conclusion, a topological graph theory is discussed in the context of an extension of the representation of ordered sets on surfaces. Results analogous to those presented for the two-dimensional case are proven and presented as theorems. A problem of ice flow analysis and monitoring is discussed as an illustrative example for the presented theory. The author points to new directions for further research in the area. For the entire collection see [Zbl 0778.00036].
- Order, genus, and diagram invariance
- Advances in the theory and practice of graph drawing
- Every triangle-free planar graph has a planar upward drawing
- Obituary: Ivan Rival
- Upward planarity testing
- Combinatorial characterization of upward planarity
- scientific article; zbMATH DE number 3889587 (Why is no real title available?)
- scientific article; zbMATH DE number 3957177 (Why is no real title available?)
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- scientific article; zbMATH DE number 887778 (Why is no real title available?)
- Scalable Visual Analytics in FCA
- Drawing Order Diagrams Through Two-Dimension Extension
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138867)