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)- \(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
- On hypergraph acyclicity and graph chordality
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Hypertree decompositions and tractable queries
- On computing minimal models
- A generalization of chordal graphs and the maximum clique problem
- Revisiting decomposition by clique separators
- Conjunctive query containment revisited
- Minimal fill in O(\(n^{2.69}\)) time
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Treewidth computations. I: Upper bounds
- Organizing the atoms of the clique separator decomposition into an atom tree
- Equivalence between hypergraph convexities
- Decomposition of structural learning about directed acyclic graphs
- On the power of graph searching for cocomparability graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- Finding clubs in graph classes
- Graph extremities defined by search algorithms
- Sequences of regressions and their independences
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- A linear time recognition algorithm for proper interval graphs
- Enumeration of the perfect sequences of a chordal graph
- Computing cooperative solution concepts in coalitional skill games
- Treewidth computations. II. Lower bounds
- Complexity classification of some edge modification problems
- Chordless paths through three vertices
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Maximal chordal subgraphs
- Characterizing path graphs by forbidden induced subgraphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Retracts of products of chordal graphs
- Fast Bayes and the dynamic junction forest
- Recognizing graph search trees
- Perfect elimination orderings of chordal powers of graphs
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Finding large holes
- Restricted triangulation on circulant graphs
- Static and dynamic source locations in undirected networks
- Clique tree generalization and new subclasses of chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Canonical and monophonic convexities in hypergraphs
- The maximum clique problem
- A note on minimal d-separation trees for structural learning
- Satisfiability of acyclic and almost acyclic CNF formulas. II
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- Diameter determination on restricted graph families
- A general label search to investigate classical graph search algorithms
- Network-based heuristics for constraint-satisfaction problems
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Probability propagation
- Moplex orderings generated by the LexDFs algorithm
- A complete axiomatization of full acyclic join dependencies
- The recognition of geodetically connected graphs
- A practical algorithm for making filled graphs minimal
- Perspectives on the theory and practice of belief functions
- The clique-separator graph for chordal graphs
- Partition search for non-binary constraint satisfaction
- Contracting chordal graphs and bipartite graphs to paths and trees
- Optimal decomposition by clique separators
- Satisfiability of acyclic and almost acyclic CNF formulas
- MCMC model determination for discrete graphical models
- Separability generalizes Dirac's theorem
- A review of tree convex sets test
- 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
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)
