176 search results - page 7 / 36 » On Directed Triangles in Digraphs |
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Database search for images containing icons with specific mutual spatial relationships can be facilitated by an appropriately structured index. For the case of images containing s...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
RT
2000
Springer
13 years 11 months ago
2000
Springer
We present an algorithm for ray tracing displacement maps that requires no additional storage over the base model. Displacement maps are rarely used in ray tracing due to the cost...
EJC
2011
13 years 2 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...