FRINK Linked Data Fragments server

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

• W1760754504 endingPage "350" @default.
• W1760754504 startingPage "338" @default.
• W1760754504 abstract "We consider how to assign labels to any undirected graph with n nodes such that, given the labels of two nodes and no other information regarding the graph, it is possible to determine the distance between the two nodes. The challenge in such a distance labeling scheme is primarily to minimize the maximum label length and secondarily to minimize the time needed to answer distance queries (decoding). Previous schemes have offered different tradeoffs between label lengths and query time. This paper presents a simple algorithm with shorter labels and shorter query time than any previous solution, thereby improving the state-of-the-art with respect to both label length and query time in one single algorithm. Our solution addresses several open problems concerning label length and decoding time and is the first improvement of label length for more than three decades.More specifically, we present a distance labeling scheme with labels of length log3/2n + o(n) bits1 and constant decoding time. This outperforms all existing results with respect to both size and decoding time, including Winkler's (Combinatorica 1983) decade-old result, which uses labels of size (log 3)n and O(n/log n) decoding time, and Gavoille et al. (SODA'01), which uses labels of size 11n + o(n) and O(log log n) decoding time. In addition, our algorithm is simpler than the previous ones. In the case of integral edge weights of size at most W, we present almost matching upper and lower bounds for the label size e: 1/2(n -- 1) log [W/2 + l] ≤ e ≤ 1/2n log (2W + 1) + O(log n · log(nW)). Furthermore, for r-additive approximation labeling schemes, where distances can be off by up to an additive constant r, we present both upper and lower bounds. In particular, we present an upper bound for 1-additive approximation schemes which, in the unweighted case, has the same size (ignoring second order terms) as an adjacency labeling scheme, namely n/2. We also give results for bipartite graphs as well as for exact and 1-additive distance oracles." @default.
• W1760754504 created "2016-06-24" @default.
• W1760754504 creator A5013587418 @default.
• W1760754504 creator A5026256833 @default.
• W1760754504 creator A5034291253 @default.
• W1760754504 creator A5082427487 @default.
• W1760754504 date "2016-01-10" @default.
• W1760754504 modified "2023-09-26" @default.
• W1760754504 title "Simpler, faster and shorter labels for distances in graphs" @default.
• W1760754504 cites W140456478 @default.
• W1760754504 cites W1543879246 @default.
• W1760754504 cites W1587282847 @default.
• W1760754504 cites W181128013 @default.
• W1760754504 cites W1965650021 @default.
• W1760754504 cites W1971864278 @default.
• W1760754504 cites W1978145399 @default.
• W1760754504 cites W1981272925 @default.
• W1760754504 cites W1983773246 @default.
• W1760754504 cites W1985636891 @default.
• W1760754504 cites W1987699222 @default.
• W1760754504 cites W1990376056 @default.
• W1760754504 cites W1993294649 @default.
• W1760754504 cites W1996722412 @default.
• W1760754504 cites W2002270599 @default.
• W1760754504 cites W2002364208 @default.
• W1760754504 cites W2005945380 @default.
• W1760754504 cites W2006097619 @default.
• W1760754504 cites W2006162221 @default.
• W1760754504 cites W2014912500 @default.
• W1760754504 cites W2017848317 @default.
• W1760754504 cites W2018804864 @default.
• W1760754504 cites W2023365186 @default.
• W1760754504 cites W2025590344 @default.
• W1760754504 cites W2025876682 @default.
• W1760754504 cites W2033112846 @default.
• W1760754504 cites W2034501275 @default.
• W1760754504 cites W2035494495 @default.
• W1760754504 cites W2042604558 @default.
• W1760754504 cites W2045446569 @default.
• W1760754504 cites W2046229991 @default.
• W1760754504 cites W2051311803 @default.
• W1760754504 cites W2051671786 @default.
• W1760754504 cites W2053463486 @default.
• W1760754504 cites W2053578961 @default.
• W1760754504 cites W2057994027 @default.
• W1760754504 cites W2060963839 @default.
• W1760754504 cites W2064876674 @default.
• W1760754504 cites W2074619214 @default.
• W1760754504 cites W2077824753 @default.
• W1760754504 cites W2082352769 @default.
• W1760754504 cites W2087811943 @default.
• W1760754504 cites W2093981583 @default.
• W1760754504 cites W2096304547 @default.
• W1760754504 cites W2115083710 @default.
• W1760754504 cites W2119837203 @default.
• W1760754504 cites W2125082389 @default.
• W1760754504 cites W2127248062 @default.
• W1760754504 cites W2130080588 @default.
• W1760754504 cites W2134373920 @default.
• W1760754504 cites W2151523609 @default.
• W1760754504 cites W2153353483 @default.
• W1760754504 cites W2158278958 @default.
• W1760754504 cites W2158663853 @default.
• W1760754504 cites W2167049470 @default.
• W1760754504 cites W2178933748 @default.
• W1760754504 cites W2194288565 @default.
• W1760754504 cites W2752964345 @default.
• W1760754504 cites W639947448 @default.
• W1760754504 cites W96889678 @default.
• W1760754504 cites W1980073965 @default.
• W1760754504 cites W2413066628 @default.
• W1760754504 cites W2597231855 @default.
• W1760754504 doi "https://doi.org/10.5555/2884435.2884460" @default.
• W1760754504 hasPublicationYear "2016" @default.
• W1760754504 type Work @default.
• W1760754504 sameAs 1760754504 @default.
• W1760754504 citedByCount "9" @default.
• W1760754504 countsByYear W17607545042015 @default.
• W1760754504 countsByYear W17607545042016 @default.
• W1760754504 countsByYear W17607545042019 @default.
• W1760754504 countsByYear W17607545042020 @default.
• W1760754504 countsByYear W17607545042021 @default.
• W1760754504 crossrefType "proceedings-article" @default.
• W1760754504 hasAuthorship W1760754504A5013587418 @default.
• W1760754504 hasAuthorship W1760754504A5026256833 @default.
• W1760754504 hasAuthorship W1760754504A5034291253 @default.
• W1760754504 hasAuthorship W1760754504A5082427487 @default.
• W1760754504 hasConcept C105795698 @default.
• W1760754504 hasConcept C11413529 @default.
• W1760754504 hasConcept C114614502 @default.
• W1760754504 hasConcept C118615104 @default.
• W1760754504 hasConcept C132525143 @default.
• W1760754504 hasConcept C134306372 @default.
• W1760754504 hasConcept C154945302 @default.
• W1760754504 hasConcept C157125643 @default.
• W1760754504 hasConcept C162307627 @default.
• W1760754504 hasConcept C165064840 @default.
• W1760754504 hasConcept C195292467 @default.

• next