Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
From MaRDI portal
(Redirected from Publication:3335007)
Recommendations
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- On hypergraph acyclicity and graph chordality
- Degrees of acyclicity for hypergraphs and relational database schemes
- Maximal chordal subgraphs
- Efficient Parallel Algorithms for Chordal Graphs
Cited in
(only showing first 100 items - show all)- Distributed revision of composite beliefs
- An adaptive reasoning approach towards effficient ordering of composite hypotheses
- Polynomial kernels for proper interval completion and related problems
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- A linear time algorithm to list the minimal separators of chordal graphs
- Computing the maximum-entropy extension of given discrete probability distributions
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
- Learning tractable Bayesian networks in the space of elimination orders
- Efficient local updates for undirected graphical models
- A logic-based analysis of Dempster-Shafer theory
- Dynamic Branching in Qualitative Constraint Networks via Counting Local Models
- Decomposing the feasibility of clustered spanning tree by paths
- Finding clubs in graph classes
- Coloring Meyniel graphs in linear time
- Simple vertex ordering characterizations for graph search
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Cycle structure of edge labelled graphs
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
- Iterative proportional scaling via decomposable submodels for contingency tables
- Probability propagation
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- I/O-efficient algorithms for graphs of bounded treewidth
- Chordal graph recognition is in NC
- Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
- Symbolic techniques in satisfiability solving
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Bayesian networks: the minimal triangulations of a graph
- Structural conditions for cycle completable graphs
- On domination elimination orderings and domination graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- The maximum clique problem
- Heuristic and metaheuristic methods for computing graph treewidth
- scientific article; zbMATH DE number 7561367 (Why is no real title available?)
- Organizing the atoms of the clique separator decomposition into an atom tree
- Equivalence between hypergraph convexities
- Tree decomposition and discrete optimization problems: a survey
- Minimal vertex separators of chordal graphs
- Linear-time algorithms for tree root problems
- A new algorithm for decomposition of graphical models
- Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Some aspects of the semi-perfect elimination
- Chordal graphs and their clique graphs
- Treewidth computations. II. Lower bounds
- A general label search to investigate classical graph search algorithms
- Satisfiability of acyclic and almost acyclic CNF formulas
- Cycle-free partial orders and chordal comparability graphs
- \(k\)-NLC graphs and polynomial algorithms
- Inference in belief networks: A procedural guide
- Global minimization of polynomial integral functionals
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Enumeration of the perfect sequences of a chordal graph
- Finding large holes
- On listing, sampling, and counting the chordal graphs with edge constraints
- ProCount: weighted projected model counting with graded project-join trees
- Network-based approximate linear programming for discrete optimization
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Linear optimization over homogeneous matrix cones
- Simpler and unified recognition algorithm for path graphs and directed path graphs
- A characterization of finite fd-acyclicity
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
- Minimal fill in O(\(n^{2.69}\)) time
- Conjunctive query containment revisited
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- Diameter determination on restricted graph families
- Interaction-free multivalued dependency sets
- Uniform Constraint Satisfaction Problems and Database Theory
- On the power of graph searching for cocomparability graphs
- Bayesian approaches for large biological networks
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Discovering a junction tree behind a Markov network by a greedy algorithm
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
- New lower bounds for bin packing problems with conflicts
- Searching for better fill-in
- Hypertree decompositions and tractable queries
- The induced path function, monotonicity and betweenness
- A linear time recognition algorithm for proper interval graphs
- On spectrum assignment in elastic optical tree-networks
- Fast Bayes and the dynamic junction forest
- Modifying a graph using vertex elimination
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Canonical and monophonic convexities in hypergraphs
- A story of diameter, radius, and (almost) Helly property
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Graph classes and forbidden patterns on three vertices
- Temporal constraint networks
- A generalization of chordal graphs and the maximum clique problem
- Satisfiability of acyclic and almost acyclic CNF formulas. II
- On hypergraph acyclicity and graph chordality
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- On the semi-perfect elimination
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Handling multiple sources of variation using influence diagrams
- On the complexity of signed and minus total domination in graphs
- Graph classes and approximability of the happy set problem
This page was built for publication: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335007)
