A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q3225144): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016241195 / rank | |||
Normal rank | |||
Latest revision as of 21:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs |
scientific article |
Statements
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (English)
0 references
15 March 2012
0 references
maximum leaf
0 references
spanning tree
0 references
connected dominating set
0 references
cubic graph
0 references
approximation algorithm
0 references
