Login / Signup

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

Neng FanPanos M. Pardalos
Published in: J. Comb. Optim. (2011)
Keyphrases
  • adjacency matrix
  • graph edit distance
  • graph representation
  • graph matching
  • weighted graph
  • directed graph
  • undirected graph
  • graph partitioning
  • pattern recognition
  • graphical models