22 search results - page 2 / 5 » Efficient edge domination in regular graphs |
CCCG
2010
13 years 7 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
PCM
2010
Springer
13 years 3 months ago
2010
Springer
Ringing and noise amplification are the most dominant artifacts in image deconvolution. These artifacts can be reduced by introducing image prior into the deconvolution process. A ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...