Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297464782> ?p ?o ?g. }
Showing items 1 to 52 of
52
with 100 items per page.
- W4297464782 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 on (recovered). We wish to answer connectivity queries with respect to the on 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.
- W4297464782 created "2022-09-29" @default.
- W4297464782 creator A5012478921 @default.
- W4297464782 creator A5060702949 @default.
- W4297464782 creator A5076564426 @default.
- W4297464782 date "2012-04-18" @default.
- W4297464782 modified "2023-09-29" @default.
- W4297464782 title "Connectivity Oracles for Planar Graphs" @default.
- W4297464782 doi "https://doi.org/10.48550/arxiv.1204.4159" @default.
- W4297464782 hasPublicationYear "2012" @default.
- W4297464782 type Work @default.
- W4297464782 citedByCount "0" @default.
- W4297464782 crossrefType "posted-content" @default.
- W4297464782 hasAuthorship W4297464782A5012478921 @default.
- W4297464782 hasAuthorship W4297464782A5060702949 @default.
- W4297464782 hasAuthorship W4297464782A5076564426 @default.
- W4297464782 hasBestOaLocation W42974647821 @default.
- W4297464782 hasConcept C101837359 @default.
- W4297464782 hasConcept C114614502 @default.
- W4297464782 hasConcept C115903868 @default.
- W4297464782 hasConcept C118615104 @default.
- W4297464782 hasConcept C132525143 @default.
- W4297464782 hasConcept C33923547 @default.
- W4297464782 hasConcept C41008148 @default.
- W4297464782 hasConcept C55166926 @default.
- W4297464782 hasConcept C80899671 @default.
- W4297464782 hasConceptScore W4297464782C101837359 @default.
- W4297464782 hasConceptScore W4297464782C114614502 @default.
- W4297464782 hasConceptScore W4297464782C115903868 @default.
- W4297464782 hasConceptScore W4297464782C118615104 @default.
- W4297464782 hasConceptScore W4297464782C132525143 @default.
- W4297464782 hasConceptScore W4297464782C33923547 @default.
- W4297464782 hasConceptScore W4297464782C41008148 @default.
- W4297464782 hasConceptScore W4297464782C55166926 @default.
- W4297464782 hasConceptScore W4297464782C80899671 @default.
- W4297464782 hasLocation W42974647821 @default.
- W4297464782 hasLocation W42974647822 @default.
- W4297464782 hasOpenAccess W4297464782 @default.
- W4297464782 hasPrimaryLocation W42974647821 @default.
- W4297464782 hasRelatedWork W2006947206 @default.
- W4297464782 hasRelatedWork W2019255250 @default.
- W4297464782 hasRelatedWork W2374778222 @default.
- W4297464782 hasRelatedWork W2400746548 @default.
- W4297464782 hasRelatedWork W2983736839 @default.
- W4297464782 hasRelatedWork W3015759841 @default.
- W4297464782 hasRelatedWork W4206560000 @default.
- W4297464782 hasRelatedWork W4226175138 @default.
- W4297464782 hasRelatedWork W4287756435 @default.
- W4297464782 hasRelatedWork W4295995756 @default.
- W4297464782 isParatext "false" @default.
- W4297464782 isRetracted "false" @default.
- W4297464782 workType "article" @default.