4074 search results - page 138 / 815 » Abstract Graph Transformation |
122
click to vote
WG
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
108
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
124
click to vote
COMBINATORICS
2006
15 years 1 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
115
Voted
JCT
2011
14 years 8 months ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
123
click to vote
ECOOP
2012
Springer
13 years 4 months ago
2012
Springer
Abstract. Since call graphs are an essential starting point for all interprocedural analyses, many tools and frameworks have been developed to generate the call graph of a given pr...