Matches in SemOpenAlex for { <https://semopenalex.org/work/W2949836476> ?p ?o ?g. }
Showing items 1 to 88 of
88
with 100 items per page.
- W2949836476 abstract "We consider dynamic subgraph connectivity problems for planar graphs. In this model there is a fixed underlying planar graph, where each edge and vertex is either off (failed) or (recovered). We wish to answer connectivity queries with respect to the subgraph. The model has two natural variants, one in which there are $d$ edge/vertex failures that precede all connectivity queries, and one in which failures/recoveries and queries are intermixed. We present a $d$-failure connectivity oracle for planar graphs that processes any $d$ edge/vertex failures in $sort(d,n)$ time so that connectivity queries can be answered in $pred(d,n)$ time. (Here $sort$ and $pred$ are the time for integer sorting and integer predecessor search over a subset of $[n]$ of size $d$.) Our algorithm has two discrete parts. The first is an algorithm tailored to triconnected planar graphs. It makes use of Barnette's theorem, which states that every triconnected planar graph contains a degree-3 spanning tree. The second part is a generic reduction from general (planar) graphs to triconnected (planar) graphs. Our algorithm is, moreover, provably optimal. An implication of Patrascu and Thorup's lower bound on predecessor search is that no $d$-failure connectivity oracle (even on trees) can beat $pred(d,n)$ query time. We extend our algorithms to the subgraph connectivity model where edge/vertex failures (but no recoveries) are intermixed with connectivity queries. In triconnected planar graphs each failure and query is handled in $O(log n)$ time (amortized), whereas in general planar graphs both bounds become $O(log^2 n)$." @default.
- W2949836476 created "2019-06-27" @default.
- W2949836476 creator A5012478921 @default.
- W2949836476 creator A5076564426 @default.
- W2949836476 creator A5077977985 @default.
- W2949836476 date "2012-04-18" @default.
- W2949836476 modified "2023-09-27" @default.
- W2949836476 title "Connectivity Oracles for Planar Graphs" @default.
- W2949836476 cites W123718951 @default.
- W2949836476 cites W1534309112 @default.
- W2949836476 cites W1577501260 @default.
- W2949836476 cites W1584344688 @default.
- W2949836476 cites W1909754222 @default.
- W2949836476 cites W1984816083 @default.
- W2949836476 cites W1989169588 @default.
- W2949836476 cites W1994556169 @default.
- W2949836476 cites W2040746822 @default.
- W2949836476 cites W2045430818 @default.
- W2949836476 cites W2049774319 @default.
- W2949836476 cites W2082803170 @default.
- W2949836476 cites W2086812946 @default.
- W2949836476 cites W2090021115 @default.
- W2949836476 cites W2094632707 @default.
- W2949836476 cites W2116060765 @default.
- W2949836476 cites W2117909275 @default.
- W2949836476 cites W2120724233 @default.
- W2949836476 cites W2121473031 @default.
- W2949836476 cites W2137120608 @default.
- W2949836476 cites W2141257824 @default.
- W2949836476 cites W2149710566 @default.
- W2949836476 cites W2157901347 @default.
- W2949836476 cites W2164485560 @default.
- W2949836476 cites W2328509826 @default.
- W2949836476 cites W2611219145 @default.
- W2949836476 hasPublicationYear "2012" @default.
- W2949836476 type Work @default.
- W2949836476 sameAs 2949836476 @default.
- W2949836476 citedByCount "1" @default.
- W2949836476 countsByYear W29498364762017 @default.
- W2949836476 crossrefType "posted-content" @default.
- W2949836476 hasAuthorship W2949836476A5012478921 @default.
- W2949836476 hasAuthorship W2949836476A5076564426 @default.
- W2949836476 hasAuthorship W2949836476A5077977985 @default.
- W2949836476 hasConcept C101837359 @default.
- W2949836476 hasConcept C114614502 @default.
- W2949836476 hasConcept C115903868 @default.
- W2949836476 hasConcept C118615104 @default.
- W2949836476 hasConcept C132525143 @default.
- W2949836476 hasConcept C33923547 @default.
- W2949836476 hasConcept C41008148 @default.
- W2949836476 hasConcept C55166926 @default.
- W2949836476 hasConcept C80899671 @default.
- W2949836476 hasConceptScore W2949836476C101837359 @default.
- W2949836476 hasConceptScore W2949836476C114614502 @default.
- W2949836476 hasConceptScore W2949836476C115903868 @default.
- W2949836476 hasConceptScore W2949836476C118615104 @default.
- W2949836476 hasConceptScore W2949836476C132525143 @default.
- W2949836476 hasConceptScore W2949836476C33923547 @default.
- W2949836476 hasConceptScore W2949836476C41008148 @default.
- W2949836476 hasConceptScore W2949836476C55166926 @default.
- W2949836476 hasConceptScore W2949836476C80899671 @default.
- W2949836476 hasLocation W29498364761 @default.
- W2949836476 hasOpenAccess W2949836476 @default.
- W2949836476 hasPrimaryLocation W29498364761 @default.
- W2949836476 hasRelatedWork W1552226600 @default.
- W2949836476 hasRelatedWork W1747997560 @default.
- W2949836476 hasRelatedWork W1798009099 @default.
- W2949836476 hasRelatedWork W1988120018 @default.
- W2949836476 hasRelatedWork W2011182146 @default.
- W2949836476 hasRelatedWork W2019301863 @default.
- W2949836476 hasRelatedWork W2075541196 @default.
- W2949836476 hasRelatedWork W2077772110 @default.
- W2949836476 hasRelatedWork W2097530134 @default.
- W2949836476 hasRelatedWork W2139666321 @default.
- W2949836476 hasRelatedWork W2618849866 @default.
- W2949836476 hasRelatedWork W2683784293 @default.
- W2949836476 hasRelatedWork W2751975630 @default.
- W2949836476 hasRelatedWork W2963654823 @default.
- W2949836476 hasRelatedWork W2963694357 @default.
- W2949836476 hasRelatedWork W2963888752 @default.
- W2949836476 hasRelatedWork W3039967246 @default.
- W2949836476 hasRelatedWork W3102007657 @default.
- W2949836476 hasRelatedWork W3115364712 @default.
- W2949836476 hasRelatedWork W3197923921 @default.
- W2949836476 isParatext "false" @default.
- W2949836476 isRetracted "false" @default.
- W2949836476 magId "2949836476" @default.
- W2949836476 workType "article" @default.