Abstract
In this section we describe a technique for finding an assignment of shapes to arcs which minimizes the total cost of a program graph. The technique depends on the graph having a certain structure which we call collapsible. A collapsible graph is a directed, acyclic graph which is series-parallel and includes treelike subgraphs. 17, 21, 12 A more precise definition of the collapsible graphs, which may be found in Appendix A, is not necessary to understand the collapsible graph algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Kluwer Academic Publishers
About this chapter
Cite this chapter
Mace, M.E. (1987). Solution for Graphs with Shared Nodes. In: Memory Storage Patterns in Parallel Processing. The Kluwer International Series in Engineering and Computer Science, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2001-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2001-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9194-7
Online ISBN: 978-1-4613-2001-2
eBook Packages: Springer Book Archive