The following pages link to (Q6065424):
Displaying 4 items.
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
- O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS (Q5249020) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Distance queries over dynamic interval graphs (Q6577442) (← links)