Skip to main content
SpringerLink
Log in

A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we first present a binary linear programming formulation for the crossing minimization problem (CMP) in bipartite graphs. Then we use the models of a modified minimum cost flow problem (MMCF) and a travelling salesman problem (TSP) to approximatively solve the CMP by rearranging the adjacency matrix of the bipartite graph. Our approaches are useful for problems defined on dense bipartite graphs. In addition, we compute the exact crossing numbers for some general dense graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abdullah A, Hussain A (2006) A new biclustering technique based on crossing minimization. Neurocomputing 69:1882–1896

    Article  Google Scholar 

  • Ahmad W, Khokhar A (2007) cHawk: an efficient biclustering algorithm based on bipartite graph crossing minimization. VLDB ’07, Vienna, Austria

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Buchheim C, Wiegele A, Zheng L (2010) Exact algorithms for the quadratic linear ordering problem. INFORMS J Comput 22(1):168–177

    Article  MathSciNet  Google Scholar 

  • Cakiroglu O et al. (2007) Crossing minimization in weighted bipartite graphs. Lect Notes Comput Sci 4525:122–135

    Article  Google Scholar 

  • ILOG CPLEX 11.0 (2007) Users Manual

  • DiMaggio PA, McAllister SR, Floudas CA, Feng XJ, Rabinowitz JD, Rabitz HA (2008) Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies. BMC Bioinform 9:458

    Article  Google Scholar 

  • Garey MR, Johnson DS (1983) Crossing number is NP-complete. SIAM J Algebraic Discrete Methods 4(3):312–316

    Article  MathSciNet  MATH  Google Scholar 

  • Junger M, Mutzel P (1997) 2-layer strainght line crossing minimization: performance of exact and heuristic algorithms. J Graph Algorithms and Appl 1(1):1–25

    MathSciNet  Google Scholar 

  • Laguna M, Marti R (1999) GRASP and path relinking for 2-layer strainght line crossing minimization. INFORMS J Comput 11(1):44–52

    Article  MATH  Google Scholar 

  • Leighton FT (1983) Complexity issues in VLSI. MIT Press, Cambridge

    Google Scholar 

  • Marti R, Laguna M (2003) Heuristics and meta-heuristics for 2-layer straight line crossing minimization. Discrete Appl Math 127:665–678

    Article  MathSciNet  MATH  Google Scholar 

  • Munoz X, Unger W, Vrto I (2002) One sided crossing minimization is np-hard for sparse graphs. Lect Notes Comput Sci 2265:115–123

    Article  MathSciNet  Google Scholar 

  • Valls V, Marti R, Lino P (1996) A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Ann Oper Res 63:233–251

    Article  MATH  Google Scholar 

  • Valls V, Marti R, Lino P (1996) A branch and bound algorithm for arc crossing minimization in bipartite graphs. Eur J Oper Res 90:303–319

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Neng Fan & Panos M. Pardalos

Authors
  1. Neng Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Panos M. Pardalos.

Additional information

Research is partially supported by Air Force grants.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, N., Pardalos, P.M. A rearrangement of adjacency matrix based approach for solving the crossing minimization problem. J Comb Optim 22, 747–762 (2011). https://doi.org/10.1007/s10878-010-9326-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-010-9326-6

Keywords

Search

Navigation