Pages that link to "Item:Q2784453"

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

Displaying 34 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)
• The interval-merging problem (Q867634) (← links)
• Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• The clique-separator graph for chordal graphs (Q1026133) (← links)
• A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
• A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
• Integral mixed unit interval graphs (Q1949108) (← links)
• Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
• A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
• Recognition of probe proper interval graphs (Q2440119) (← links)
• Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• (Q2857436) (← 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)