3267 search results - page 148 / 654 » Generalized quasirandom graphs |
COMBINATORICA
2007
15 years 4 months ago
2007
Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness gua...
101
click to vote
IPL
2006
15 years 4 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
124
click to vote
SIAMDM
2008
15 years 4 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
112
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
115
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...