Theoretical Analysis of Git Bisect

DOI10.1007/S00453-023-01194-0MaRDI QIDQ6492083zbMATH OpenFDO

Authors Julien Courtiel, Paul Dorbec

Publication date 24 April 2024

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-023-01194-0

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• A simplified NP-complete satisfiability problem
• Approximating optimal binary decision trees
• Approximation strategies for generalized binary search in weighted trees
• Constructing optimal binary decision trees is NP-complete
• Decision Trees for Geometric Models
• Deterministic and probabilistic binary search in graphs
• scientific article; zbMATH DE number 5764837 (Why is no real title available?)
• On the complexity of searching in trees and partially ordered structures
• On the hardness of the minimum height decision tree problem
• Optimal Search in Trees
• Searching in random partially ordered sets

Cited in

(2)

• Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
• Random generation of Git graphs

This page was built for publication: Theoretical Analysis of Git Bisect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492083)