A scale-free structure for power-law graphs

@article{Veras2016ASS,
  title={A scale-free structure for power-law graphs},
  author={Richard Veras and Tze Meng Low and Franz Franchetti},
  journal={2016 IEEE High Performance Extreme Computing Conference (HPEC)},
  year={2016},
  pages={1-7}
}
Many real-world graphs, such as those that arise from the web, biology and transportation, appear random and without a structure that can be exploited for performance on modern computer architectures. However, these graphs have a scale-free graph topology that can be leveraged for locality. Existing sparse data formats are not designed to take advantage of this structure. They focus primarily on reducing storage requirements and improving the cost of certain matrix operations for these large… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

A scale-free structure for real world networks

  • 2017 IEEE High Performance Extreme Computing Conference (HPEC)
  • 2017
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

STINGER: High performance data structure for streaming graphs

  • 2012 IEEE Conference on High Performance Extreme Computing
  • 2012
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…