176 search results - page 3 / 36 » On Directed Triangles in Digraphs |
CCCG
2007
13 years 8 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
JCT
2007
13 years 7 months ago
2007
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...
MFCS
2005
Springer
14 years 25 days ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
DAM
2006
13 years 7 months ago
2006
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
VR
1993
IEEE
13 years 11 months ago
1993
IEEE
Screen space rendering statistics were gathered from 150 3D objects, each modeled by between 2K and 40K triangles. While there is wide variance by individual object, the overall t...