2020
DOI: 10.4230/lipics.fsttcs.2020.26
|View full text |Cite
|
Sign up to set email alerts
|

Constructing Large Matchings via Query Access to a Maximal Matching Oracle

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Various algorithms are known for computing a (1 − )-approximation to Maximum Matching by repeatedly computing maximal matchings in subgraphs of the input graph (e.g. [2,8,15,22,25,29]). In order to implement these algorithms in the BB(k) model, we need to make sure that the parties know which of their edges are contained in each of the respective subgraphs.…”
Section: Upper Boundsmentioning
confidence: 99%
“…Various algorithms are known for computing a (1 − )-approximation to Maximum Matching by repeatedly computing maximal matchings in subgraphs of the input graph (e.g. [2,8,15,22,25,29]). In order to implement these algorithms in the BB(k) model, we need to make sure that the parties know which of their edges are contained in each of the respective subgraphs.…”
Section: Upper Boundsmentioning
confidence: 99%