FRINK Linked Data Fragments server

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

• W1970565536 endingPage "1412" @default.
• W1970565536 startingPage "1401" @default.
• W1970565536 abstract "This paper is intended more to ask questions than give answers. Specifically, we consider models for labeling schemes, and discuss issues regarding the number of labels consulted vs. the sizes of the labels. Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consider a graph function f on pairs of vertices (for example, f can be the distance function). In an f - labeling scheme , the labels are constructed in such a way so that given the labels of any two vertices u and v , one can compute the function f ( u , v ) (e.g. the graph distance between u and v ) just by looking at these two labels. Some very involved lower bounds for the sizes of the labels were proven. Also, some highly sophisticated labeling schemes were developed to ensure short labels. In this paper, we demonstrate that such lower bounds are very sensitive to the number of vertices consulted. That is, we show several constructions of such labeling schemes that beat the lower bounds by large margins. Moreover, as opposed to the strong technical skills that were needed to develop the traditional labeling schemes, most of our schemes are almost trivial. The catch is that in our model, one needs to consult the labels of three vertices instead of two. That is, a query about vertices u and v can access also the label of some third vertex w ( w is determined by the labels of u and v ). More generally, we address the model in which a query about vertices u and v can access also the labels of c other vertices. We term our generalized model labeling schemes with queries . The main importance of this model is theoretical. Specifically, this paper may serve as a first step towards investigating different tradeoffs between the amount of labels consulted and the amount of information stored at each vertex. As we show, if all vertices can be consulted then the problem almost reduces to the corresponding sequential problem. On the other hand, consulting just the labels of u and v (or even just the label of u ) reduces the problem to a purely distributed one. Therefore, in a sense, our model spans a range of intermediate notions between the sequential and the distributed settings. In addition to the theoretical interest, we also show cases that schemes constructed for our model can be translated to the traditional model or to the sequential model, thus, simplifying the construction for those models as well. For implementing query labeling schemes in a distributed environment directly, we point at a potential usage for some new paradigms that became common recently, such as P2P and overlay networks." @default.
• W1970565536 created "2016-06-24" @default.
• W1970565536 creator A5033442948 @default.
• W1970565536 creator A5040995971 @default.
• W1970565536 date "2009-03-01" @default.
• W1970565536 modified "2023-09-29" @default.
• W1970565536 title "A note on models for graph representations" @default.
• W1970565536 cites W1481375110 @default.
• W1970565536 cites W1487962539 @default.
• W1970565536 cites W1491309030 @default.
• W1970565536 cites W1500591628 @default.
• W1970565536 cites W1543879246 @default.
• W1970565536 cites W1560716145 @default.
• W1970565536 cites W1587867115 @default.
• W1970565536 cites W1602024640 @default.
• W1970565536 cites W1650675509 @default.
• W1970565536 cites W1970564778 @default.
• W1970565536 cites W1980229659 @default.
• W1970565536 cites W1981535405 @default.
• W1970565536 cites W1990376056 @default.
• W1970565536 cites W2002364208 @default.
• W1970565536 cites W2005580106 @default.
• W1970565536 cites W2006162221 @default.
• W1970565536 cites W2014912500 @default.
• W1970565536 cites W2020085766 @default.
• W1970565536 cites W2020965855 @default.
• W1970565536 cites W2023425290 @default.
• W1970565536 cites W2025590344 @default.
• W1970565536 cites W2027181837 @default.
• W1970565536 cites W2030306674 @default.
• W1970565536 cites W2033112846 @default.
• W1970565536 cites W2034501275 @default.
• W1970565536 cites W2048121453 @default.
• W1970565536 cites W2054100908 @default.
• W1970565536 cites W2057994027 @default.
• W1970565536 cites W2060963839 @default.
• W1970565536 cites W2064876674 @default.
• W1970565536 cites W2068618567 @default.
• W1970565536 cites W2071294844 @default.
• W1970565536 cites W2073641778 @default.
• W1970565536 cites W2086812946 @default.
• W1970565536 cites W2093981583 @default.
• W1970565536 cites W2096304547 @default.
• W1970565536 cites W2101337120 @default.
• W1970565536 cites W2104987912 @default.
• W1970565536 cites W2110188594 @default.
• W1970565536 cites W2133323743 @default.
• W1970565536 cites W2139515174 @default.
• W1970565536 cites W2151358465 @default.
• W1970565536 cites W2151523609 @default.
• W1970565536 cites W2158049821 @default.
• W1970565536 cites W2158663853 @default.
• W1970565536 cites W2163059190 @default.
• W1970565536 cites W2293001982 @default.
• W1970565536 cites W2570021665 @default.
• W1970565536 cites W2914484629 @default.
• W1970565536 cites W2564089481 @default.
• W1970565536 cites W2761222393 @default.
• W1970565536 doi "https://doi.org/10.1016/j.tcs.2008.10.036" @default.
• W1970565536 hasPublicationYear "2009" @default.
• W1970565536 type Work @default.
• W1970565536 sameAs 1970565536 @default.
• W1970565536 citedByCount "2" @default.
• W1970565536 countsByYear W19705655362016 @default.
• W1970565536 countsByYear W19705655362018 @default.
• W1970565536 crossrefType "journal-article" @default.
• W1970565536 hasAuthorship W1970565536A5033442948 @default.
• W1970565536 hasAuthorship W1970565536A5040995971 @default.
• W1970565536 hasBestOaLocation W19705655361 @default.
• W1970565536 hasConcept C114614502 @default.
• W1970565536 hasConcept C118615104 @default.
• W1970565536 hasConcept C132525143 @default.
• W1970565536 hasConcept C134306372 @default.
• W1970565536 hasConcept C14036430 @default.
• W1970565536 hasConcept C149530733 @default.
• W1970565536 hasConcept C150433608 @default.
• W1970565536 hasConcept C166513658 @default.
• W1970565536 hasConcept C203776342 @default.
• W1970565536 hasConcept C33923547 @default.
• W1970565536 hasConcept C41008148 @default.
• W1970565536 hasConcept C77553402 @default.
• W1970565536 hasConcept C78458016 @default.
• W1970565536 hasConcept C80899671 @default.
• W1970565536 hasConcept C86803240 @default.
• W1970565536 hasConceptScore W1970565536C114614502 @default.
• W1970565536 hasConceptScore W1970565536C118615104 @default.
• W1970565536 hasConceptScore W1970565536C132525143 @default.
• W1970565536 hasConceptScore W1970565536C134306372 @default.
• W1970565536 hasConceptScore W1970565536C14036430 @default.
• W1970565536 hasConceptScore W1970565536C149530733 @default.
• W1970565536 hasConceptScore W1970565536C150433608 @default.
• W1970565536 hasConceptScore W1970565536C166513658 @default.
• W1970565536 hasConceptScore W1970565536C203776342 @default.
• W1970565536 hasConceptScore W1970565536C33923547 @default.
• W1970565536 hasConceptScore W1970565536C41008148 @default.
• W1970565536 hasConceptScore W1970565536C77553402 @default.
• W1970565536 hasConceptScore W1970565536C78458016 @default.
• W1970565536 hasConceptScore W1970565536C80899671 @default.

• next