On minimum maximal distance-\(k\) matchings (Q509288): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 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: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6682413 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum maximal distance-\(k\) matching | |||
| Property / zbMATH Keywords: minimum maximal distance-\(k\) matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(k\)-equimatchable graphs | |||
| Property / zbMATH Keywords: \(k\)-equimatchable graphs / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.11.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2915515624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4504901 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3340896 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximability results for the maximum and minimum maximal induced matching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analytical approach to parallel repetition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing independent sets in graphs with large girth / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Maximum Independent Set Problem in Subclasses of Planar Graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:28, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimum maximal distance-\(k\) matchings |
scientific article |
Statements
On minimum maximal distance-\(k\) matchings (English)
0 references
9 February 2017
0 references
minimum maximal distance-\(k\) matching
0 references
computational complexity
0 references
\(k\)-equimatchable graphs
0 references
