Sciweavers

725 search results - page 88 / 145
» Bounding Degrees on RPL
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
MCS
2008
Springer
13 years 10 months ago
Error analysis of a stochastic immersed boundary method incorporating thermal fluctuations
A stochastic numerical scheme for an extended immersed boundary method which incorporates thermal fluctuations for the simulation of microscopic biological systems consisting of fl...
Paul J. Atzberger, Peter R. Kramer
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 4 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
PODS
1999
ACM
121views Database» more  PODS 1999»
14 years 2 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
13 years 9 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...