Matches in SemOpenAlex for { <https://semopenalex.org/work/W2023702603> ?p ?o ?g. }
- W2023702603 endingPage "1981" @default.
- W2023702603 startingPage "1970" @default.
- W2023702603 abstract "Augmented graphs were introduced for the purpose of analyzing the “six degrees of separation between individuals” observed experimentally by the sociologist Standley Milgram in the 60’s. We define an augmented graph as a pair (G,M) where G is an n-node graph with nodes labeled in {1,…,n}, and M is an n×n stochastic matrix. Every node u∈V(G) is given an extra link, called a long range link, pointing to some node v, called the long range contact of u. The head v of this link is chosen at random by Pr{u→v}=Mu,v. In augmented graphs, greedy routing is the oblivious routing process in which every intermediate node chooses from among all its neighbors (including its long range contact) the one that is closest to the target according to the distance measured in the underlying graph G, and forwards to it. The best augmentation scheme known so far ensures that, for any n-node graph G, greedy routing performs in O(n) expected number of steps. Our main result is the design of an augmentation scheme that overcomes the O(n) barrier. Precisely, we prove that for any n-node graph G whose nodes are arbitrarily labeled in {1,…,n}, there exists a stochastic matrix M such that greedy routing in (G,M) performs in Õ(n1/3), where the Õ notation ignores the polylogarithmic factors. We prove additional results when the stochastic matrix M is universal to all graphs. In particular, we prove that the O(n) barrier can still be overcame for large graph classes even if the matrix M is universal. This however requires an appropriate labeling of the nodes. If the node labeling is arbitrary, then we prove that the O(n) barrier cannot be overcome with universal matrices." @default.
- W2023702603 created "2016-06-24" @default.
- W2023702603 creator A5013587418 @default.
- W2023702603 creator A5016606156 @default.
- W2023702603 creator A5054435097 @default.
- W2023702603 creator A5071967017 @default.
- W2023702603 creator A5075900164 @default.
- W2023702603 date "2009-05-01" @default.
- W2023702603 modified "2023-10-14" @default.
- W2023702603 title "Universal augmentation schemes for network navigability" @default.
- W2023702603 cites W10105891 @default.
- W2023702603 cites W1486176979 @default.
- W2023702603 cites W1572272766 @default.
- W2023702603 cites W1573579329 @default.
- W2023702603 cites W1579049696 @default.
- W2023702603 cites W1599740739 @default.
- W2023702603 cites W1806052854 @default.
- W2023702603 cites W1964442613 @default.
- W2023702603 cites W1992467531 @default.
- W2023702603 cites W2002722727 @default.
- W2023702603 cites W2005719338 @default.
- W2023702603 cites W2026985208 @default.
- W2023702603 cites W2033405938 @default.
- W2023702603 cites W2053634345 @default.
- W2023702603 cites W2056455770 @default.
- W2023702603 cites W2083649025 @default.
- W2023702603 cites W2087083200 @default.
- W2023702603 cites W2096889089 @default.
- W2023702603 cites W2108736261 @default.
- W2023702603 cites W2112090702 @default.
- W2023702603 cites W2120178327 @default.
- W2023702603 cites W2126464568 @default.
- W2023702603 cites W2126987206 @default.
- W2023702603 cites W2128678576 @default.
- W2023702603 cites W2137994750 @default.
- W2023702603 cites W2141830959 @default.
- W2023702603 cites W2150004999 @default.
- W2023702603 cites W2150410057 @default.
- W2023702603 cites W2154833764 @default.
- W2023702603 cites W2158663853 @default.
- W2023702603 cites W2160405192 @default.
- W2023702603 cites W2164195254 @default.
- W2023702603 cites W2243945130 @default.
- W2023702603 cites W2589378794 @default.
- W2023702603 cites W45185860 @default.
- W2023702603 doi "https://doi.org/10.1016/j.tcs.2008.12.061" @default.
- W2023702603 hasPublicationYear "2009" @default.
- W2023702603 type Work @default.
- W2023702603 sameAs 2023702603 @default.
- W2023702603 citedByCount "3" @default.
- W2023702603 countsByYear W20237026032015 @default.
- W2023702603 countsByYear W20237026032020 @default.
- W2023702603 countsByYear W20237026032021 @default.
- W2023702603 crossrefType "journal-article" @default.
- W2023702603 hasAuthorship W2023702603A5013587418 @default.
- W2023702603 hasAuthorship W2023702603A5016606156 @default.
- W2023702603 hasAuthorship W2023702603A5054435097 @default.
- W2023702603 hasAuthorship W2023702603A5071967017 @default.
- W2023702603 hasAuthorship W2023702603A5075900164 @default.
- W2023702603 hasBestOaLocation W20237026034 @default.
- W2023702603 hasConcept C114614502 @default.
- W2023702603 hasConcept C118615104 @default.
- W2023702603 hasConcept C127413603 @default.
- W2023702603 hasConcept C132525143 @default.
- W2023702603 hasConcept C205649164 @default.
- W2023702603 hasConcept C2778972660 @default.
- W2023702603 hasConcept C31258907 @default.
- W2023702603 hasConcept C33923547 @default.
- W2023702603 hasConcept C41008148 @default.
- W2023702603 hasConcept C58640448 @default.
- W2023702603 hasConcept C62611344 @default.
- W2023702603 hasConcept C66938386 @default.
- W2023702603 hasConcept C74172769 @default.
- W2023702603 hasConceptScore W2023702603C114614502 @default.
- W2023702603 hasConceptScore W2023702603C118615104 @default.
- W2023702603 hasConceptScore W2023702603C127413603 @default.
- W2023702603 hasConceptScore W2023702603C132525143 @default.
- W2023702603 hasConceptScore W2023702603C205649164 @default.
- W2023702603 hasConceptScore W2023702603C2778972660 @default.
- W2023702603 hasConceptScore W2023702603C31258907 @default.
- W2023702603 hasConceptScore W2023702603C33923547 @default.
- W2023702603 hasConceptScore W2023702603C41008148 @default.
- W2023702603 hasConceptScore W2023702603C58640448 @default.
- W2023702603 hasConceptScore W2023702603C62611344 @default.
- W2023702603 hasConceptScore W2023702603C66938386 @default.
- W2023702603 hasConceptScore W2023702603C74172769 @default.
- W2023702603 hasIssue "21-23" @default.
- W2023702603 hasLocation W20237026031 @default.
- W2023702603 hasLocation W20237026032 @default.
- W2023702603 hasLocation W20237026033 @default.
- W2023702603 hasLocation W20237026034 @default.
- W2023702603 hasOpenAccess W2023702603 @default.
- W2023702603 hasPrimaryLocation W20237026031 @default.
- W2023702603 hasRelatedWork W2026584759 @default.
- W2023702603 hasRelatedWork W2161466705 @default.
- W2023702603 hasRelatedWork W2162736658 @default.
- W2023702603 hasRelatedWork W2187647911 @default.
- W2023702603 hasRelatedWork W2532352661 @default.