176 search results - page 23 / 36 » On Directed Triangles in Digraphs |
VMV
2004
13 years 8 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
COMPGEOM
2004
ACM
14 years 25 days ago
2004
ACM
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
DIAGRAMS
2004
Springer
14 years 24 days ago
2004
Springer
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result...
IWPEC
2004
Springer
14 years 23 days ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...