Pages that link to "Item:Q819823"
From MaRDI portal
The following pages link to Minimal triangulations of graphs: a survey (Q819823):
Displaying 20 items.
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- Triangulability of convex graphs and convex skewness (Q5083873) (← links)
- Objective Bayesian Nets for Integrating Consistent Datasets (Q5094018) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs (Q5366960) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- (Q5501290) (← links)
- (Q5743514) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- (Q5874519) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- Supersolvable saturated matroids and chordal graphs (Q6144421) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
- Bisimplicial separators (Q6565812) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)