Efficient connectivity testing of hypercubic networks with faults

DOI10.1007/978-3-642-19222-7_19MaRDI QIDQ3000506zbMATH OpenOpenAlexFDO

Authors Tomáš Dvořák, Jiří Fink, Petr Gregor, Tomasz Radzik, Václav Koubek

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19222-7_19

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Testing connectivity of faulty networks in sublinear time
• On the maximal connected component of hypercube with faulty vertices
• Routing in hypercube networks with a constant fraction of faulty nodes
• On the maximal connected component of hypercube with faulty vertices (II)
• On fault-tolerant fixed routing in hypercubes

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Computational complexity of long paths and cycles in faulty hypercubes
• Introduction to algorithms
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Optimal numberings and isoperimetric problems on graphs
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

Cited in

(4)

• Optimal adaptivity of signed-polygon statistics for network testing
• Testing connectivity of faulty networks in sublinear time
• A High-Fault-Coverage Approach for the Test of Data, Control and Handshake Interconnects in Mesh Networks-on-Chip
• Testing st-Connectivity

This page was built for publication: Efficient connectivity testing of hypercubic networks with faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000506)