Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science - Singapore
doi 10.1142/s0129054199000058
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

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

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2000English

Matching Dominating Sets of Interval Graphs

International Journal of Computer Applications
2014English

Round Compression for Parallel Matching Algorithms

2018English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Improved Distributed Algorithms for Coloring Interval Graphs With Application to Multicoloring Trees

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy