Graph Algorithms
The power of vertex sparsifiers in dynamic graph algorithms
... dynamic graph is a graph that undergoes constant changes over ...the graph. The goal of a dynamic graph algorithm is to maintain some property of a graph and support an intermixed ...
15
A Comparative Study on Various Graph Algorithms
... of graph-based algorithm. Set of vertices and edges of a graph data structure is ...a graph in which the edges are unordered pairs of vertices and the other one ...directed graph in which each ...
6
Weighted graph algorithms with Python
... of graph algorithms without dependency on third-party ...the algorithms should be consistent with the underlying ...presented algorithms are well known and that is why we used references to ...
13
New Approach for Graph Algorithms on GPU using CUDA
... on graph algorithms get wide ...in graph theory which computes the weight of the shortest path from a source vertex to all other vertices in a weighted directed ...in graph database but in our ...
5
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms
... the Graph- Step model, which allows the compiler and runtime to make specialized scheduling and implementation decisions to produce an efficient parallel ...For algorithms in GraphStep, memory bandwidth is ...
158
On the implementation and refinement of outerplanar graph algorithms.
... Lempel, Even and Cederbaum [36] used a different approach for planarity testing. Instead of starting with a cycle and adding one path at a time, they start with a single vertex and add one vertex at a time. Each time ...
87
A Multifaceted Approach to Improving the Practicality of Structural Graph Algorithms
... structural graph theory and parameterized algorithms research communities have developed an extensive toolkit for identifying and utilizing structural sparsity, few of those tools have seen widespread use ...
146
Compression methods for graph algorithms
... Running Time For Original and Modified Algorithms Versus Number of Maximal Independent Sets.. Time per Maximal Independent Set Versus Ratio of Procedure Calls For The Original Algorithm.[r] ...
229
Probabilistic Graph Programs for Randomised and Evolutionary Algorithms
... which algorithms from the areas of randomised graph algorithms and random graph generation can be described in P-GP ...randomised algorithms for checking graph connectedness ...
16
Distributed Algorithms Made Secure: A Graph Theoretic Approach
... distributed graph algorithms (regardless of the model specification) is that the input of the algorithm is given in a distributed format, and consequently the goal of each vertex is to compute its own part ...
29
An Effective Comparison of Graph Clustering Algorithms via Random Graphs
... clustering. Graph clustering [1] and [5] is grouping of vertices a graph so that the vertices in one cluster have high intra connectivity as compared to inter-connectivity between different ...clusters. ...
6
Two graph based algorithms for state of the art WSD
... two graph algorithms for unsupervised induction and tagging of nominal word senses based on ...those algorithms and its evaluation against pub- licly available gold ...
9
Tuned Genetic Algorithms for Finding p-Medians of a Weighted Graph
... A graph G, denoted by G = (N; E), consists of a non- empty set, N, of elements called nodes (vertices) and a set, E, of elements called edges (arcs), together with a relation of incidence, which associates each ...
13
On Graph Perturbation Theory and Algorithms for Scalable Mining of Noisy and Uncertain Graph Data with Knowledge Priors.
... a graph is computationally ...a graph of n vertices may have as many as 3 n/3 maximal cliques [50], providing a strict lower bound on the worst-case complexity of any enumeration ...a graph may ...
91
Web-graph pre-compression for similarity based algorithms
... Table 2, increasing the group size somewhat improves the compression ratio. The improvement depends on the size of the original web-graph. Bigger and denser web-graphs achieve higher compression ratios. We tested ...
7
1. A study on graph mining algorithms to discover frequent subgraph patterns from exact graph data and uncertain graph database
... mining algorithms are required for mining the frequent subgraph patterns from uncertain Graph ...certain Graph data ,mining the frequent subgraph patterns from Uncertain Graph data is a ...
5
Improving the output of algorithms for large-scale approximate graph matching
... matching algorithms is the set of seeded ...entire graph. Many seedless algorithms can be adapted to perform seeded matching, for example, by encoding the constraints into the convex program used by ...
37
Breaking the symmetry of the graph colouring problem with genetic algorithms
... a result of a crossover, when the other parent solution cannot contribute differently. In fact, since the CLIQUEGA breaks the symmetry of the graph colouring problem, there exist less possibilities for mixing ...
6
Graph Characteristics and Branch-and-Reduce Algorithms for Minimum Vertex Cover.
... Many reduction rules have been proposed to improve the theoretical effectiveness of branch-and- reduce (BR) algorithms for Minimum Vertex Cover . Akiba and Iwata’s [AI16] vcsolver im- plements several of these, ...
87
Learning General Connotation of Words using Graph based Algorithms
... Our graph construction to capture word- to-word relation is analogous to that of Collins- Thompson and Callan (2007), where the graph rep- resentation was used to model more general defini- tions of ...
12