A Neural-Network Algorithm for A Graph Layout Problem  

Oleh:

Shope, P. ; Cimikowski, A.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 7 no. 2 (1996), page 341-345.
Topik: layout; neural - network; algorithm; graph layout

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.1 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

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 n 2 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 non planar graphs and compare its performance with the heuristic of Nicholson.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali