Independent sets versus perfect matchings (Q673116): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A taxonomy of problems with fast parallel algorithms / 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: Parallel Prefix Computation / 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: The complexity of computing the permanent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3796778 / rank | |||
Normal rank |
Latest revision as of 10:23, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Independent sets versus perfect matchings |
scientific article |
Statements
Independent sets versus perfect matchings (English)
0 references
28 February 1997
0 references
matchings
0 references
independent sets
0 references