Pages that link to "Item:Q2545884"
From MaRDI portal
The following pages link to Triangulated graphs and the elimination process (Q2545884):
Displaying 50 items.
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Discrete cubical and path homologies of graphs (Q2421567) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Two optimal strategies for active learning of causal models from interventional data (Q2440180) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Subclasses of \(k\)-trees: characterization and recognition (Q2489905) (← links)
- Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
- The elimination procedure for the competition number is not optimal (Q2499585) (← links)
- Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice (Q2543581) (← links)
- On the theory of the elimination process (Q2551436) (← links)
- A counter example to a conjecture of D. J. Rose on minimum triangulation (Q2559391) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph (Q2576353) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- Fuzzy chordal graphs and its properties (Q2669841) (← links)
- Fast causal orientation learning in directed acyclic graphs (Q2677849) (← links)
- Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
- Operator systems for tolerance relations on finite sets (Q2698304) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- On the Structure of Contractible Vertex Pairs in Chordal Graphs (Q2839231) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- Solvability of theories of certain classes of elimination graphs (Q3222869) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
- Decomposable Probabilistic Influence Diagrams (Q3416009) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures (Q3463611) (← links)
- On Directed and Undirected Propagation Algorithms for Bayesian Networks (Q3524971) (← links)
- Convexity in Graphs and Hypergraphs (Q3718757) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595) (← links)
- ?-Perfect graphs (Q4007468) (← links)
- Expansions of Chromatic Polynomials and Log-Concavity (Q4018926) (← links)
- Several results on chordal bipartite graphs (Q4210004) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- Matrices with chordal inverse zero-patterns (Q4274547) (← links)
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects (Q4289817) (← links)
- Determinantal formulae and nonsymmetric gaussian perfect elimination (Q4322522) (← links)
- Edgewise strongly shellable clutters (Q4599711) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- A Local Inverse Formula and a Factorization (Q4611844) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- On the Chordality of Simple Decomposition in Top-Down Style (Q5014670) (← links)
- Chordality Preserving Incremental Triangular Decomposition and Its Implementation (Q5039552) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- Minimal elimination of planar graphs (Q5054857) (← links)
- Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
