Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
From MaRDI portal
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)- Collective singleton-based consistency for qualitative constraint networks: theory and practice
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- Polarity of chordal graphs
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- An implementation of the iterative proportional fitting procedure by propagation trees.
- LexBFS-orderings and powers of chordal graphs
- Computing partial hypergraphs of bounded width
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- A logic-based analysis of Dempster-Shafer theory
- A note on odd/even cycles
- Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions
- Minimal elimination of planar graphs
- Dynamic Branching in Qualitative Constraint Networks via Counting Local Models
- Robustness to dependency in portfolio optimization using overlapping marginals
- High dimensional posterior convergence rates for decomposable graphical models
- Heuristic and metaheuristic methods for computing graph treewidth
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
- Chordal graph recognition is in NC
- Counting the number of independent sets in chordal graphs
- Fast minimal triangulation algorithm using minimum degree criterion
- On the maximum cardinality search lower bound for treewidth
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- A linear time algorithm to list the minimal separators of chordal graphs
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
- Computing the maximum-entropy extension of given discrete probability distributions
- Laminar structure of ptolemaic graphs with applications
- Minimal vertex separators of chordal graphs
- The induced path function, monotonicity and betweenness
- Linear-time algorithms for tree root problems
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Studies on hypergraphs. I: Hyperforests
- A note on lexicographic breadth first search for chordal graphs
- \(K_{1,3}\)-free and \(W_4\)-free graphs
- On the effective implementation of the iterative proportional fitting procedure
- Peakless functions on graphs
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- A faster algorithm to recognize undirected path graphs
- Efficient algorithms for network localization using cores of underlying graphs
- Bayesian approaches for large biological networks
- Structural conditions for cycle completable graphs
- Cycle structure of edge labelled graphs
- Twins in Subdivision Drawings of Hypergraphs
- Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
- Semantic acyclicity on graph databases
- Prim-based support-graph preconditioners for min-cost flow problems
- A fully dynamic graph algorithm for recognizing interval graphs
- Recognizing different types of beta-cycles in a database scheme
- Graph connectivity and its augmentation: Applications of MA orderings
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Interval graphs and related topics
- A new algorithm for decomposition of graphical models
- Unifying tree decompositions for reasoning in graphical models
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Recognizing single-peaked preferences on a tree
- A special case for subset interconnection designs
- Efficient local updates for undirected graphical models
- Path-based supports for hypergraphs
- The recognition problem of graph search trees
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- Distributed revision of composite beliefs
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Path-based supports for hypergraphs
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Triangulation of Bayesian networks by retriangulation
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Uniform Constraint Satisfaction Problems and Database Theory
- scientific article; zbMATH DE number 61022 (Why is no real title available?)
- Inference in belief networks: A procedural guide
- Existence of extensions and product extensions for discrete probability distributions
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- \(k\)-NLC graphs and polynomial algorithms
- Some aspects of the semi-perfect elimination
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Finding minimum height elimination trees for interval graphs in polynomial time
- On 3-Steiner simplicial orderings
- \(r\)-dominating cliques in graphs with hypertree structure
- The forbidden subgraph characterization of directed vertex graphs
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
- New lower bounds for bin packing problems with conflicts
- Inclusion/exclusion meets measure and conquer
- Vertex ordering characterizations of graphs of bounded asteroidal number
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Some results on the target set selection problem
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
- On the semi-perfect elimination
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Polynomial kernels for proper interval completion and related problems
- Temporal constraint networks
- Discovering a junction tree behind a Markov network by a greedy algorithm
- Minimal triangulations of graphs: a survey
- A fast algorithm for query optimization in universal-relation databases
- Tree decompositions of graphs: saving memory in dynamic programming
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- Tree clustering for constraint networks
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Decomposing constraint satisfaction problems using database techniques
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)
