Programming with very large graphs

DOI10.1007/BFB0017383MaRDI QIDQ4037301zbMATH OpenFDO

Authors Duane A. Bailey, Janice E. Cuny, Charles D. Fisher

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017383

zbMATH Keywords

graph editorsgraph grammarsgraph visualizationparallel algorithmsparallel programmingparallelismvery large graphs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited in

(8)

• Parallel high-level replacement systems
• scientific article; zbMATH DE number 4049015 (Why is no real title available?)
• Reconfiguration graph grammar for massively parallel, fault tolerant computers
• scientific article; zbMATH DE number 1923047 (Why is no real title available?)
• A tool supporting C code parallelization
• Hyperedge replacement with rendezvous
• Amalgamated graph transformations and their use for specifying AGG -- an algebraic graph grammar system
• Graph-based communication in Eden

This page was built for publication: Programming with very large graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037301)