176 search results - page 28 / 36 » On Directed Triangles in Digraphs |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
TVCG
2010
13 years 5 months ago
2010
—We present a scheme for view-dependent level-of-detail control that is implemented entirely on programmable graphics hardware. Our scheme selectively refines and coarsens an ar...
ATMOS
2007
13 years 9 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
BMCBI
2006
13 years 7 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
ECCC
2010
13 years 4 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...