Pages that link to "Item:Q3335007"
From MaRDI portal
The following pages link to Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007):
Displaying 50 items.
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- Probability propagation (Q1356197) (← links)
- Information and probabilistic reasoning (Q1356199) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- LexBFS-orderings and powers of chordal graphs (Q1363684) (← links)
- The existence of homeomorphic subgraphs in chordal graphs (Q1372257) (← links)
- A special case for subset interconnection designs (Q1377654) (← links)
- On computing minimal models (Q1380414) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Handling multiple sources of variation using influence diagrams (Q1390202) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- An implementation of the iterative proportional fitting procedure by propagation trees. (Q1606471) (← links)
- Restricted triangulation on circulant graphs (Q1644872) (← links)
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices (Q1647455) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Homology cycles and dependent cycles of hypergraphs (Q1753346) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Spanning trees and identifiability of a single-factor model (Q1766966) (← links)
- Paired threshold graphs (Q1801073) (← links)
- Inference in belief networks: A procedural guide (Q1809338) (← links)
- Perfect elimination orderings of chordal powers of graphs (Q1815326) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- Computing marginals for arbitrary subsets from marginal representation in Markov trees (Q1855211) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Multigraph representations of hierarchical loglinear models (Q1918460) (← links)
- An adaptive reasoning approach towards effficient ordering of composite hypotheses (Q1924778) (← links)
- Sequences of regressions and their independences (Q1936537) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- A decomposition algorithm for learning Bayesian networks based on scoring function (Q1951225) (← links)
- Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
- Some results on the target set selection problem (Q1956258) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- The difficulty of being moral (Q1981772) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
