Crossing Minimization in Weighted Bipartite Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler. Crossing Minimization in Weighted Bipartite Graphs. In Camil Demetrescu, editor, Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings. Volume 4525 of Lecture Notes in Computer Science, pages 122-135, Springer, 2007. [doi]

The following publications are possibly variants of this publication:

Crossing minimization in weighted bipartite graphsOlca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler. jda, 7(4):439-452, 2009. [doi]

A Robust Biclustering Method Based on Crossing Minimization in Bipartite GraphsCesim Erten, Melih Sözdinler. gd 2009: 439-440 [doi]

runs on WebDSL