The complexity of testing whether a graph is a superconcentrator (Q1162529): Difference between revisions

@@ Property / author @@
+Manuel Blum
@@ Property / author: Manuel Blum / rank @@
+Normal rank
@@ Property / author @@
+Richard M. Karp
@@ Property / author: Richard M. Karp / 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.1016/0020-0190(81)90050-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1968864043
@@ Property / OpenAlex ID: W1968864043 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4071451
@@ Property / cites work: Q4071451 / rank @@
+Normal rank
@@ Property / cites work @@
+Superconcentrators
@@ Property / cites work: Superconcentrators / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138137
@@ Property / cites work: Q4138137 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/ipl/BlumKVPY81
@@ Property / DBLP publication ID: journals/ipl/BlumKVPY81 / rank @@
+Normal rank