Graph Drawing
From MaRDI portal
Publication:5897613
DOI10.1007/11618058zbMath1171.68591OpenAlexW4251892597MaRDI QIDQ5897613
Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng
Publication date: 13 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11618058
Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (11)
Parameterized analysis and crossing minimization problems ⋮ Space reduction constraints for the median of permutations problem ⋮ Exploring the median of permutations problem ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ Ranking and Drawing in Subexponential Time ⋮ On graphs associated to sets of rankings ⋮ Medians of Permutations: Building Constraints ⋮ Connecting the dots (with minimum crossings) ⋮ Bipartite Graph Representation of Multiple Decision Table Classifiers ⋮ Improved Parameterized Algorithms for the Kemeny Aggregation Problem ⋮ Crossing minimization in weighted bipartite graphs
This page was built for publication: Graph Drawing
