On some multicriteria arborescence problems: Complexity and algorithms (Q1917271): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of spanning tree problems: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding multi-constrained spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(95)00035-p / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090155298 / rank
 
Normal rank

Latest revision as of 10:06, 30 July 2024

scientific article
Language Label Description Also known as
English
On some multicriteria arborescence problems: Complexity and algorithms
scientific article

    Statements