605 search results - page 95 / 121 » Constrained Graph Layout |
HICSS
1995
IEEE
14 years 6 days ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
COR
2008
13 years 8 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Existing work on programmable self assembly has focused on deterministic performance guarantees--stability of desirable states. In particular, for any acyclic target graph a binary...
SMI
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real world applications are isometric or near is...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...