4074 search results - page 252 / 815 » Abstract Graph Transformation |
134
click to vote
OOPSLA
2005
Springer
16 years 1 days ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
153
click to vote
DIS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
154
click to vote
WEA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
148
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
161
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...