3471 search results - page 399 / 695 » Obstacle Numbers of Graphs |
187
click to vote
SPAA
2006
ACM
16 years 20 days ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
197
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
222
click to vote
FCS
2009
15 years 4 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
163
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
144
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...