Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...