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

Algorithmica - United States
doi 10.1007/s004539910013
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

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

SIAM Journal on Computing
MathematicsComputer Science
1992English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

Matching Dominating Sets of Interval Graphs

International Journal of Computer Applications
2014English

Round Compression for Parallel Matching Algorithms

2018English

Parallel Remapping Algorithms for Adaptive Problems

English

NC Algorithms for Computing the Number of Perfect Matchings in K 3,3-Free Graphs and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1988English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy