Pages that link to "Item:Q672268"
From MaRDI portal
The following pages link to A linear-time algorithm for proper interval graph recognition (Q672268):
Displaying 44 items.
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← 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)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- Integral mixed unit interval graphs (Q1949108) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- The eternal dominating set problem for proper interval graphs (Q2345856) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- Unit interval graphs: a story with open ends (Q2857436) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES (Q3620613) (← links)
- (Q4250178) (← links)
- (Q4590888) (← links)
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (Q4857436) (← links)
- Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
- (Q5075828) (← links)
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569) (← links)
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns (Q5425421) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)