scientific article
From MaRDI portal
Publication:3484355
zbMath0704.68049MaRDI QIDQ3484355
Selim G. Akl, Constantine N. K. Osiakwan
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items
Parallelizing Mallat algorithm for 2-D wavelet transforms, The representation of permutations by trees, On generation of permutations of \(m\) out of \(n\) items, Parallel algorithms for connectivity problems on interval graphs, Solving the minimum bisection problem using a biologically inspired computational model, A new method for optimal control of Volterra integral equations, Solving the tridiagonal linear system and Poisson's equation over a LAN-based computing platform using distributed shared memory, An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem, Permutation algorithms on optical multi-trees, Multiplicative circulant networks. Topological properties and communication algorithms, An algorithm for dynamic load balancing of synchronous Monte Carlo simulations on multiprocessor systems, A unified approach to parallel depth-first traversals of general trees, Decomposing a star graph into disjoint cycles, On doing Todd-Coxeter coset enumeration in parallel, Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses, Data-movement-intensive problems: Two folk theorems in parallel computation revisited, Heaps with bits, Fast rehashing in PRAM emulations, Solving the shortest-paths problem on bipartite permutation graphs efficiently, Topological properties of the directional hypercube, An efficient selection algorithm on the pyramid, Parallel time and space upper-bounds for the subset-sum problem, Optimal parallel algorithms for finding cut vertices and bridges of interval graphs, A simple parallel algorithm for computing the diameters of all vertices in a tree and its application, Stirling networks: A versatile combinatorial topology for multiprocessor systems, A new upper bound on the complexity of the all pairs shortest path problem, On similarity of polynomial configurations, A simple systolic algorithm for generating combinations in lexicographic order, Parallel prefix computation with few processors, An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem, Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs, Embedding meshes into twisted-cubes, An optimal parallel algorithm for generating combinations, Parallel multiple search, Building heaps in parallel, Optimal circular arc representations: Properties, recognition, and construction, Simulating the CRCW PRAM on reconfigurable networks, Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms, Gray code for derangements, Embedding the incomplete hypercube in books, Developing software for parallel computing systems, Parallel prefix computation on extended multi-mesh network., Parallel processing for fuzzy sets operations, A simple optimal parallel algorithm for the minimum coloring problem on interval graphs, On the complexity of the recognition of parallel 2D-image languages, Honeycomb tori are Hamiltonian, Optimal vertex ordering of graphs
