A real polynomial for bipartite graph minimum weight perfect matchings (Q2094360): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114167077, #quickstatements; #temporary_batch_1712101902020 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Matching Is as Easy as the Decision Problem, in the NC Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rings of sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite perfect matching as a real polynomial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4867143 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite perfect matching is in quasi-NC / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995616 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis of Boolean Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The On-Line Encyclopedia of Integer Sequences / rank | |||
Normal rank |
Latest revision as of 16:39, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A real polynomial for bipartite graph minimum weight perfect matchings |
scientific article |
Statements
A real polynomial for bipartite graph minimum weight perfect matchings (English)
0 references
28 October 2022
0 references
matchings
0 references
graph theory
0 references
lattice theory
0 references
Boolean functions
0 references
combinatorial problems
0 references