A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation-Reference-Cited by-同舟云学术

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

Published:2011-07 Issue:3 Volume:45 Page:331-346
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Cerioli Marcia R.,Faria Luerbio,Ferreira Talita O.,Protti Fábio

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/2011106/pdf

Reference24 articles.

1. Approximation algorithms for NP-complete problems on planar graphs

2. P. Berman, M. Karpinski and A.D. Scott, Approximation hardness and satisfiability of bounded occurrence instances of SAT, inElectronic Colloquium on Computational Complexity – ECCC(2003).

3. H. Breu,Algorithmic Aspects of Constrained Unit Disk Graphs. Ph.D. thesis, University of British Columbia (1996).

4. Unit disk graph recognition is NP-hard

5. A. Borodin, I. Ivan, Y. Ye and B. Zimny, On sum coloring and sum multi-coloring for restricted families of graphs. Manuscript available at http://www.cs.toronto.edu/~bor/2420f10/stacs.pdf consulted 30 July 2011.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Akane: Perplexity-Guided Time Series Data Cleaning;Proceedings of the ACM on Management of Data;2024-05-29

2. Graphs and Circle-Systems;Birkhäuser Advanced Texts Basler Lehrbücher;2024

3. Space-efficient algorithms for reachability in directed geometric graphs;Theoretical Computer Science;2023-06

4. On the Tractability of Covering a Graph with 2-Clubs;Algorithmica;2022-11-21

5. On the Hardness of Energy Minimisation for Crystal Structure Prediction*;Fundamenta Informaticae;2022-02-15