Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem (Q2171258): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3128894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying independence in bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebra of bayesian belief universes for knowledge‐based systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion, propagation, and structuring in belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic inference in multiply connected belief networks using loop cutsets / rank
 
Normal rank

Latest revision as of 04:40, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
scientific article

    Statements

    Identifiers