330 search results - page 20 / 66 » Compressing Bounded Degree Graphs |
SIAMDM
2008
14 years 9 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...
90
Voted
CIAC
1997
Springer
15 years 1 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
ARSCOM
2004
14 years 9 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...