1327 search results - page 194 / 266 » Path following algorithm for the graph matching problem |
99
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
101
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
112
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
113
click to vote
ALENEX
2007
15 years 3 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
101
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...