Titlebook: ;

亲属

法律

Georg Müller-Christ,Michael Hülsmannnt matrix of a graph. In this paper, we show how to avoid using matrix multiplication for these problems on special classes of graphs. This leads to efficient algorithms for recognizing chordal comparability graphs and trapezoid graphs, computing the transitive closure of two dimensional partial orders, and a number of other problems.

我怕被刺穿

https://doi.org/10.1007/978-3-322-93225-9s for deciding whether an .-vertex graph . is a binary Hamming graph, and for computing a binary addressing scheme for . provided its existence. This is not far from being optimal since the addressing scheme may require .(..) space.