A note on extending Knuth's tree estimator to directed acyclic graphs (Q1108027): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0020-0190(87)90187-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020454559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Analysis and Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Efficiency of Backtrack Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:46, 18 June 2024

scientific article
Language Label Description Also known as
English
A note on extending Knuth's tree estimator to directed acyclic graphs
scientific article

    Statements

    A note on extending Knuth's tree estimator to directed acyclic graphs (English)
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed acyclic graphs
    0 references
    backtrack search
    0 references
    randomized algorithms
    0 references
    estimation
    0 references
    0 references