scientific article; zbMATH DE number 4155887
From MaRDI portal
Publication:3484355
Recommendations
- Parallel computation of matchings in trees
- An optimal parallel algorithm for maximal matching
- Efficient algorithms for finding maximum matching in graphs
- Efficient approximation algorithms for weighted b-matching
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
Cited in
(50)- Embedding the incomplete hypercube in books
- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
- A unified approach to parallel depth-first traversals of general trees
- Parallel computation of matchings in 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
- Optimal parallel algorithms for forest and term matching
- 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
- 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
- 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
- Developing software for parallel computing systems
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- The representation of permutations by trees
- Parallel algorithms for connectivity problems on interval graphs
- Solving the tridiagonal linear system and Poisson's equation over a LAN-based computing platform using distributed shared memory
- Multiplicative circulant networks. Topological properties and communication algorithms
- An algorithm for dynamic load balancing of synchronous Monte Carlo simulations on multiprocessor systems
- Honeycomb tori are Hamiltonian
- Optimal vertex ordering of graphs
- Gray code for derangements
- Parallel prefix computation on extended multi-mesh network.
- Parallel processing for fuzzy sets operations
- Parallelizing Mallat algorithm for 2-D wavelet transforms
- A new method for optimal control of Volterra integral equations
- Permutation algorithms on optical multi-trees
- On generation of permutations of \(m\) out of \(n\) items
- Embedding meshes into twisted-cubes
- An optimal parallel algorithm for generating combinations
- 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
- On similarity of polynomial configurations
- Parallel multiple search
- Building heaps in parallel
- On the complexity of the recognition of parallel 2D-image languages
- Solving the minimum bisection problem using a biologically inspired computational model
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
- Parallel time and space upper-bounds for the subset-sum problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484355)
