The binary identification problem for weighted trees (Q1758172): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.tcs.2012.06.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004158059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query strategies for priced information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Greedy Algorithms for Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Searching in Trees: Average-Case Minimization / 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: Optimal Binary Identification Procedures / 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: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768391 / 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: Minimum average cost testing for partially ordered components / 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
Property / cites work
 
Property / cites work: Constructing optimal binary decision trees is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Trees for Geometric Models / rank
 
Normal rank

Latest revision as of 21:09, 5 July 2024

scientific article
Language Label Description Also known as
English
The binary identification problem for weighted trees
scientific article

    Statements

    The binary identification problem for weighted trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    binary identification problem
    0 references
    weighted trees
    0 references
    minimum cost strategy
    0 references
    decision tree
    0 references
    computational complexity
    0 references
    NP-hard
    0 references
    0 references