All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ijar.2012.06.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109270084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime anyspace probabilistic inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation of Bayesian networks by retriangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3595873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulation of a graph and optimal pivoting order in a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all maximal cliques in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the problem of reporting maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all connected maximal common subgraphs in two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Reasoning with Bayesian Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target-oriented branch and bound method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation Heuristics for BN2O Networks / rank
 
Normal rank

Latest revision as of 13:25, 6 July 2024

scientific article
Language Label Description Also known as
English
All roads lead to Rome -- new search methods for the optimal triangulation problem
scientific article

    Statements

    All roads lead to Rome -- new search methods for the optimal triangulation problem (English)
    0 references
    0 references
    0 references
    13 June 2013
    0 references
    Bayesian networks
    0 references
    optimal triangulation
    0 references
    probabilistic inference
    0 references
    cliques in a graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references