The following pages link to Kellogg S. Booth (Q1144947):
Displaying 12 items.
- Lexicographically least circular substrings (Q1144948) (← links)
- Computing extremal and approximate distances in graphs having unit cost edges (Q1145636) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Improved time and space bounds for Boolean matrix multiplication (Q1251068) (← links)
- Experimental comparison of splines using the shape-matching paradigm (Q3141195) (← links)
- (Q3327728) (← links)
- (Q3875975) (← links)
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs (Q3904620) (← links)
- Dominating Sets in Chordal Graphs (Q3944643) (← links)
- (Q4026742) (← links)
- Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems (Q4162481) (← links)
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism (Q4187325) (← links)
