Pages that link to "Item:Q1962057"

The following pages link to A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057):

Displayed 11 items.

• Minimal triangulations of graphs: a survey (Q819823) ‎ (← links)
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) ‎ (← links)
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) ‎ (← links)
• Characterizing and computing minimal cograph completions (Q972335) ‎ (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) ‎ (← links)
• Triangulating graphs with few \(P_4\)'s (Q1281383) ‎ (← links)
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) ‎ (← links)
• Equistable distance-hereditary graphs (Q2473043) ‎ (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) ‎ (← links)
• Characterizing and Computing Minimal Cograph Completions (Q3507328) ‎ (← links)
• Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) ‎ (← links)