1327 search results - page 122 / 266 » Path following algorithm for the graph matching problem |
120
click to vote
SMI
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
114
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
109
click to vote
BROADNETS
2005
IEEE
15 years 7 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
111
click to vote
LATIN
2010
Springer
15 years 12 days ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
102
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...