Abstract: Graph matching plays an important role in computer vision and pattern recognition. Recent graph matching algorithms usually formulate graph matching by a discrete optimization problem, and ...

Implement integer programming for the minimum dominating set problem and its variants using CP_Solver, Gurobi, and COPT. Integer programming is an important tool for solving the domination problem.

This is a python project compatible with Windows. It includes a .exe file in the dist folder to easily run the program. An integer can be inputted and a dynamic graph of the Collatz sequence is ...

ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the ...

ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the ...