Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis

Benjamin Schiller, Clemens Deusser, Jeronimo Castrillon, Thorsten Strufe

Open source

DOI
10.1007/s41109-016-0011-2
Published
2016-09-05
Container
Applied Network Science
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s41109-016-0011-2,
  title = {Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis},
  author = {Benjamin Schiller and Clemens Deusser and Jeronimo Castrillon and Thorsten Strufe},
  year = {2016},
  journal = {Applied Network Science},
  doi = {10.1007/s41109-016-0011-2},
  url = {https://doi.org/10.1007/s41109-016-0011-2}
}

RIS

TY  - JOUR
TI  - Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis
AU  - Benjamin Schiller
AU  - Clemens Deusser
AU  - Jeronimo Castrillon
AU  - Thorsten Strufe
PY  - 2016
JO  - Applied Network Science
DO  - 10.1007/s41109-016-0011-2
UR  - https://doi.org/10.1007/s41109-016-0011-2
ER  - 

APA

Schiller, B., Deusser, C., Castrillon, J., & Strufe, T. (2016). Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis. Applied Network Science. https://doi.org/10.1007/s41109-016-0011-2

Source records