1511 search results - page 136 / 303 » Hierarchical Graph Transformation |
152
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
145
Voted
ENTCS
2008
15 years 5 months ago
2008
In the framework of graph transformation, simulation rules define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules f...
139
Voted
CVIU
2004
15 years 4 months ago
2004
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
143
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
144
Voted
DLT
2004
15 years 6 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...