Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
48 views

How to solve a optimal matching problem where the "quality" of matching is only determined once all nodes are matched

Note: I'm not a mathematician; I'm just a biologist with basic math background trying to solve a scientific problem, so please excuse my ignorance. The gist of the problem is as follows: I have two ...
1 vote
1 answer
165 views

Combinatorial graph optimization problem on integer adjacency matrices

We are given a $n\times n$ symmetric matrix $M$ whose entries are positive integers. Let $z_{i,j}:=\frac{M_{i,j}}{M_{i,j}+\sum_{k\neq i,j}\min(M_{i,k},M_{k,j})}$ for all $1\le i<j \le n$, and $z:=\...
1 vote
0 answers
204 views

Complexity of reordering a matrix which consists independent sub matrices

Introduction: Given a matrix A of a $k$ regular graph G. The matrix A can be divided into 4 sub matrices based on adjacency of vertex $x \in G$. $A_x$ is the symmetric matrix of the graph $(G-x)$, ...