Graph rewriting systems and their application to network reliability analysis

DOI10.1007/3-540-55121-2_4MaRDI QIDQ4694716zbMATH OpenFDO

Authors Yasuyoshi Okada, Masahiro Hayashi

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1007/3-540-55121-2_4

zbMATH Keywords

graph rewriting systemsnetwork reliability

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Graph rewriting systems with priorities
• Computing with graph rewriting systems with priorities
• scientific article; zbMATH DE number 3869030
• scientific article; zbMATH DE number 475415
• scientific article; zbMATH DE number 4049097

Cited in

(5)

• Generating irregular partitionable data structures
• Properties of graphs preserved by relational graph rewritings
• scientific article; zbMATH DE number 4095184 (Why is no real title available?)
• Confluence for graph transformations
• Relational graph rewritings

This page was built for publication: Graph rewriting systems and their application to network reliability analysis

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