An approximation algorithm for the maximum leaf spanning arborescence problem (Q2930326): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/talg/DrescherV10, #quickstatements; #temporary_batch_1736368027494 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083082533 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/talg/DrescherV10 / rank | |||
Normal rank | |||
Latest revision as of 22:30, 8 January 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the maximum leaf spanning arborescence problem |
scientific article |
Statements
An approximation algorithm for the maximum leaf spanning arborescence problem (English)
0 references
18 November 2014
0 references
approximation algorithms
0 references
arborescence
0 references
directed graphs
0 references
maximum leaf
0 references
