4074 search results - page 130 / 815 » Abstract Graph Transformation |
144
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
128
click to vote
COCOON
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
108
Voted
VL
1999
IEEE
15 years 6 months ago
1999
IEEE
The formal treatment of visual languages is often based on graph representations. Since the matter of discourse is visual languages, it would be convenient if the formal manipulat...
121
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
121
click to vote
AAAI
2004
15 years 3 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...