Pages that link to "Item:Q1763474"
From MaRDI portal
The following pages link to Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474):
Displaying 11 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)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
