Efficient connectivity testing of hypercubic networks with faults
DOI10.1007/978-3-642-19222-7_19zbMATH Open1326.68209OpenAlexW1631244656MaRDI QIDQ3000506FDOQ3000506
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
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
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)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Title not available (Why is that?)
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Optimal numberings and isoperimetric problems on graphs
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
- Computational complexity of long paths and cycles in faulty hypercubes
Cited In (4)
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)
