1327 search results - page 162 / 266 » Path following algorithm for the graph matching problem |
135
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
147
click to vote
ALGOSENSORS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
175
click to vote
ANTSW
2004
Springer
15 years 7 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
144
click to vote
MP
2010
14 years 10 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
132
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized schedul...