Testing connectivity of faulty networks in sublinear time

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10100611" target="_blank" >RIV/00216208:11320/12:10100611 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S1570866711001171" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1570866711001171</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jda.2011.12.014" target="_blank" >10.1016/j.jda.2011.12.014</a>

Result language
angličtina
Original language name
Testing connectivity of faulty networks in sublinear time
Original language description
Given a set F of vertices of a connected graph G, we study the problem of testing the connectivity of G - F in polynomial time with respect to |F| and the maximum degree of G. We present two approaches. The first algorithm is designed for graphs with good vertex expansion, while the other solution applies to the class of graphs with cycle basis consisting of cycles of bounded length. We also present an extension of the latter method to test the biconnectivity of G - F.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)