scientific article

zbMath1054.68598MaRDI QIDQ3043710

Imrich Vrt'o, Xavier Muñoz, Walter Unger

Publication date: 6 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2265/22650115.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Ranking chain sum orders ⋮ The slotted online one-sided crossing minimization problem on 2-regular graphs ⋮ Parameterized analysis and crossing minimization problems ⋮ A rearrangement of adjacency matrix based approach for solving the crossing minimization problem ⋮ On the 2-layer window width minimization problem ⋮ An FPT algorithm for bipartite vertex splitting ⋮ Link crossing number is NP-hard ⋮ One-sided weak dominance drawing ⋮ Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ Crossing-constrained hierarchical drawings ⋮ Ranking and Drawing in Subexponential Time ⋮ A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ k-Level Crossing Minimization Is NP-Hard for Trees ⋮ On the complexity of crossings in permutations ⋮ Crossing minimization in weighted bipartite graphs

This page was built for publication: