Matches in SemOpenAlex for { <https://semopenalex.org/work/W2245158765> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W2245158765 abstract "We present four fully dynamic algorithms, i.e., algorithms that are able to answer queries about properties of a graph or a set during a sequence of modifications of the graph or set. Additionally, we give lower bounds for fully dynamic graph algorithms.The first three algorithms maintain properties of graphs during insertions and deletions of edges and vertices. Let n denote the number of vertices in a graph and m the number of edges. We give the first sublinear time algorithm for maintaining biconnectivity in graphs. A query can be answered in constant time. The amortized time of an insertion or deletion is O($msp{2/3}$). A slight variation of the algorithm gives an amortized running time of O($sqrt{n}$log n) per insertion or deletion in a plane graph. The worst-case running time per query is O(log$sp{2} n$) in a plane graph.The second data structure maintains two-edge connectivity in plane graphs in a fully dynamic environment. It achieves a worst case running time of O(log$sp{2} n$) per insertion or deletion and O(log n) per query.Finally, we give an algorithm for deciding whether adding an edge to a plane graph maintains the planarity of its embedding. If the edge can be added, the algorithm returns a face into which the edge can be embedded without destroying the planarity of the embedding. Any query and any insertion or deletion of an edge takes O(log$sp{2} n$) time. All of the algorithms use O(n) space and isolated vertices may be inserted in constant time.In addition, we give a lower bound in the cell probe model of $Omega$(logn/log log n) per operation for fully-dynamic planarity testing and for fully-dynamic k-edge connectivity and k-vertex connectivity in plane graphs for constant k.The fourth algorithm maintains predecessors in integer sets during insertions and deletions of elements. The integers are chosen from the universe ${$0,1, ...,$u-1}$. There is an upper bound of O(log log u) for this problem (29) and a lower bound of $Omega$(log log u) per query operation (even for randomized algorithms) in the cell probe model (2). If the set of numbers is uniformly distributed over the universe, we give an algorithm with worst case query time O(1) and amortized expected time O(1) for any insertion or deletion." @default.
- W2245158765 created "2016-06-24" @default.
- W2245158765 creator A5035275121 @default.
- W2245158765 date "1993-01-01" @default.
- W2245158765 modified "2023-09-27" @default.
- W2245158765 title "Fully dynamic graph algorithms and their data structures" @default.
- W2245158765 hasPublicationYear "1993" @default.
- W2245158765 type Work @default.
- W2245158765 sameAs 2245158765 @default.
- W2245158765 citedByCount "1" @default.
- W2245158765 crossrefType "journal-article" @default.
- W2245158765 hasAuthorship W2245158765A5035275121 @default.
- W2245158765 hasConcept C101837359 @default.
- W2245158765 hasConcept C11413529 @default.
- W2245158765 hasConcept C114614502 @default.
- W2245158765 hasConcept C118615104 @default.
- W2245158765 hasConcept C132525143 @default.
- W2245158765 hasConcept C142417499 @default.
- W2245158765 hasConcept C149530733 @default.
- W2245158765 hasConcept C162319229 @default.
- W2245158765 hasConcept C168291704 @default.
- W2245158765 hasConcept C199360897 @default.
- W2245158765 hasConcept C203776342 @default.
- W2245158765 hasConcept C3017489831 @default.
- W2245158765 hasConcept C311688 @default.
- W2245158765 hasConcept C33923547 @default.
- W2245158765 hasConcept C41008148 @default.
- W2245158765 hasConcept C63553672 @default.
- W2245158765 hasConcept C68260962 @default.
- W2245158765 hasConceptScore W2245158765C101837359 @default.
- W2245158765 hasConceptScore W2245158765C11413529 @default.
- W2245158765 hasConceptScore W2245158765C114614502 @default.
- W2245158765 hasConceptScore W2245158765C118615104 @default.
- W2245158765 hasConceptScore W2245158765C132525143 @default.
- W2245158765 hasConceptScore W2245158765C142417499 @default.
- W2245158765 hasConceptScore W2245158765C149530733 @default.
- W2245158765 hasConceptScore W2245158765C162319229 @default.
- W2245158765 hasConceptScore W2245158765C168291704 @default.
- W2245158765 hasConceptScore W2245158765C199360897 @default.
- W2245158765 hasConceptScore W2245158765C203776342 @default.
- W2245158765 hasConceptScore W2245158765C3017489831 @default.
- W2245158765 hasConceptScore W2245158765C311688 @default.
- W2245158765 hasConceptScore W2245158765C33923547 @default.
- W2245158765 hasConceptScore W2245158765C41008148 @default.
- W2245158765 hasConceptScore W2245158765C63553672 @default.
- W2245158765 hasConceptScore W2245158765C68260962 @default.
- W2245158765 hasLocation W22451587651 @default.
- W2245158765 hasOpenAccess W2245158765 @default.
- W2245158765 hasPrimaryLocation W22451587651 @default.
- W2245158765 hasRelatedWork W1582892716 @default.
- W2245158765 hasRelatedWork W1611628598 @default.
- W2245158765 hasRelatedWork W172120053 @default.
- W2245158765 hasRelatedWork W2028750248 @default.
- W2245158765 hasRelatedWork W2059063102 @default.
- W2245158765 hasRelatedWork W2095163132 @default.
- W2245158765 hasRelatedWork W2126169066 @default.
- W2245158765 hasRelatedWork W2171446771 @default.
- W2245158765 hasRelatedWork W2586277680 @default.
- W2245158765 hasRelatedWork W2587822263 @default.
- W2245158765 hasRelatedWork W2780462764 @default.
- W2245158765 hasRelatedWork W2798930665 @default.
- W2245158765 hasRelatedWork W2907241826 @default.
- W2245158765 hasRelatedWork W2950274300 @default.
- W2245158765 hasRelatedWork W2950666218 @default.
- W2245158765 hasRelatedWork W2980163628 @default.
- W2245158765 hasRelatedWork W2980746169 @default.
- W2245158765 hasRelatedWork W3102089556 @default.
- W2245158765 hasRelatedWork W3212382105 @default.
- W2245158765 hasRelatedWork W73463944 @default.
- W2245158765 isParatext "false" @default.
- W2245158765 isRetracted "false" @default.
- W2245158765 magId "2245158765" @default.
- W2245158765 workType "article" @default.