4074 search results - page 195 / 815 » Abstract Graph Transformation |
139
Voted
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
141
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
134
Voted
OOPSLA
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
103
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
103
click to vote
GD
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...