In-place algorithms for computing a largest clique in geometric intersection graphs

In this paper, we study the problem of designing in-place algorithms for finding the maximum clique in the intersection graphs of axis-parallel rectangles and disks in R2. First, we propose an O(n2logn) time in-place algorithm for finding the maximum clique of the intersection graph of a set of n ax...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 178; pp. 58 - 70
Main Authors:	De, Minati, Nandy, Subhas C., Roy, Sasanka
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 11.12.2014
Subjects:	Bipartite matching Clique Geometric intersection graphs In-place algorithms Clique Bipartite matching Geometric intersection graphs In-place algorithms
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!