The following pages link to Ross M. McConnell (Q318916):
Displaying 49 items.
- (Q198223) (redirect page) (← links)
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Certifying algorithms (Q465678) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Linear-time recognition of circular-arc graphs (Q1424251) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- A note on finding minimum mean cycle (Q2398498) (← links)
- Efficient and Practical Algorithms for Sequential Modular Decomposition (Q2775895) (← links)
- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs (Q2864314) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- (Q3128916) (← links)
- (Q3217631) (← links)
- (Q3374245) (← links)
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs (Q3434989) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time (Q3522954) (← links)
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (Q3637103) (← links)
- O(m logn) Split Decomposition of Strongly Connected Graphs (Q3655150) (← links)
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (Q4285914) (← links)
- (Q4362733) (← links)
- (Q4471290) (← links)
- (Q4506382) (← links)
- (Q4533374) (← links)
- (Q4643857) (← links)
- (Q4829024) (← links)
- (Q4982366) (← links)
- (Q5005172) (← links)
- (Q5005173) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- Complete inverted files for efficient text retrieval and analysis (Q5222002) (← links)
- Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
- (Q5501338) (← links)
- (Q5501778) (← links)
- (Q5501779) (← links)
- Formal Concept Analysis (Q5710378) (← links)
- (Q5747380) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897575) (← links)
- Formal Concept Analysis (Q5898492) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)
