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.
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime (Q2971633) (← links)
- Path-Based Supports for Hypergraphs (Q3000490) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- (Q3057242) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- Characterizing Marginalization and Incremental Operations on the Bayes Tree (Q3381968) (← links)
- Decomposable Probabilistic Influence Diagrams (Q3416009) (← links)
- MCMC model determination for discrete graphical models (Q3430000) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- Simple vertex ordering characterizations for graph search (Q3439379) (← links)
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures (Q3463611) (← links)
- Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay (Q3599072) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
- Triangulation Heuristics for BN2O Networks (Q3638179) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3675541) (← links)
- (Q4009236) (← links)
- Restricted unimodular chordal graphs (Q4229266) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects (Q4289817) (← links)
- DISTRIBUTED INFERENCE IN BAYESIAN NETWORKS (Q4297769) (← links)
- Triangulation of Bayesian networks by retriangulation (Q4419295) (← links)
- Listing all spanning trees in Halin graphs — sequential and Parallel view (Q4603872) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- A REVIEW OF TREE CONVEX SETS TEST (Q4649838) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- (Q4915354) (← links)
- Retracts of Products of Chordal Graphs (Q4920657) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- Minimal elimination of planar graphs (Q5054857) (← links)
- (Q5091003) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
