Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...