176 search results - page 18 / 36 » On Directed Triangles in Digraphs |
JCO
2007
13 years 7 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Homogeneous coordinates are often used in computer graphics and computer vision applications especially for the representation of geometric transformations. The homogeneous coordi...
CAPTECH
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...