On a programming language for graph algorithms-Reference-Cited by-同舟云学术

On a programming language for graph algorithms

Published:1972-06 Issue:2 Volume:12 Page:220-241
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Rheinboldt Werner C.,Basilli Victor R.,Mesztenyi Charles K.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01932817.pdf

Reference19 articles.

1. Department of Computer Science Report;S. Chase,1970

2. D. Childs,Feasibility of a set-theoretic data structure—a general structure based on a reconstituted definition of a relation, Proc. IFIP Congress 68 (1968), 162–172.

3. D. Childs,Description of a set-theoretic data structure, Proc. Fall Joint Computer Conference 68 (1968), 557–564.

4. S. Crespi-Reghizzi and R. Morpurgo,A graph theory oriented extension of ALGOL, Calcolo 5 (1968), 1–43.

5. S. Crespi-Reghizzi and R. Morpurgo,A language for treating graphs, Comm. ACM 13 (1970), 319–323.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks;Inventions;2020-02-20

2. An ALGOL 68 Package for Implementing Graph Algorithms;The Computer Journal;1980-08-01

3. A graph-theoretic language extension for an interactive computer graphics environment;Computers & Graphics;1980-01

4. Graphentheoretische Modelle und Methoden;Formale Modelle für Informationssysteme;1979

5. A survey of sparse matrix research;Proceedings of the IEEE;1977