graphcompression

A new set of lossy and lossless graph compression techniques for external memory representation.

https://github.com/danielathome19/graphcompression

Science Score: 57.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
    Found CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
    Found .zenodo.json file
  • DOI references
    Found 4 DOI reference(s) in README
  • Academic publication links
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (14.5%) to scientific vocabulary

Keywords

adjacency-list adjacency-matrix algorithms bst compression data-structures graph graph-compression huffman huffman-coding lzw run-length-encoding sparse sparse-matrix
Last synced: 4 months ago · JSON representation ·

Repository

A new set of lossy and lossless graph compression techniques for external memory representation.

Basic Info
Statistics
  • Stars: 3
  • Watchers: 2
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Topics
adjacency-list adjacency-matrix algorithms bst compression data-structures graph graph-compression huffman huffman-coding lzw run-length-encoding sparse sparse-matrix
Created over 3 years ago · Last pushed over 1 year ago
Metadata Files
Readme License Citation

README.md

About

This respository contains a new set of lossy and lossless graph compression techniques for external memory representation. To find out more, check out the provided research papers: * "Graph Compression - Toward a Generalized Algorithm.pdf" (DOI: 10.5281/zenodo.6600816)

Usage

For data used in my experiments: * All datasets can be found on Kaggle (see provided research paper) * See Program/Data folder

NOTE: these folders should be placed in the same folder as "Main.java". For folder existing conflicts, simply merge the directories.

In Main.java, the "main" function acts as the controller for the system to run evaluations, and each component is separated by its own respective class file which may be called individually as well.

To choose an operation or series of operations for the model to perform, simply edit the fpmain function before running. Examples of all function calls can be seen commented out within fpmain.

Bugs/Features

Bugs are tracked using the GitHub Issue Tracker.

Please use the issue tracker for the following purpose: * To raise a bug request; do include specific details and label it appropriately. * To suggest any improvements in existing features. * To suggest new features or structures or applications.

License

The code is licensed under CC0 License 1.0.

Citation

If you use this code for your research, please cite this project: bibtex @software{Szelogowski_GraphCompression_2022, author = {Szelogowski, Daniel}, doi = {10.5281/zenodo.6600816}, month = {May}, title = {{GraphCompression}}, license = {CC0-1.0}, url = {https://github.com/danielathome19/GraphCompression}, version = {1.0.0}, year = {2022} }

Owner

  • Name: Daniel J. Szelogowski
  • Login: danielathome19
  • Kind: user
  • Location: Wisconsin
  • Company: @MECS-Research-Lab

Standing on the shoulders of giants.

Citation (CITATION.cff)

cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
- family-names: "Szelogowski"
  given-names: "Daniel"
  orcid: "https://orcid.org/0000-0002-0350-5771"
title: "GraphCompression"
version: 1.0.0
doi: 10.5281/zenodo.6600816
date-released: 2022-05-09
license: CC0-1.0
url: "https://github.com/danielathome19/GraphCompression"

GitHub Events

Total
  • Fork event: 1
Last Year
  • Fork event: 1