Results 241 to 250 of about 275,010 (282)

On flows in bidirected graphs

Discrete Mathematics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cun-Quan Zhang
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Flow Graph Reducibility

SIAM Journal on Computing, 1972
The structure of programs can often be described by a technique called “interval analysis” on their flow graphs. Here, we characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformation on graphs. We then give a necessary and sufficient condition for analyzability and apply it to “goto-less programs ...
Matthew S. Hecht, Jeffrey D. Ullman
openaire   +2 more sources

On Circular Flows Of Graphs

Combinatorica, 2007
A sufficient condition for graphs with circular flow index less than 4 is found in this paper. In particular, we give a simple proof of a result obtained by Galluccio and Goddyn (Combinatorica, 2002), and obtain a larger family of such graphs.
Hong-Jian Lai, Rui Xu 0023, Cun-Quan Zhang   +2 more
openaire   +1 more source

On the Modifications of Flow Graphs

Journal of the Society for Industrial and Applied Mathematics, 1965
Graphs representing linear algebraic equations are known as flow graphs. If \(A\) is an \(n\) by \(n\) square matrix of coefficients, a graph on \(n\) vertices is associated with \(A\) as follows: an arc going from the vertex \(a_i\) to \(a_j\) appears with weight \(a_{ji}\) in the graph if and only if \(a_{ji} \ne 0\) in \(A\).
openaire   +2 more sources

Linkage of graphs with flows

Journal of Combinatorial Theory, Series A
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Abreu, Marco Pacini, Matheus Secco
openaire   +1 more source

Flow graphs, signal flow graphs, and graph determinants

Proceedings of the IEE Part C: Monographs, 1962
The flow graph, introduced by C. L. Coates, is a structure, allied to the signal flow graph, which allows the solution of a system of linear equations to be found in a way which avoids certain redundancies. It is shown in the paper how the essential advantages of Coates's theory can be incorporated into signal-flow-graph analysis.
openaire   +1 more source

Signal Flow Graphs and Data Flow Graphs

2010
Signal processing programs differ from the traditional computing programs in the sense that these programs are referred to as non-terminating programs. In other words, input samples are processed periodically (typically with a certain iteration period or sampling period) and the tasks are repeated infinite number of times.
Keshab K. Parhi, Yanni Chen
openaire   +1 more source

Characterizations of Reducible Flow Graphs

Journal of the ACM, 1974
It is established that if G is a reducible flow graph, then edge ( n, m ) is backward (a back latch) if and only if either n = m or m dominates n in G . Thus, the backward edges of a reducible flow
Matthew S. Hecht, Jeffrey D. Ullman
openaire   +2 more sources

Node flows in graphs with conservative flow

Acta Informatica, 1973
In analyzing graphs with conservative flow where the node flows are of interest (e.g. algorithm flowcharts) the practice has been to measure or to analytically determine the flows in the independent edges, and to calculate all other edge flows using Kirchhoff's law of flow conservation. The node flows are then obtained as the sum of edge flows entering
openaire   +2 more sources