Crossing Minimization in Linear Embeddings of Graphs

Authors:
Sumio Masuda;Kazuo Nakajima;Toshinobu Kashiwabara;Toshio Fujisawa
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1990

Citing 4
Cited 15

Embedding graphs in books: a layout problem with applications to VLSI design

SIAM Journal on Algebraic and Discrete Methods
Efficient Planarity Testing

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computational Aspects of VLSI

Computational Aspects of VLSI

Algorithms for the fixed linear crossing number problem

Discrete Applied Mathematics
Crossing Minimization for Symmetries

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Visualization of Parallel Execution Graphs

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An analysis of some linear graph layout heuristics

Journal of Heuristics
Various island-based parallel genetic algorithms for the 2-page drawing problem

PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Genetic algorithms for the 2-page book drawing problem of graphs

Journal of Heuristics
Parallelisation of genetic algorithms for the 2-page crossing number problem

Journal of Parallel and Distributed Computing
Approximating the fixed linear crossing number

Discrete Applied Mathematics
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints

Journal of Discrete Algorithms
Two pages graph layout via recurrent multivalued neural networks

IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
K-pages graph drawing with multivalued neural networks

ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Line crossing minimization on metro maps

GD'07 Proceedings of the 15th international conference on Graph drawing
Exact crossing minimization

GD'05 Proceedings of the 13th international conference on Graph Drawing
Fixed linear crossing minimization by reduction to the maximum cut problem

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A branch-and-cut approach to the crossing number problem

Discrete Optimization

Quantified Score

Hi-index	14.98

Visualization

Abstract

The problem of embedding a graph in the plane with the minimum number of edge crossings arises in some circuit layout problems. It has been known to be NP-hard in general. Recently, in the area of book embedding, this problem was shown to be NP-hard even when the vertices are placed on a straight line l. The authors show that the problem remains NP-hard even if, in addition to these constraints, the positions of the vertices on l are predetermined.