Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506): Difference between revisions

@@ 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/978-3-642-19222-7_19
+Normal rank
@@ Property / OpenAlex ID @@
+W1631244656
@@ Property / OpenAlex ID: W1631244656 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Existence of Hamiltonian Circuits in Faulty Hypercubes
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
+Normal rank
@@ Property / cites work @@
+Long paths in hypercubes with a quadratic number of faults
+Normal rank
@@ Property / cites work @@
+Computational complexity of long paths and cycles in faulty hypercubes
+Normal rank
@@ Property / cites work @@
+Long paths and cycles in hypercubes with faulty vertices
+Normal rank
@@ Property / cites work @@
+Optimal numberings and isoperimetric problems on graphs
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
+Normal rank