The following pages link to (Q4161356):
Displaying 15 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← links)
- Phylogeny numbers (Q1270783) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- A local method for identifying causal relations under Markov equivalence (Q2124443) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination (Q2694569) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
- (Q5743476) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Computing 2-twinless blocks (Q5862677) (← links)
