An NP-completeness result of edge search in graphs (Q2014718): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-013-1287-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2075281130
@@ Property / OpenAlex ID: W2075281130 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3861131
@@ Property / cites work: Q3861131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4857782
@@ Property / cites work: Q4857782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5395177
@@ Property / cites work: Q5395177 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for an edge in a graph with restricted test sets
+Normal rank
@@ Property / cites work @@
+Edge search in graphs with restricted test sets
@@ Property / cites work: Edge search in graphs with restricted test sets / rank @@
+Normal rank
@@ Property / cites work @@
+On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges
+Normal rank
@@ Property / cites work @@
+Q4855976
@@ Property / cites work: Q4855976 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic upper bound for the edge identification complexity of graphs
+Normal rank