A note on parallel complexity of maximum \(f\)-matching (Q293199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590672 / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel algorithms
Property / zbMATH Keywords: parallel algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum matching
Property / zbMATH Keywords: maximum matching / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parallel complexity of maximum f-matching and the degree sequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved processor bounds for combinatorial problems in RNC / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Las Vegas RNC algorithm for maximum matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:37, 12 July 2024

scientific article
Language Label Description Also known as
English
A note on parallel complexity of maximum \(f\)-matching
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references