Pages that link to "Item:Q1827809"

The following pages link to A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809):

Displaying 43 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• Unit and single point interval graphs (Q427904) (← links)
• The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Dynamic algorithms for monotonic interval scheduling problem (Q476865) (← links)
• On the non-unit count of interval graphs (Q496432) (← links)
• A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
• Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
• Mixed unit interval graphs (Q713160) (← links)
• Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
• A tie-break model for graph search (Q896657) (← links)
• A new graph parameter to measure linearity (Q1708605) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
• Recovering the structure of random linear graphs (Q1790469) (← links)
• Integral mixed unit interval graphs (Q1949108) (← links)
• Graphs of interval count two with a given partition (Q2015148) (← links)
• Reconstruction of line-embeddings of graphons (Q2136610) (← links)
• Graph searches and their end vertices (Q2165035) (← links)
• Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
• Robinsonian matrices: recognition challenges (Q2403299) (← links)
• Extending partial representations of interval graphs (Q2408095) (← links)
• The Roberts characterization of proper and unit interval graphs (Q2461218) (← 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)
• Short Models for Unit Interval Graphs (Q2840545) (← links)
• (Q2857436) (← links)
• Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
• A Characterization of Mixed Unit Interval Graphs (Q2945201) (← links)
• End-Vertices of Graph Search Algorithms (Q2947028) (← links)
• Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
• Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
• Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593) (← links)
• Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
• Recognizing Proper Tree-Graphs (Q6089652) (← links)
• A characterization of unit interval bigraphs of open and closed intervals (Q6184331) (← links)
• Balancing graph Voronoi diagrams with one more vertex (Q6196878) (← links)