Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Programming and Computer Software · 2007

Object-oriented description of graph data structures

Alexey Demakov

Cited by 1Abstract and details only

Abstract

A solution method for problems of processing graph data structures is presented. This method is based on the use of the specialized language TreeDL and on its extendable compiler. The capabilities of the language and of the compiler exceed the existing solutions, which makes the proposed method more efficient than its analogs.

Cite this paper

APA 7

Demakov, A. (2007). Object-oriented description of graph data structures. Programming and Computer Software, 33(5), 261–271. https://doi.org/10.1134/s0361768807050027

MLA 9

Demakov, Alexey. “Object-oriented description of graph data structures.” Programming and Computer Software, vol. 33, no. 5, 2007, pp. 261–71, https://doi.org/10.1134/s0361768807050027.

Chicago

Demakov, Alexey. 2007. “Object-oriented description of graph data structures.” Programming and Computer Software 33 (5): 261–71. https://doi.org/10.1134/s0361768807050027.

Harvard

Demakov, A. (2007) ‘Object-oriented description of graph data structures’, Programming and Computer Software, 33(5), pp. 261–271. Available at: https://doi.org/10.1134/s0361768807050027.

BibTeX
@article{demakov2007object,
  title = {{Object-oriented description of graph data structures}},
  author = {Demakov, Alexey},
  journal = {Programming and Computer Software},
  volume = {33},
  number = {5},
  pages = {261--271},
  year = {2007},
  doi = {10.1134/s0361768807050027}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers