Diverse Pairs of Matchings (Q6065425): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
label / en | label / en | ||
Diverse Pairs of Matchings | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3116915069 / rank | |||
Normal rank | |||
Property / title | |||
Diverse Pairs of Matchings (English) | |||
Property / title: Diverse Pairs of Matchings (English) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Color-coding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Handbook of Computational Social Choice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parameterized Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5315023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4503944 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411281 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kernelization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster scaling algorithms for general graph matching problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Representatives of Subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Beyond the Vizing's Bound for at Most Seven Colors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3891767 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3395507 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms – ESA 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4231923 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum matchings in general graphs through randomization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank | |||
Normal rank |
Latest revision as of 14:44, 3 August 2024
scientific article; zbMATH DE number 7765384
Language | Label | Description | Also known as |
---|---|---|---|
English | Diverse Pairs of Matchings |
scientific article; zbMATH DE number 7765384 |
Statements
14 November 2023
0 references
matching
0 references
solution diversity
0 references
fixed-parameter tractability
0 references
Diverse Pairs of Matchings (English)
0 references