Semidefinite ranking on graphs
Published on Sep 07, 20075084 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