Sublinear-Time Parallel Algorithms for Matching and Related Problems

doi 10.21236/ada197411
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2000English

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

SIAM Journal on Computing
MathematicsComputer Science
1992English

Sublinear Time Algorithms

English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

Round Compression for Parallel Matching Algorithms

2018English

Parallel Remapping Algorithms for Adaptive Problems

English

Faster Scaling Algorithms for General Graph Matching Problems

1989English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Sublinear Algorithms for Massive Data Sets

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy