CPC

2000

13 years 10 months ago
2000

A recently posed question of H

CPC

2004

13 years 10 months ago
2004

Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...

DMTCS

2006

13 years 10 months ago
2006

We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...

CORR

2006

Springer

13 years 10 months ago
2006

Springer

Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...

DM

2008

13 years 11 months ago
2008

The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...

APPROX

2006

Springer

14 years 2 months ago
2006

Springer

Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...

WG

2005

Springer

14 years 4 months ago
2005

Springer

In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...

ICALP

2009

Springer

14 years 11 months ago
2009

Springer

Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...