Sciweavers

218 search results - page 3 / 44
» Local Properties of Triangular Graphs
Sort
View
JCO
1998
47views more  JCO 1998»
13 years 7 months ago
Localizing Combinatorial Properties for Partitions on Block Graphs
Gerard J. Chang, Frank K. Hwang, Y. C. Yao
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
13 years 11 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
CGF
2002
94views more  CGF 2002»
13 years 7 months ago
Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method
We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models 16. As a result, semiorthogonal wavelet systems have al...
Faramarz F. Samavati, N. Mahdavi-Amiri, Richard M....
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 2 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
LATIN
2004
Springer
14 years 25 days ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...