1538 search results - page 145 / 308 » Spectral Techniques in Graph Algorithms |
164
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
210
click to vote
IWPEC
2010
Springer
15 years 1 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
125
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
102
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
125
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...