Skip to main navigation
Skip to search
Skip to main content
University of Arizona Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Grants
Datasets
Prizes
Search by expertise, name or affiliation
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
Neng Fan
, Panos M. Pardalos
Systems and Industrial Engineering
Applied Mathematics - GIDP
Statistics - GIDP
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A rearrangement of adjacency matrix based approach for solving the crossing minimization problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Crossing Minimization
100%
Rearrangement
68%
Adjacency Matrix
65%
Minimization Problem
59%
Bipartite Graph
58%
Minimum Cost Flow
31%
Crossing number
25%
Travelling salesman problems
23%
Linear programming
19%
Binary
15%
Formulation
13%
Graph in graph theory
9%
Model
6%
Engineering & Materials Science
Traveling salesman problem
37%
Linear programming
29%
Costs
12%