Algorithms for the fixed linear crossing number problem
Discrete Applied Mathematics
An analysis of some linear graph layout heuristics
Journal of Heuristics
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
IEEE Transactions on Neural Networks
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
Solving the minimum crossing number problem using an improved artificial neural network
ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
| Hi-index | 0.00 |
We present a neural-network algorithm for minimizing edge crossings in drawings of nonplanar graphs. This is an important subproblem encountered in graph layout. The algorithm finds either the minimum number of crossings or an approximation thereof and also provides a linear embedding realizing the number of crossings found. The parallel time complexity of the algorithm is O(1) for a neural network with n2 processing elements, where n is the number of vertices of the graph. We present results from testing a sequential simulator of the algorithm on a set of nonplanar graphs and compare its performance with the heuristic of Nicholson