Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582)
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: Complexity of the maximum leaf spanning tree problem on planar and regular graphs |
scientific article; zbMATH DE number 6561616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the maximum leaf spanning tree problem on planar and regular graphs |
scientific article; zbMATH DE number 6561616 |
Statements
Complexity of the maximum leaf spanning tree problem on planar and regular graphs (English)
0 references
31 March 2016
0 references
maximum leaf spanning tree
0 references
NP-hardness
0 references
APX-hardness
0 references
planar graph
0 references
cubic graph
0 references
0 references
0 references
0.92601335
0 references
0.92086613
0 references
0 references
0.9152619
0 references
0.9152619
0 references
0.91467565
0 references
0.91331625
0 references
