In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs
DOI10.1007/978-3-642-29700-7_30zbMath1304.05133OpenAlexW2045519960MaRDI QIDQ2898007
Sasanka Roy, Minati De, 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
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
This page was built for publication: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs
