Results 221 to 230 of about 62,130 (264)
Some of the next articles are maybe not open access.
Algebraic and Dynamic Graph Algorithms
Texts in Computer Science, 2018Algebraic graph theory is the study of algebraic methods to solve graph problems. We review algebraic solutions to the main graph problems in the first part of this chapter. Many real-life networks are represented by dynamic graphs in which new vertices/edges may be inserted and some vertices/edges may be deleted as time progresses.
Erciyes K
exaly +2 more sources
Visual Analysis of Graph Algorithm Dynamics
Proceedings of the 14th International Symposium on Visual Information Communication and Interaction, 2021In this paper we describe a visualization tool for representing the dynamics of graph algorithms. Toward this end, we designed a webbased framework which illustrates the dynamics as time-to-space mappings of dynamic graphs. Such static diagrams of dynamic data have the benefit of being able to display longer time spans in one view, hence supporting the
Michael Burch +4 more
openaire +2 more sources
An empirical study of dynamic graph algorithms
ACM Journal of Experimental Algorithmics, 1997The contributions of this paper are both of theoretical and of experimental nature. From the experimental point of view, we conduct an empirical study on some dynamic connectivity algorithms which where developed recently. In particular, the following implementations were tested and compared with simple algorithms: simple sparsification by Eppstein et ...
Alberts D, Cattaneo G, Italiano G
openaire +4 more sources
Dynamic Graph Algorithms with Applications
2000First we review amortized fully-dynamic polylogarithmic algorithms for connectivity, minimum spanning trees (MST), 2-edge- and biconnectivity. Second we discuss how they yield improved static algorithms: connectivity for constructing a tree from homeomorphic subtrees, 2-edge connectivity for finding unique matchings in graphs, and MST for packing ...
Mikkel Thorup, David R. Karger
openaire +1 more source
2020
Dynamic graph algorithms compute the graph properties from the previous set of values. Typical operations in dynamic graph algorithms are insertion and deletion of edges and vertices, and the query for property values relevant to the algorithm. The efficiency of a dynamic algorithm depends on the data structure used to implement it.
Unnikrishnan Cheramangalath +2 more
openaire +1 more source
Dynamic graph algorithms compute the graph properties from the previous set of values. Typical operations in dynamic graph algorithms are insertion and deletion of edges and vertices, and the query for property values relevant to the algorithm. The efficiency of a dynamic algorithm depends on the data structure used to implement it.
Unnikrishnan Cheramangalath +2 more
openaire +1 more source
Dynamic K-Graphs: an Algorithm for Dynamic Graph Learning and Temporal Graph Signal Clustering
2020 28th European Signal Processing Conference (EUSIPCO), 2021Graph signal processing (GSP) have found many applications in different domains. The underlying graph may not be available in all applications, and it should be learned from the data. There exist complicated data, where the graph changes over time. Hence, it is necessary to estimate the dynamic graph.
Hesam Araghi +2 more
openaire +1 more source
2019
We show that dynamic graph algorithms are amenable to parallelism on graphics processing units (GPUs). Evolving graphs such as social networks undergo structural updates, and analyzing such graphs with the existing static graph algorithms is inefficient.
Gaurav Malhotra +2 more
openaire +1 more source
We show that dynamic graph algorithms are amenable to parallelism on graphics processing units (GPUs). Evolving graphs such as social networks undergo structural updates, and analyzing such graphs with the existing static graph algorithms is inefficient.
Gaurav Malhotra +2 more
openaire +1 more source
Dynamic algorithms for graphs of bounded treewidth
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
A dynamic algorithm for line graph recognition
1995For a graph G=(V, E) its line graph L(G) has the node set E and two nodes of L(G) are adjacent if the corresponding edges of G have a common endpoint. The problem of finding G for a given L was already optimally solved by Lehot[7] and Roussopoulos[11].
Daniele Giorgio Degiorgi, Klaus Simon
openaire +1 more source
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
Algorithmica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source