Crossing minimization in weighted bipartite graphs
Yükleniyor...
Dosyalar
Tarih
2009-12
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier B.V.
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.
Açıklama
Anahtar Kelimeler
Planarity, Graph drawing, Crossing minimization, Approximation algorithms, Combinatorial optimization, Weighted bipartite graphs, Approximation ratios, Bipartite graphs, Graph layout, NP Complete, Polynomial-time algorithms, Crossings (pipe and cable), Graph theory, Heuristic methods, Polynomial approximation
Kaynak
Journal of Discrete Algorithms
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
7
Sayı
4
Künye
Çakiroglu, O. A., Erten, C., Karataş, Ö. & Sözdinler, M. (2009). Crossing minimization in weighted bipartite graphs. Journal of Discrete Algorithms, 7(4), 439-452. doi:10.1016/j.jda.2008.08.003