One-sided weak dominance drawing

DOI10.1016/j.tcs.2018.07.012zbMath1422.68186OpenAlexW2886948259WikidataQ129440936 ScholiaQ129440936MaRDI QIDQ1711831

Sebastián Urrutia, Rodrigo Ferreira da Silva, Vinícius Fernandes dos Santos

Publication date: 18 January 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.07.012

zbMATH Keywords

directed acyclic graphstopological sortsweak dominance drawing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Drawing graphs in two layers
• A recognition algorithm for orders of interval dimension two
• COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES
• The Complexity of the Partial Order Dimension Problem

This page was built for publication: One-sided weak dominance drawing