Pages that link to "Item:Q1763474"

The following pages link to Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474):

Displayed 15 items.

• Two characterisations of the minimal triangulations of permutation graphs (Q390311) ‎ (← links)
• Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) ‎ (← links)
• Certifying algorithms (Q465678) ‎ (← links)
• Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) ‎ (← links)
• A tie-break model for graph search (Q896657) ‎ (← links)
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) ‎ (← links)
• Hardness and approximation of minimum distortion embeddings (Q991793) ‎ (← links)
• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) ‎ (← links)
• Minimal interval completion through graph exploration (Q1001896) ‎ (← links)
• Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) ‎ (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) ‎ (← links)
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) ‎ (← links)
• On the Power of Graph Searching for Cocomparability Graphs (Q2801333) ‎ (← links)
• A new representation of proper interval graphs with an application to clique-width (Q2839207) ‎ (← links)
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) ‎ (← links)