AbstractReducible flowgraphs were first defined by Allen in terms of intervals; another definition based on two flowgraph transformations was presented by Hecht and Ullman. In this paper, we extend the notion of reducibility to directed hypergraphs, proving that the interval and the transformation approaches preserve the equivalence when applied to this family
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning h...
This dissertation consists of three chapters, each concerning a separate topic within the field of g...
AbstractThe subject of this paper is the computer representation and reduction of a particular graph...
Many problems in program optimization have been solved by applying a technique called interval analy...
In this paper, we discuss hamiltonian problems for reducible flowgraphs. The main result is finding,...
AbstractA “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its...
Many problems in program optimizationn have been solved by applying a technique called interval anal...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractReducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized...
We present some structure theorems for the class of binary flowgraphs. These graphs show up in the s...
K. Kennedy recently conjectured that for every n node reducible flow graph, there is a sequence of n...
Absolute retracts of reflexive graphs are graphs (with loops) for which the systems of all discs hav...
Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are us...
In this paper the concept of reducibility in graph theory is discussed, and the deletable vertex (ed...
A strong node sequence for a directed graph G=(N,A) is a sequence of nodes containing every cycle-fr...
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning h...
This dissertation consists of three chapters, each concerning a separate topic within the field of g...
AbstractThe subject of this paper is the computer representation and reduction of a particular graph...
Many problems in program optimization have been solved by applying a technique called interval analy...
In this paper, we discuss hamiltonian problems for reducible flowgraphs. The main result is finding,...
AbstractA “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its...
Many problems in program optimizationn have been solved by applying a technique called interval anal...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractReducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized...
We present some structure theorems for the class of binary flowgraphs. These graphs show up in the s...
K. Kennedy recently conjectured that for every n node reducible flow graph, there is a sequence of n...
Absolute retracts of reflexive graphs are graphs (with loops) for which the systems of all discs hav...
Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are us...
In this paper the concept of reducibility in graph theory is discussed, and the deletable vertex (ed...
A strong node sequence for a directed graph G=(N,A) is a sequence of nodes containing every cycle-fr...
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning h...
This dissertation consists of three chapters, each concerning a separate topic within the field of g...
AbstractThe subject of this paper is the computer representation and reduction of a particular graph...
DOI
Add to ORKG