Efficient Connectivity Testing of Hypercubic Networks with Faults

DOI10.1007/978-3-642-19222-7_19zbMath1326.68209OpenAlexW1631244656MaRDI QIDQ3000506

Petr Gregor, Jiří Fink, Tomasz Radzik, Tomáš Dvořák, 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

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

Related Items (1)

Testing connectivity of faulty networks in sublinear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of long paths and cycles in faulty hypercubes
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Efficient Connectivity Testing of Hypercubic Networks with Faults