Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs |
scientific article
| 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 |
Statements
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (English)
0 references
4 October 2021
0 references
approximation algorithm
0 references
vertex-weighted tree
0 references
internal spanning tree
0 references
cubic graph
0 references
claw-free graph
0 references
depth-first search
0 references
0 references
0 references
0 references
