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

DOI10.1007/S10878-010-9326-6zbMATH Open1263.90113OpenAlexW2094686363MaRDI QIDQ411236FDOQ411236

Authors: Neng Fan, Panos M. Pardalos 

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9326-6

Recommendations

• Crossing Minimization in Weighted Bipartite Graphs
• Crossing minimization in weighted bipartite graphs
• Graph Drawing
• On bipartite drawings and the linear arrangement problem
• Breaking cycles for minimizing crossings

zbMATH Keywords

TSPadjacency matrixnetwork flowcrossing minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Crossing Number is NP-Complete
• Title not available (Why is that?)
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization
• Exact algorithms for the quadratic linear ordering problem
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• Crossing Minimization in Weighted Bipartite Graphs

Cited In (1)

• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization

Uses Software

• CPLEX
• Concorde

This page was built for publication: A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411236)