Approximating the maximum internal spanning tree problem (Q1034535): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Spanning Trees and Optimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On finding spanning trees with few leaves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4763416 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4763417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252040 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4737170 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a class of posets and the corresponding comparability graphs / rank | |||
Normal rank | |||
Revision as of 02:57, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the maximum internal spanning tree problem |
scientific article |
Statements
Approximating the maximum internal spanning tree problem (English)
0 references
6 November 2009
0 references
approximation algorithm
0 references
spanning tree leaves
0 references
Hamiltonian path
0 references