136 search results - page 14 / 28 » On Touching Triangle Graphs |
109
click to vote
PAKDD
2011
ACM
14 years 2 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
94
Voted
DM
2011
14 years 6 months ago
2011
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
126
click to vote
SI3D
2003
ACM
15 years 4 months ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
114
click to vote
EJC
2008
14 years 11 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
ESOP
2006
Springer
15 years 3 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...