The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems / T. Lengauer ; K. W. Wagner. - In: STACS : STACS 87 / ed. by F. J. Brandenburg ... - Berlin u. a. : Springer, 1987. - S. 100-113. - (Lecture notes in computer science ; 247)
<p>The article describes the results of modifying the algorithm Chameleon. Hierarchical multi-level ...
This book is the culmination of three years of research effort on a multidisciplinary project in whi...
The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various ...
The correlation between the complexities of the non-hierarchical and hierarchical versions of graph ...
AbstractIn [Le 82, Le 87, LW 87, LW 88a, Le 89] a hierarchical graph model is discussed that allows ...
SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
An algorithm is described for developing a hierarchy among a set of elements having certain precede...
<p>The shape sizes and enclosed numbers indicate the number of networks at that coordinate (an empty...
Abstract: The main thesis of this paper is that intricate nature of software systems can, and in our...
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathemat...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
Graph and network models are essential for data science applications in computer science, social sci...
The hierarchical organization in complex networks is investigated from the point of view of nearest ...
The hierarchical organization in complex networks is investigated from the point of view of nearest ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...
<p>The article describes the results of modifying the algorithm Chameleon. Hierarchical multi-level ...
This book is the culmination of three years of research effort on a multidisciplinary project in whi...
The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various ...
The correlation between the complexities of the non-hierarchical and hierarchical versions of graph ...
AbstractIn [Le 82, Le 87, LW 87, LW 88a, Le 89] a hierarchical graph model is discussed that allows ...
SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
An algorithm is described for developing a hierarchy among a set of elements having certain precede...
<p>The shape sizes and enclosed numbers indicate the number of networks at that coordinate (an empty...
Abstract: The main thesis of this paper is that intricate nature of software systems can, and in our...
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathemat...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
Graph and network models are essential for data science applications in computer science, social sci...
The hierarchical organization in complex networks is investigated from the point of view of nearest ...
The hierarchical organization in complex networks is investigated from the point of view of nearest ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...
<p>The article describes the results of modifying the algorithm Chameleon. Hierarchical multi-level ...
This book is the culmination of three years of research effort on a multidisciplinary project in whi...
The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various ...