FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3183996897> ?p ?o ?g. }

• W3183996897 abstract "The paper presents fault-tolerant (FT) labeling schemes for general graphs, as well as, improved FT routing schemes. For a given n-vertex graph G and a bound f on the number of faults, an f-FT connectivity labeling scheme is a distributed data structure that assigns each of the graph edges and vertices a short label, such that given the labels of a vertex pair s and t, and the labels of at most f failing edges F, one can determine if s and t are connected in G F. The primary complexity measure is the length of the individual labels. Since their introduction by [Courcelle, Twigg, STACS '07], compact FT labeling schemes have been devised only for a limited collection of graph families. In this work, we fill in this gap by proposing two (independent) FT connectivity labeling schemes for general graphs, with a nearly optimal label length. This serves the basis for providing also FT approximate distance labeling schemes, and ultimately also routing schemes. Our main results for an n-vertex graph and a fault bound f are: There is a randomized FT connectivity labeling scheme with a label length of O(f+log n) bits, hence optimal for f=O(log n). This scheme is based on the notion of cycle space sampling [Pritchard, Thurimella, TALG '11]. There is a randomized FT connectivity labeling scheme with a label length of O(log3 n) bits (independent of the number of faults f). This scheme is based on the notion of linear sketches of [Ahn et al., SODA '12]. For a given stretch parameter k≥ 1, there is a randomized routing scheme that routes a message from s to t in the presence of a set F of faulty edges (unknown to s) over a path of length O(|F|2 k)⋅G F (s,t). The routing labels have Õ (f) bits, the messages have Õ (f3) bits, and each routing table has only Õ (f3 n1/k) bits1. The results also hold for weighted graphs with positive polynomial weights. This significantly improves over the state-of-the-art bounds by [Chechik, ICALP '11], providing the first scheme with sub-linear FT labeling and routing schemes for general graphs." @default.
• W3183996897 created "2021-08-02" @default.
• W3183996897 creator A5022875077 @default.
• W3183996897 creator A5052412504 @default.
• W3183996897 date "2021-07-21" @default.
• W3183996897 modified "2023-09-23" @default.
• W3183996897 title "Fault-Tolerant Labeling and Compact Routing Schemes" @default.
• W3183996897 cites W1497822004 @default.
• W3183996897 cites W1543879246 @default.
• W3183996897 cites W1969916852 @default.
• W3183996897 cites W1977293045 @default.
• W3183996897 cites W1982792741 @default.
• W3183996897 cites W1999483000 @default.
• W3183996897 cites W2002270599 @default.
• W3183996897 cites W2002364208 @default.
• W3183996897 cites W2017675289 @default.
• W3183996897 cites W2025590344 @default.
• W3183996897 cites W2025876682 @default.
• W3183996897 cites W2034501275 @default.
• W3183996897 cites W2057994027 @default.
• W3183996897 cites W2060963839 @default.
• W3183996897 cites W2066811549 @default.
• W3183996897 cites W2071346873 @default.
• W3183996897 cites W2102024624 @default.
• W3183996897 cites W2120724233 @default.
• W3183996897 cites W2153507546 @default.
• W3183996897 cites W2199907825 @default.
• W3183996897 cites W2343281498 @default.
• W3183996897 cites W2488670996 @default.
• W3183996897 cites W2766824301 @default.
• W3183996897 cites W2963694357 @default.
• W3183996897 cites W2972150782 @default.
• W3183996897 cites W4230889046 @default.
• W3183996897 cites W4238411931 @default.
• W3183996897 cites W4244278461 @default.
• W3183996897 doi "https://doi.org/10.1145/3465084.3467929" @default.
• W3183996897 hasPublicationYear "2021" @default.
• W3183996897 type Work @default.
• W3183996897 sameAs 3183996897 @default.
• W3183996897 citedByCount "1" @default.
• W3183996897 countsByYear W31839968972023 @default.
• W3183996897 crossrefType "proceedings-article" @default.
• W3183996897 hasAuthorship W3183996897A5022875077 @default.
• W3183996897 hasAuthorship W3183996897A5052412504 @default.
• W3183996897 hasBestOaLocation W31839968972 @default.
• W3183996897 hasConcept C120314980 @default.
• W3183996897 hasConcept C31258907 @default.
• W3183996897 hasConcept C41008148 @default.
• W3183996897 hasConcept C63540848 @default.
• W3183996897 hasConcept C74172769 @default.
• W3183996897 hasConceptScore W3183996897C120314980 @default.
• W3183996897 hasConceptScore W3183996897C31258907 @default.
• W3183996897 hasConceptScore W3183996897C41008148 @default.
• W3183996897 hasConceptScore W3183996897C63540848 @default.
• W3183996897 hasConceptScore W3183996897C74172769 @default.
• W3183996897 hasFunder F4320334678 @default.
• W3183996897 hasLocation W31839968971 @default.
• W3183996897 hasLocation W31839968972 @default.
• W3183996897 hasOpenAccess W3183996897 @default.
• W3183996897 hasPrimaryLocation W31839968971 @default.
• W3183996897 hasRelatedWork W2027487876 @default.
• W3183996897 hasRelatedWork W2124870959 @default.
• W3183996897 hasRelatedWork W2147458933 @default.
• W3183996897 hasRelatedWork W2170821048 @default.
• W3183996897 hasRelatedWork W2270308778 @default.
• W3183996897 hasRelatedWork W2351378856 @default.
• W3183996897 hasRelatedWork W2570560494 @default.
• W3183996897 hasRelatedWork W2978510736 @default.
• W3183996897 hasRelatedWork W3102446781 @default.
• W3183996897 hasRelatedWork W2147034415 @default.
• W3183996897 isParatext "false" @default.
• W3183996897 isRetracted "false" @default.
• W3183996897 magId "3183996897" @default.
• W3183996897 workType "article" @default.