The multiresolution analysis of flow graphs

Abstract

We introduce and prove basic results about several graph-theoretic notions relevant to the multiresolution analysis of flow graphs that represent the transfer of control in computer programs. We take a category-theoretical viewpoint to demonstrate that our definitions are natural and to motivate particular incarnations of related constructions.

WoLLIC 2019; 19 pages. See v1 for MATLAB code

References in corpus (3)

• The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits
• Renormalization and computation I: motivation and background
• The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes

Cited by in corpus (3)

• Path homology as a stronger analogue of cyclomatic complexity
• Magnitude and Topological Entropy of Digraphs
• The geometry of syntax and semantics for directed file transformations