Results 231 to 240 of about 62,130 (264)
Some of the next articles are maybe not open access.
A Dynamic Algorithm for Maintaining Graph Partitions
2000We propose an algorithm for maintaining a partition of dynamic planar graphs motivated by applications in load balancing for solving partial differential equations on a shared memory multiprocessor. We consider planar graphs of bounded face sizes that can be modified by local insertions or deletions of vertices or edges so that planarity is preserved ...
Lyudmil Aleksandrov, Hristo N. Djidjev
openaire +1 more source
Dynamic Algorithms for Graph Spanners
2006Let G=(V,E) be an undirected weighted graph on |V|=n vertices and |E|=m edges. For the graph G, A spanner with stretch t is a subgraph (V,ES), Es ⊆ E, such that the distance between any pair of vertices in this subgraph is at most t times the distance between them in the graph G.
openaire +1 more source
Dynamic Graph Shortest Path Algorithm
2012Shortest paths computation in graph is one of the most fundamental operation in many applications such as social network and sensor network. When a large graph is updated with small changes, it is really expensive to recompute the new shortest path via the traditional static algorithms.
Xueli Liu, Hongzhi Wang 0001
openaire +1 more source
Incremental Algorithms for Sampling Dynamic Graphs
2013Among the many reasons that justify the need for efficient and effective graph sampling algorithms is the ability to replace a graph too large to be processed by a tractable yet representative subgraph. For instance, some approximation algorithms start by looking for a solution on a sample subgraph and then extrapolate it. The sample graph should be of
Xuesong Lu +2 more
openaire +1 more source
Improved Dynamic Reachability Algorithms for Directed Graphs
SIAM Journal on Computing, 2003We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph, and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. Among our algorithms are: (i) a decremental algorithm for maintaining the transitive closure of a directed graph, through an ...
Liam Roditty, Uri Zwick
openaire +1 more source
An Experimental Study of Dynamic Algorithms for Directed Graphs
1998Dynamic graph algorithms maintain a certain property (e.g., connectivity) of a graph that changes dynamically over time. Typical changes include insertion of a new edge and deletion of an existing edge. The challenge for a dynamic algorithm is to maintain, in an environment of dynamic changes, the desired graph property efficiently, i.e., without ...
Daniele Frigioni +5 more
openaire +3 more sources
Dynamic graph algorithms and graph sparsification
2019Graphen sind passende Modelle in mehreren realen Kontexten, unter anderem in sozialen Netzwerken, dem Web-Netzwerk und in Telekommunikationsnetzen. Die Analyse und das Verständnis von Graphstrukturen sind ein zentraler Gesichtspunkt im Design von Algorithmen.
openaire +1 more source
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms, 2008We present the first dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting an arbitrary edge preserves chordality; and (2) delete or insert an arbitrary edge, provided it preserves chordality. We give two implementations. In the first,
openaire +1 more source
The State of the Art in Dynamic Graph Algorithms
2017A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs.
openaire +1 more source
Efficient graph embedding algorithms in dynamic graphs
2021Recently, scalable graph algorithms for embeddings have attracted much attention due to their importance in various application domains. In this thesis, we study the problem of graph embeddings using scalable algorithms, i.e., algorithms that can be used potentially in large networks.
openaire +1 more source