A note on extending Knuth's tree estimator to directed acyclic graphs
type: Item
instance of: scholarly article
title: A note on extending Knuth's tree estimator to directed acyclic graphs
zbMATH Open document ID: 0653.68059
DOI: 10.1016/0020-0190(87)90187-6
author: Leonard Pitt
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 4066353
zbMATH Keywords: directed acyclic graphs
zbMATH Keywords: backtrack search
zbMATH Keywords: randomized algorithms
zbMATH Keywords: estimation
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90187-6
OpenAlex ID: W2020454559
cites work: Backtrack Programming
cites work: Combinatorial Analysis and Computers
cites work: Estimating the Efficiency of Backtrack Programs
cites work: Q5519904
cites work: Q4144192
description: scientific article; zbMATH DE number 4066353