Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

Journal of Algorithms
doi 10.1006/jagm.1993.1008
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Efficient Parallel Circuits and Algorithms for Division

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1988English

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

SIAM Journal on Computing
MathematicsComputer Science
1992English

Adaptive Quadrature: Convergence of Parallel and Sequential Algorithms

Bulletin of the American Mathematical Society
1974English

Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics

2011English

Efficient Algorithms for Scheduling and Mapping of Parallel Programs Onto Parallel Architectures

English

Using Maximal Independent Sets to Solve Problems in Parallel

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1995English

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

SIAM Journal on Computing
MathematicsComputer Science
1984English

Efficient Parallel LAN/WAN Algorithms for Optimization. The Mallba Project

Parallel Computing
Computer GraphicsComputer NetworksHardwareCommunicationsComputer-Aided DesignArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2006English

Minimal Closed Sets and Maximal Closed Sets

International Journal of Mathematics and Mathematical Sciences
Mathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy