Add to ORKGA unit disk graph is an intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum independent set problem in unit disk graphs. In contrast to previously known approximation schemes, our approach does not require a geometric representation (specifying the coordinates of the disk centers)
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
International audienceWe propose a polynomial-time algorithm which takes as input a finite set of po...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polyn...
International audienceWe consider the maximum (weight) independent set problem in unit disk graphs. ...
International audienceWe consider the maximum (weight) independent set problem in unit disk graphs. ...
Abstract. A disk graph is the intersection graph of a set of disks with arbitrary diameters in the p...
We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in u...
The goal of this thesis is to show techniques of solving the maximum independent set problem on inte...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
The class of intersection graphs of disks in the Euclidean plane, called disk graphs, was studied fo...
International audienceA (unit) disk graph is the intersection graph of closed (unit) disks in the pl...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
International audienceA (unit) disk graph is the intersection graph of closed (unit) disks in the pl...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
International audienceWe propose a polynomial-time algorithm which takes as input a finite set of po...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polyn...
International audienceWe consider the maximum (weight) independent set problem in unit disk graphs. ...
International audienceWe consider the maximum (weight) independent set problem in unit disk graphs. ...
Abstract. A disk graph is the intersection graph of a set of disks with arbitrary diameters in the p...
We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in u...
The goal of this thesis is to show techniques of solving the maximum independent set problem on inte...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
The class of intersection graphs of disks in the Euclidean plane, called disk graphs, was studied fo...
International audienceA (unit) disk graph is the intersection graph of closed (unit) disks in the pl...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
International audienceA (unit) disk graph is the intersection graph of closed (unit) disks in the pl...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...
International audienceWe propose a polynomial-time algorithm which takes as input a finite set of po...
We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptoti...