Results 171 to 180 of about 2,283,531 (215)
Some of the next articles are maybe not open access.
Incrementalizing Graph Algorithms
Proceedings of the 2021 International Conference on Management of Data, 2021Incremental algorithms are important to dynamic graph analyses, but are hard to write and analyze. Few incremental graph algorithms are in place, and even fewer offer performance guarantees. This paper approaches this by proposing to incrementalize existing batch algorithms.
Wenfei Fan +5 more
openaire +1 more source
Graph-Based Algorithms for Boolean Function Manipulation
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and ...
Randal E. Bryant (5409038)
exaly +2 more sources
ACM Computing Surveys, 1984
This is an extensive survey of parallel algorithms used to solve graph problems. In the first part some models of parallel computation are shortly described and discussed. They include: systolic arrays, associative processors, various models of array processors (also known as SIMD machines) and multiple CPU computers.
Michael J. Quinn, Narsingh Deo
openaire +3 more sources
This is an extensive survey of parallel algorithms used to solve graph problems. In the first part some models of parallel computation are shortly described and discussed. They include: systolic arrays, associative processors, various models of array processors (also known as SIMD machines) and multiple CPU computers.
Michael J. Quinn, Narsingh Deo
openaire +3 more sources
2008
The aim of this paper is to survey the results on dynamic algebraic algorithms, with main interest in matrix functions such as, determinant, inverse, rank and characteristic polynomial. First of all we summary the papers that in dynamic setup these problems can be solved faster than evaluating everything from scratch.
openaire +1 more source
The aim of this paper is to survey the results on dynamic algebraic algorithms, with main interest in matrix functions such as, determinant, inverse, rank and characteristic polynomial. First of all we summary the papers that in dynamic setup these problems can be solved faster than evaluating everything from scratch.
openaire +1 more source
An algorithmic study of switch graphs
Acta Informatica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bastian Katz +2 more
openaire +5 more sources
An algorithm for a special graph
Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35, 1997Most of practical problems which call for graph theory involve large graphs - graphs that are virtually impossible for hand computation. In fact, one of the reasons for the recent growth of interest in graph theory has been the arrival of the high-speed electronic computer.
openaire +2 more sources
Towards Graph Programs for Graph Algorithms
2004Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this language such that numerical computations on labels can be conveniently expressed. Rather than resorting to some kind of attributed graph transformation, we introduce conditional rule
Detlef Plump, Sandra Steinert
openaire +2 more sources
2000
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive. Thus, it is desirable to reuse such implementations whenever possible. The implementations ofgraph algorithms normally cannot be reused mainly because the representations ofgraphs differ in many ways and the implementations normally assume one specific ...
openaire +1 more source
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive. Thus, it is desirable to reuse such implementations whenever possible. The implementations ofgraph algorithms normally cannot be reused mainly because the representations ofgraphs differ in many ways and the implementations normally assume one specific ...
openaire +1 more source
On an Algorithm for Ordering of Graphs
Canadian Mathematical Bulletin, 1971Let (G, ρ) be a finite connected (undirected) graph without loops and multiple edges. So x, y being two elements of G (vertices of the graph (G, ρ)), 〈x, y〉 ∊ ρ means that x and y are connected by an edge. Two vertices x, y ∊ G have the distance μ(x, y) equal to n, if n is the smallest number with the following property: there exists a sequence x0, x1,
openaire +2 more sources
Genetic algorithm and graph partitioning
IEEE Transactions on Computers, 1996Summary: Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The algorithms include a fast local improvement heuristic. One of the novel features of these algorithms is the schema preprocessing phase that improves GAs' space searching capability, which in turn improves the performance of GAs.
Thang Nguyen Bui, Byung Ro Moon
openaire +3 more sources

