1327 search results - page 90 / 266 » Path following algorithm for the graph matching problem |
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
98
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
127
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
120
Voted
ICCTA
2007
IEEE
15 years 8 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
122
click to vote
ICDCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...