The \textsc{max quasi-independent set} problem (Q434194): Difference between revisions

@@ Property / author @@
+Aristotelis Giannakos
@@ Property / author: Aristotelis Giannakos / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-010-9343-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2170054126
@@ Property / OpenAlex ID: W2170054126 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044359
@@ Property / cites work: Q3044359 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / rank @@
+Normal rank
@@ Property / cites work @@
+Mining market data: a network approach
@@ Property / cites work: Mining market data: a network approach / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Pathwidth of cubic graphs and exact algorithms
@@ Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is good
@@ Property / cites work: Greed is good / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-edge subgraph problems
@@ Property / cites work: \(k\)-edge subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of maximal independent sets
@@ Property / cites work: A generalization of maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Selected Applications of Minimum Cuts in Networks
@@ Property / cites work: Selected Applications of Minimum Cuts in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Stars and the Number Three
@@ Property / cites work: Paths, Stars and the Number Three / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank