Efficient graph representations

By J. Spinrad. Fields Institute Monographs, 2003

407 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A combinatorial interpretation of the poly-Bernoulli numbers and two Fermat analogues. (2008, methodology): “Also, data compression and recognition algorithms for Lonesum matrices can be found in [18].”
Subcubic Equivalences between Path, Matrix and Triangle Problems (2010, unknown): “This problem is studied extensively (cf. References [10, 27, 39, 40, 52, 55, 74]) for its applications to network reliability.”
EVEN-HOLE-FREE GRAPHS: A SURVEY (2010, background): “Note that this algorithm is robust in Spinrad’s sense [43]: given any graph G, the algorithm either verifies that G is not in C (or in particular that G is not a 4-hole-free odd-signable graph) or it generates all the maximal cliques of G.”
The n-ordered graphs: A new graph class (2009, methodology): “Spinrad [9] observes that there is a similarity between partial orders of height two and bipartite graphs, so that we could use the results of Brightwell, Grable and Prömel to show that upper bounds of the form n exist for some of these graphs.”