Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.7155/jgaa.00590 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.7155/JGAA.00590 / rank | |||
Normal rank | |||
Latest revision as of 15:44, 30 December 2024
scientific article; zbMATH DE number 7616337
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs |
scientific article; zbMATH DE number 7616337 |
Statements
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (English)
0 references
14 November 2022
0 references
0 references
0 references
