Sciweavers

2069 search results - page 307 / 414
» Linear time algorithms for Clobber
Sort
View
DAM
2008
92views more  DAM 2008»
15 years 6 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi
DAM
2007
82views more  DAM 2007»
15 years 6 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang
COMPGEOM
2004
ACM
15 years 10 months ago
Spacetime meshing with adaptive refinement and coarsening
We propose a new algorithm for constructing finite-element meshes suitable for spacetime discontinuous Galerkin solutions of linear hyperbolic PDEs. Given a triangular mesh of som...
Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong F...
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 7 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 7 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska