Add to ORKGAn algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer
The correlation between the complexities of the non-hierarchical and hierarchical versions of graph ...
A method of graph algorithm visualization based on an implicit visual effect generation approach is ...
A new operation on graphs is introduced and some of its properties are studied. We call it hierarch...
An algorithm is described for developing a hierarchy among a set of elements having certain precede...
SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Abstract: The main thesis of this paper is that intricate nature of software systems can, and in our...
The hierarchical network problem is the problem of nding the least cost net-work, with nodes divided...
AbstractIn [Le 82, Le 87, LW 87, LW 88a, Le 89] a hierarchical graph model is discussed that allows ...
AbstractThis paper presents a framework for constructing hierarchical (hyper)graphs, using one of th...
The standard representation of a graph is a list of its vertices and edges. However, graphs encounte...
Introduction Hierarchical graphs are directed graphs with layering structures. They appear in appli...
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: t...
Abstract: This paper investigates a way of imposing a hierarchy on a graph in order to explore relat...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, ...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
The correlation between the complexities of the non-hierarchical and hierarchical versions of graph ...
A method of graph algorithm visualization based on an implicit visual effect generation approach is ...
A new operation on graphs is introduced and some of its properties are studied. We call it hierarch...
An algorithm is described for developing a hierarchy among a set of elements having certain precede...
SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Abstract: The main thesis of this paper is that intricate nature of software systems can, and in our...
The hierarchical network problem is the problem of nding the least cost net-work, with nodes divided...
AbstractIn [Le 82, Le 87, LW 87, LW 88a, Le 89] a hierarchical graph model is discussed that allows ...
AbstractThis paper presents a framework for constructing hierarchical (hyper)graphs, using one of th...
The standard representation of a graph is a list of its vertices and edges. However, graphs encounte...
Introduction Hierarchical graphs are directed graphs with layering structures. They appear in appli...
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: t...
Abstract: This paper investigates a way of imposing a hierarchy on a graph in order to explore relat...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, ...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
The correlation between the complexities of the non-hierarchical and hierarchical versions of graph ...
A method of graph algorithm visualization based on an implicit visual effect generation approach is ...
A new operation on graphs is introduced and some of its properties are studied. We call it hierarch...