Pages that link to "Item:Q3335007"

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 40 items.

• (Q5150665) (← links)
• On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
• Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• (Q5743476) (← links)
• Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
• Tree decompositions and social graphs (Q5856440) (← links)
• (Q5874519) (← links)
• Detecting induced subgraphs (Q5900072) (← links)
• Graph transformations preserving the stability number (Q5916099) (← links)
• A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
• Cycle-connected mixed graphs and related problems (Q5918609) (← links)
• Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)
• A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505) (← links)
• Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorption (Q5944733) (← links)
• Complexity classification of some edge modification problems (Q5948964) (← links)
• Diameter determination on restricted graph families (Q5951960) (← links)
• Efficient local updates for undirected graphical models (Q5963562) (← links)
• Linearizing partial search orders (Q6039439) (← links)
• Linear optimization over homogeneous matrix cones (Q6047504) (← links)
• Dynamic Branching in Qualitative Constraint Networks via Counting Local Models (Q6060100) (← links)
• Quasi-optimal recombination operator (Q6084518) (← links)
• A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
• Edge deletion to tree-like graph classes (Q6124427) (← links)
• Computing the decomposable entropy of belief-function graphical models (Q6178723) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
• Generalized cut trees for edge-connectivity (Q6187342) (← links)
• Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models (Q6540522) (← links)
• LexBFS-orderings and powers of graphs (Q6550543) (← links)
• Decomposing the feasibility of clustered spanning tree by paths (Q6558681) (← links)
• Global minimization of polynomial integral functionals (Q6573176) (← links)
• Leanness computation: small values and special graph classes (Q6606996) (← links)
• Transit functions and pyramid-like binary clustering systems (Q6611037) (← links)
• The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)
• Hypergraph edge representations with the use of homological paths (Q6644071) (← links)
• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)