en-sl
en-de
en-es
en-fr
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Semidefinite ranking on graphs
Published on Feb 4, 20255093 Views
We consider the problem of ranking the vertices of an undirected graph given some preference relation. This ranking on graphs problem has been tackled before using spectral relaxations in [1]. The