Pages that link to "Item:Q2784453"

The following pages link to A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs (Q2784453):

Displaying 14 items.

• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) (← links)
• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
• Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Mixed unit interval graphs (Q713160) (← links)
• Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
• (Q5075828) (← links)
• On some subclasses of interval catch digraphs (Q5081214) (← links)
• Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
• A characterization of unit interval bigraphs of open and closed intervals (Q6184331) (← links)