Bayesian networks: the minimal triangulations of a graph (Q2330088): 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/j.tcs.2019.05.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2955788744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cardinality search for computing minimal triangulations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and characterizing the perfect elimination orderings of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified View of Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for testing chordality of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulations of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the perfect sequences of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of perfect elimination orderings in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on lexicographic breadth first search for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:27, 20 July 2024

scientific article
Language Label Description Also known as
English
Bayesian networks: the minimal triangulations of a graph
scientific article

    Statements

    Bayesian networks: the minimal triangulations of a graph (English)
    0 references
    0 references
    0 references
    18 October 2019
    0 references
    Bayesian networks
    0 references
    junction tree algorithm
    0 references
    minimal triangulation
    0 references
    CompMLSM
    0 references

    Identifiers