    SlashBurn - graph shattering for compression.
    Author: U Kang (ukang@cs.cmu.edu).

Version: 1.0
Date: July 27, 2012

This software is free of charge under research purposes.
For commercial purposes, please contact the author.





SlashBurn is an algorithm to shatter graph and reorder nodes to make a compact adjacency matrix.
The details of SlashBurn can be found in the following paper:

U Kang and Christos Faloutsos. 
Beyond `Caveman Communities': Hubs and Spokes for Graph Compression and Mining. 
IEEE International Conference on Data Mining (ICDM) 2011, Vancouver, Canada. 


If your work uses or refers to SlashBurn, please cite the paper using the following bibtex entry:

@inproceedings{KangF11,
  author    = {U. Kang and
               Christos Faloutsos},
  title     = {Beyond `Caveman Communities': Hubs and Spokes for Graph Compression and Mining},
  booktitle = {ICDM},
  year      = {2011},
}


For further questions, contact U Kang (ukang@cs.cmu.edu).


