Pages that link to "Item:Q672408"
From MaRDI portal
The following pages link to Simple linear time recognition of unit interval graphs (Q672408):
Displaying 50 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- On unit interval graphs with integer endpoints (Q324887) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← 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)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Recognition and characterization of unit interval graphs with integer endpoints (Q1752493) (← 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)
- Paired threshold graphs (Q1801073) (← 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)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← 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)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
