1172 search results - page 156 / 235 » Path Algorithms on Regular Graphs |
141
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
142
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
159
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
173
click to vote
SPAA
2006
ACM
16 years 6 hour ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
194
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...