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.
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Discovering a junction tree behind a Markov network by a greedy algorithm (Q402234) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Path-based supports for hypergraphs (Q450570) (← links)
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- On the effective implementation of the iterative proportional fitting procedure (Q674210) (← links)
- Peakless functions on graphs (Q678883) (← links)
- Cycle structure of edge labelled graphs (Q686524) (← links)
- A new algorithm for decomposition of graphical models (Q692688) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Perspectives on the theory and practice of belief functions (Q751097) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- Computing the maximum-entropy extension of given discrete probability distributions (Q804113) (← links)
- Recognizing different types of beta-cycles in a database scheme (Q808238) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning (Q821556) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Bayesian network inference using marginal trees (Q895523) (← links)
- A tie-break model for graph search (Q896657) (← links)
- High dimensional posterior convergence rates for decomposable graphical models (Q902216) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- A universal table model for categorical databases (Q918682) (← links)
