A survey of graph layout problems
ACM Computing Surveys (CSUR)
Discrete Mathematics - Kleitman and combinatorics: a celebration
Fractional Lengths and Crossing Numbers
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Two Counterexamples in Graph Drawing
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal one-page tree embeddings in linear time
Information Processing Letters
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
Journal of Experimental Algorithmics (JEA)
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
Graph parameters measuring neighbourhoods in graphs-Bounds and applications
Discrete Applied Mathematics
Multilevel algorithms for linear ordering problems
Journal of Experimental Algorithmics (JEA)
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Approximating crossing minimization in radial layouts
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
k-level crossing minimization is NP-hard for trees
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Two-Layer planarization parameterized by feedback edge set
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Journal of Experimental Algorithmics (JEA)
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
Variable Formulation Search for the Cutwidth Minimization Problem
Applied Soft Computing
Two-Layer Planarization parameterized by feedback edge set
Theoretical Computer Science
| Hi-index | 0.00 |
The bipartite crossing number problem is studied and a connection between this problem and the linear arrangement problem is established. A lower bound and an upper bound for the optimal number of crossings are derived, where the main terms are the optimal arrangement values. Two polynomial time approximation algorithms for the bipartite crossing number are obtained. The performance guarantees are O(log n) and O(log2 n) times the optimal, respectively, for a large class of bipartite graphs on n vertices. No polynomial time approximation algorithm which could generate a provably good solution had been known. For a tree, a formula is derived that expresses the optimal number of crossings in terms of the optimal value of the linear arrangement and the degrees, resulting in an O(n1.6) time algorithm for computing the bipartite crossing number.The problem of computing a maximum weight biplanar subgraph of an acyclic graph is also studied and a linear time algorithm for solving it is derived. No polynomial time algorithm for this problem was known, and the unweighted version of the problem had been known to be NP-hard, even for planar bipartite graphs of degree at most 3.