Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-009-0146-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2090216307
@@ Property / OpenAlex ID: W2090216307 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758854
@@ Property / cites work: Q3758854 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Unit disk graph recognition is NP-hard
@@ Property / cites work: Unit disk graph recognition is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q5708492
@@ Property / cites work: Q5708492 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Defective coloring revisited
@@ Property / cites work: Defective coloring revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q4268437
@@ Property / cites work: Q4268437 / rank @@
+Normal rank
@@ Property / cites work @@
+Independence and Coloring Problems on Intersection Graphs of Disks
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3744180
@@ Property / cites work: Q3744180 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Improper Colourings of Unit Disk Graphs
@@ Property / cites work: Improper Colourings of Unit Disk Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Simple heuristics for unit disk graphs
@@ Property / cites work: Simple heuristics for unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank