An approximation algorithm for the maximum leaf spanning arborescence problem (Q2930326): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56502745 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2083082533 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:52, 20 March 2024
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