1327 search results - page 104 / 266 » Path following algorithm for the graph matching problem |
115
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
120
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
128
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
131
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
121
click to vote
ALT
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...