About: Testing connectivity of faulty networks in sublinear time     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
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.
  • 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. (en)
Title
  • Testing connectivity of faulty networks in sublinear time
  • Testing connectivity of faulty networks in sublinear time (en)
skos:prefLabel
  • Testing connectivity of faulty networks in sublinear time
  • Testing connectivity of faulty networks in sublinear time (en)
skos:notation
  • RIV/00216208:11320/12:10100611!RIV13-GA0-11320___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GP201/08/P298), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika
  • July 2012
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 174016
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/12:10100611
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • vertex expansion; interconnection network; faulty vertex; cycle basis; connectivity; biconnectivity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [1A4FCD7D86F3]
http://linked.open...i/riv/nazevZdroje
  • Journal of Discrete Algorithms
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 14
http://linked.open...iv/tvurceVysledku
  • Dvořák, Tomáš
  • Koubek, Václav
  • Fink, Jiří
  • Gregor, Petr
  • Radzik, Tomasz
http://linked.open...n/vavai/riv/zamer
issn
  • 1570-8667
number of pages
http://bibframe.org/vocab/doi
  • 10.1016/j.jda.2011.12.014
http://localhost/t...ganizacniJednotka
  • 11320
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software