Pages that link to "Item:Q3835023"
From MaRDI portal
The following pages link to An Incremental Linear-Time Algorithm for Recognizing Interval Graphs (Q3835023):
Displaying 50 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- BOB: Improved winner determination in combinatorial auctions and generalizations (Q814442) (← links)
- ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Scale free interval graphs (Q1035692) (← links)
- On probe interval graphs (Q1281778) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← 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)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Weighted irredundance of interval graphs. (Q2583539) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- Minimal Obstructions for Partial Representations of Interval Graphs (Q2942647) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Catching a Fast Robber on Interval Graphs (Q3010416) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
- (Q4250178) (← links)
