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

DOI10.1007/978-3-642-29700-7_30zbMATH Open1304.05133OpenAlexW2045519960MaRDI QIDQ2898007FDOQ2898007

Authors: Minati De, Sasanka Roy, Subhas C. Nandy 

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_30

Recommendations

• In-place algorithms for computing a largest clique in geometric intersection graphs
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Finding maximum cliques on circular-arc graphs
• On a circle placement problem
• Computing a maximum clique in geometric superclasses of disk graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (4)

• Computing a maximum clique in geometric superclasses of disk graphs
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• In-place algorithms for computing a largest clique in geometric intersection graphs
• Finding a maximum clique in a disk graph

This page was built for publication: In-place algorithms for computing a largest clique in geometric intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898007)