The Bounded Path Tree Problem (Q4750668): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Paolo M. Camerini / rank
Normal rank
 
Property / author
 
Property / author: Paolo M. Camerini / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0603048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064733879 / 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: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path problem is not harder than matrix multiplication / rank
 
Normal rank

Latest revision as of 17:48, 13 June 2024

scientific article; zbMATH DE number 3807644
Language Label Description Also known as
English
The Bounded Path Tree Problem
scientific article; zbMATH DE number 3807644

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references