More results on the complexity of identifying problems in graphs (Q264560): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6561609
@@ Property / zbMATH DE Number: 6561609 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph theory
@@ Property / zbMATH Keywords: graph theory / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity classes
@@ Property / zbMATH Keywords: complexity classes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial hierarchy
@@ Property / zbMATH Keywords: polynomial hierarchy / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-completeness
@@ Property / zbMATH Keywords: NP-completeness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hardness
@@ Property / zbMATH Keywords: hardness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+identifying codes
@@ Property / zbMATH Keywords: identifying codes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+twin-free graphs
@@ Property / zbMATH Keywords: twin-free graphs / rank @@
+Normal rank

Revision as of 14:10, 27 June 2023