1002 search results - page 71 / 201 » Towards Graph Programs for Graph Algorithms |
112
click to vote
CASES
2010
ACM
15 years 15 days ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
134
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
148
click to vote
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
133
click to vote
DAM
2007
15 years 2 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
178
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...