Testing connectivity of faulty networks in sublinear time (Q450565): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2011.12.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2003185032
@@ Property / OpenAlex ID: W2003185032 / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
+Normal rank
@@ Property / cites work @@
+Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+On finding a cycle basis with a shortest maximal cycle
+Normal rank
@@ Property / cites work @@
+Efficient Connectivity Testing of Hypercubic Networks with Faults
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
+Normal rank
@@ Property / cites work @@
+Q4780520
@@ Property / cites work: Q4780520 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank