Drawing Order Diagrams Through Two-Dimension Extension
DOI10.7155/jgaa.00645zbMath1529.05115arXiv1906.06208OpenAlexW2949520616MaRDI QIDQ6181952
Tom Hanika, Dominik Dürrschnabel, Gerd Stumme
Publication date: 20 December 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.06208
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On realizable biorders and the biorder dimension of a relation
- The node-deletion problem for hereditary properties is NP-complete
- The complexity of comparability graph recognition and coloring
- Diametral Pairs of Linear Extensions
- Overloaded Orthogonal Drawings
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Planar Lattices
- The approximation of maximum subgraph problems
- Theory and Applications of Satisfiability Testing
- Partially Ordered Sets
- Confluent Hasse Diagrams
- Concept Lattices
This page was built for publication: Drawing Order Diagrams Through Two-Dimension Extension
