5889 search results - page 453 / 1178 » Graph Layout Problems |
225
click to vote
JDA
2006
15 years 7 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
191
click to vote
JUCS
2007
15 years 7 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
223
click to vote
ASPDAC
2011
ACM
14 years 11 months ago
2011
ACM
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
204
click to vote
EPIA
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
229
click to vote
ESA
2005
Springer
16 years 1 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...