Partial path groups and parallel graph contractions
G Rozenberg, A Salomaa, A Rosenfeld - The Book of L, 1986 - Springer
G Rozenberg, A Salomaa, A Rosenfeld
The Book of L, 1986•SpringerWe define an algebraic structure on the paths in a graph based on a coloring of the arcs.
Using this structure, basic classes of graphs (trees, hypercubes, arrays, cliques, etc.) are
characterized by simple algebraic properties. The structure provides a framework for
defining parallel contraction operations on a graph, in which many pairs of nodes are
simultaneously collapsed into single nodes, but the degree of the graph does not increase.
Such operations are useful in defining systematic strategies for simulating large networks of …
Using this structure, basic classes of graphs (trees, hypercubes, arrays, cliques, etc.) are
characterized by simple algebraic properties. The structure provides a framework for
defining parallel contraction operations on a graph, in which many pairs of nodes are
simultaneously collapsed into single nodes, but the degree of the graph does not increase.
Such operations are useful in defining systematic strategies for simulating large networks of …
Abstract
We define an algebraic structure on the paths in a graph based on a coloring of the arcs. Using this structure, basic classes of graphs (trees, hypercubes, arrays, cliques, etc.) are characterized by simple algebraic properties. The structure provides a framework for defining parallel contraction operations on a graph, in which many pairs of nodes are simultaneously collapsed into single nodes, but the degree of the graph does not increase. Such operations are useful in defining systematic strategies for simulating large networks of processors by smaller ones, or in building “pyramids” of networks.
Springer
Showing the best result for this search. See all results