FRINK Linked Data Fragments server

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

• W2963654823 endingPage "561" @default.
• W2963654823 startingPage "546" @default.
• W2963654823 abstract "Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity our knowledge in the case of vertex connectivity is much more limited. An essential tool in capturing edge connectivity are the classical results of Tutte and Nash-Williams from 1961 which show that a λ-edge-connected graph contains ⌈(λ -- 1)/2⌉ edge-disjoint spanning trees.We argue that connected dominating set partitions and packings are the natural analogues of edge-disjoint spanning trees in the context of vertex connectivity and we use them to obtain structural results about vertex connectivity in the spirit of those for edge connectivity.More specifically connected dominating set (CDS) partitions and packings are counterparts of edge-disjoint spanning trees, focusing on vertex-disjointness rather than edge-disjointness, and their sizes are always upper bounded by the vertex connectivity k. We constructively show that every k-vertex-connected graph with n nodes has CDS packings and partitions with sizes, respectively, Ω(k/log n) and Ω(k/log5n), and we prove that the former bound is existentially optimal.Beautiful results by Karger show that when edges of a λ-edge-connected graph are independently sampled with probability p, the sampled graph has edge connectivity Ω(λp). Obtaining such a result for vertex sampling remained open. We illustrate the strength of our approach by proving that when vertices of a k-vertex-connected graph are independently sampled with probability p, the graph induced by the sampled vertices has vertex connectivity Ω(kp2). This bound is optimal up to poly-log factors and is proven by building an Ω(kp2) size CDS packing on the sampled vertices while sampling happens.As an additional important application, we show CDS packings to be tightly related to the throughput of routing-based algorithms and use our new toolbox to yield a routing-based broadcast algorithm with optimal throughput Ω(k/log n + 1), improving the (previously best-known) trivial throughput of Θ(1)." @default.
• W2963654823 created "2019-07-30" @default.
• W2963654823 creator A5023808567 @default.
• W2963654823 creator A5061279024 @default.
• W2963654823 creator A5088284921 @default.
• W2963654823 date "2014-01-05" @default.
• W2963654823 modified "2023-09-26" @default.
• W2963654823 title "A new perspective on vertex connectivity" @default.
• W2963654823 cites W1495272862 @default.
• W2963654823 cites W1515157528 @default.
• W2963654823 cites W1540132677 @default.
• W2963654823 cites W1552743905 @default.
• W2963654823 cites W1557449356 @default.
• W2963654823 cites W1714549793 @default.
• W2963654823 cites W1963619425 @default.
• W2963654823 cites W1971680255 @default.
• W2963654823 cites W1978601678 @default.
• W2963654823 cites W1981519953 @default.
• W2963654823 cites W1994931826 @default.
• W2963654823 cites W1996169001 @default.
• W2963654823 cites W2022887970 @default.
• W2963654823 cites W2032813508 @default.
• W2963654823 cites W2042706982 @default.
• W2963654823 cites W2049716158 @default.
• W2963654823 cites W2051540665 @default.
• W2963654823 cites W2058858486 @default.
• W2963654823 cites W2068871408 @default.
• W2963654823 cites W2068888615 @default.
• W2963654823 cites W2076086747 @default.
• W2963654823 cites W2094856687 @default.
• W2963654823 cites W2098502330 @default.
• W2963654823 cites W2105781905 @default.
• W2963654823 cites W2105831729 @default.
• W2963654823 cites W2114651839 @default.
• W2963654823 cites W2120741723 @default.
• W2963654823 cites W2137996019 @default.
• W2963654823 cites W2149863032 @default.
• W2963654823 cites W2150959011 @default.
• W2963654823 cites W2160348245 @default.
• W2963654823 cites W2165883859 @default.
• W2963654823 cites W2167614100 @default.
• W2963654823 cites W2169848785 @default.
• W2963654823 cites W2292265300 @default.
• W2963654823 cites W2544805158 @default.
• W2963654823 cites W2756497387 @default.
• W2963654823 cites W3141863997 @default.
• W2963654823 cites W70941519 @default.
• W2963654823 doi "https://doi.org/10.5555/2634074.2634115" @default.
• W2963654823 hasPublicationYear "2014" @default.
• W2963654823 type Work @default.
• W2963654823 sameAs 2963654823 @default.
• W2963654823 citedByCount "16" @default.
• W2963654823 countsByYear W29636548232013 @default.
• W2963654823 countsByYear W29636548232014 @default.
• W2963654823 countsByYear W29636548232015 @default.
• W2963654823 countsByYear W29636548232016 @default.
• W2963654823 countsByYear W29636548232017 @default.
• W2963654823 countsByYear W29636548232020 @default.
• W2963654823 countsByYear W29636548232023 @default.
• W2963654823 crossrefType "proceedings-article" @default.
• W2963654823 hasAuthorship W2963654823A5023808567 @default.
• W2963654823 hasAuthorship W2963654823A5061279024 @default.
• W2963654823 hasAuthorship W2963654823A5088284921 @default.
• W2963654823 hasConcept C114614502 @default.
• W2963654823 hasConcept C118615104 @default.
• W2963654823 hasConcept C132525143 @default.
• W2963654823 hasConcept C134306372 @default.
• W2963654823 hasConcept C161677786 @default.
• W2963654823 hasConcept C33923547 @default.
• W2963654823 hasConcept C34388435 @default.
• W2963654823 hasConcept C45340560 @default.
• W2963654823 hasConcept C76444178 @default.
• W2963654823 hasConcept C80899671 @default.
• W2963654823 hasConceptScore W2963654823C114614502 @default.
• W2963654823 hasConceptScore W2963654823C118615104 @default.
• W2963654823 hasConceptScore W2963654823C132525143 @default.
• W2963654823 hasConceptScore W2963654823C134306372 @default.
• W2963654823 hasConceptScore W2963654823C161677786 @default.
• W2963654823 hasConceptScore W2963654823C33923547 @default.
• W2963654823 hasConceptScore W2963654823C34388435 @default.
• W2963654823 hasConceptScore W2963654823C45340560 @default.
• W2963654823 hasConceptScore W2963654823C76444178 @default.
• W2963654823 hasConceptScore W2963654823C80899671 @default.
• W2963654823 hasLocation W29636548231 @default.
• W2963654823 hasOpenAccess W2963654823 @default.
• W2963654823 hasPrimaryLocation W29636548231 @default.
• W2963654823 hasRelatedWork W107459669 @default.
• W2963654823 hasRelatedWork W1577694003 @default.
• W2963654823 hasRelatedWork W169301678 @default.
• W2963654823 hasRelatedWork W1974912205 @default.
• W2963654823 hasRelatedWork W2042706982 @default.
• W2963654823 hasRelatedWork W2058858486 @default.
• W2963654823 hasRelatedWork W2085571958 @default.
• W2963654823 hasRelatedWork W2094856687 @default.
• W2963654823 hasRelatedWork W2119377188 @default.
• W2963654823 hasRelatedWork W2148178939 @default.
• W2963654823 hasRelatedWork W2151153553 @default.
• W2963654823 hasRelatedWork W2488129067 @default.

• next