Sciweavers

176 search results - page 21 / 36
» On Directed Triangles in Digraphs
Sort
View
FOCS
2003
IEEE
14 years 20 days ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
VISUALIZATION
1996
IEEE
13 years 11 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
IJRR
2006
89views more  IJRR 2006»
13 years 7 months ago
Time-optimal Trajectories for an Omni-directional Vehicle
A common mobile robot design consists of three `omniwheels' arranged at the vertices of an equilateral triangle, with wheel axles aligned with the rays from the center of the...
Devin J. Balkcom, Paritosh A. Kavathekar, Matthew ...
TOG
2012
224views Communications» more  TOG 2012»
11 years 9 months ago
Lagrangian vortex sheets for animating fluids
Buoyant turbulent smoke plumes with a sharp smoke-air interface, such as volcanic plumes, are notoriously hard to simulate. The surface clearly shows small-scale turbulent structu...
Tobias Pfaff, Nils Thürey, Markus H. Gross
WG
2010
Springer
13 years 5 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski