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)- A linear time recognition algorithm for proper interval graphs
- The clique-separator graph for chordal graphs
- Laminar structure of ptolemaic graphs with applications
- Canonical and monophonic convexities in hypergraphs
- On 3-Steiner simplicial orderings
- Interval graphs and related topics
- Neighborhood perfect graphs
- Distributed revision of composite beliefs
- Existence of extensions and product extensions for discrete probability distributions
- Network-based heuristics for constraint-satisfaction problems
- Chordal graph recognition is in NC
- Interaction-free multivalued dependency sets
- On hypergraph acyclicity and graph chordality
- Maximal chordal subgraphs
- Tree clustering for constraint networks
- Algorithmic aspects of intersection graphs and representation hypergraphs
- A note on odd/even cycles
- Recognizing single-peaked preferences on a tree
- Structural conditions for cycle completable graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Some aspects of the semi-perfect elimination
- Cycle-free partial orders and chordal comparability graphs
- Finding large holes
- Temporal constraint networks
- Studies on hypergraphs. I: Hyperforests
- A characterization of finite fd-acyclicity
- A fast algorithm for query optimization in universal-relation databases
- Fast Bayes and the dynamic junction forest
- Minimal vertex separators of chordal graphs
- Construction of a simple elimination scheme for a chordal comparability graph in linear time
- The forbidden subgraph characterization of directed vertex graphs
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- The maximum clique problem
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- Decomposing constraint satisfaction problems using database techniques
- \(k\)-NLC graphs and polynomial algorithms
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Finding minimum height elimination trees for interval graphs in polynomial time
- Clique tree generalization and new subclasses of chordal graphs
- New linear time algorithms for generating perfect elimination orderings of chordal graphs
- Probability propagation
- Information and probabilistic reasoning
- \(r\)-dominating cliques in graphs with hypertree structure
- LexBFS-orderings and powers of chordal graphs
- The existence of homeomorphic subgraphs in chordal graphs
- A special case for subset interconnection designs
- On computing minimal models
- An algorithm for coloring some perfect graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Handling multiple sources of variation using influence diagrams
- Separability generalizes Dirac's theorem
- Conjunctive query containment revisited
- A practical algorithm for making filled graphs minimal
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Restricted triangulation on circulant graphs
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices
- Graph extremities defined by search algorithms
- Computing a clique tree with the algorithm maximal label search
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- On spectrum assignment in elastic optical tree-networks
- Homology cycles and dependent cycles of hypergraphs
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Spanning trees and identifiability of a single-factor model
- Paired threshold graphs
- Inference in belief networks: A procedural guide
- Perfect elimination orderings of chordal powers of graphs
- On the semi-perfect elimination
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
- Computing marginals for arbitrary subsets from marginal representation in Markov trees
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Multigraph representations of hierarchical loglinear models
- An adaptive reasoning approach towards effficient ordering of composite hypotheses
- Sequences of regressions and their independences
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- A decomposition algorithm for learning Bayesian networks based on scoring function
- Decomposable convexities in graphs and hypergraphs
- Some results on the target set selection problem
- A fully dynamic graph algorithm for recognizing interval graphs
- The difficulty of being moral
- Efficiently enumerating minimal triangulations
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
- Graph classes and approximability of the happy set problem
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- ProCount: weighted projected model counting with graded project-join trees
- Recognizing graph search trees
- Default reasoning using classical logic
- Perfect elimination orderings for symmetric matrices
- Estimating the number of connected components in a graph via subgraph sampling
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Latent association graph inference for binary transaction data
- Detecting fixed patterns in chordal graphs in polynomial time
- Inclusion/exclusion meets measure and conquer
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Computing vertex-disjoint paths in large graphs using MAOs
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)
