D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Compact Representations Of Simplicial - Meshes In Two Self-citation (Blandford Blelloch) (Correct)
No context found.
D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2003.
Compact Data Structures with Fast Queries - Blandford (2005) Self-citation (Blandford Blelloch) (Correct)
No context found.
D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 342--351, 2003.
An Experimental Analysis of a Compact Graph Representation - Blandford, Blelloch, Kash (2004) Self-citation (Blandford Blelloch Kash) (Correct)
No context found.
D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 342--351, 2003.
Compact Representations of Simplicial Meshes in Two .. - Blandford.. (2003) (1 citation) Self-citation (Blandford Blelloch) (Correct)
No context found.
D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2003.
Efficient Query Processing on Unstructured Tetrahedral - Meshes Stratos.. (Correct)
No context found.
D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact representations of separable graphs. In SODA '03.
The WebGraph Framework I: Compression Techniques - Paolo Boldi Universit (2004) (8 citations) (Correct)
No context found.
Daniel K. Blandford, Guy E. Blelloch, and Ian A. Kash. Compact representations of separable graphs. In Proceedings of the Fourteenth Annual ACM--SIAM Symposium on Discrete Algorithms (SODA-03), pages 579--688, New York, 2003. ACM Press.
A Geometric Preferential Attachment Model Of Networks - Flaxman, Frieze, Vera (2004) (Correct)
No context found.
D. Blandford and G. E. Blelloch and I. Kash, Compact Representations of Separable Graphs, Proc. of ACM/SIAM Symposium on Discrete Algorithms (2003,)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC