Pages that link to "Item:Q4987268"
From MaRDI portal
The following pages link to Efficient enumeration of non-isomorphic interval graphs (Q4987268):
Displaying 7 items.
- Efficient enumeration of non-isomorphic Ptolemaic graphs (Q782198) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Deferred-query: An efficient approach for some problems on interval graphs (Q4262690) (← links)
- (Q5298912) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)