On the tree search problem with non-uniform costs (Q306704): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3792452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binary identification problem for weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking and searching in partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of the minimum height decision tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching ordered structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Edge Ranking Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579429 / rank
 
Normal rank

Revision as of 11:49, 12 July 2024

scientific article
Language Label Description Also known as
English
On the tree search problem with non-uniform costs
scientific article

    Statements

    On the tree search problem with non-uniform costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2016
    0 references
    tree search problem
    0 references
    approximation algorithm
    0 references

    Identifiers