5889 search results - page 808 / 1178 » Graph Layout Problems |
163
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
163
click to vote
SIAMDM
2008
15 years 6 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
178
click to vote
JACM
2007
15 years 6 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
164
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
200
click to vote
IJCM
2002
15 years 6 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...