Add to ORKGAn algebraic treatment of graph and sorting algorithms. - In: Sociedad Chilena de Ciencia de la Computación: Proceedings of the 14th International SCCC Conference. - Concepción, Chile, 1994. - S. 73-8
This book introduces the study of algebra induced by combinatorial objects called directed graphs. T...
The paper presents a new framework for canonically associating an algorithm with a set of rewrite sy...
[1] M. Ajtai, J. Koml'os, and E. Szemer'edi. Sorting in c log n parallel steps. Combinator...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twent...
We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exch...
SIGLETIB: RN 7281 (146) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
There are many popular problems in different practical fields of computer sciences, computer network...
This book consists of a selection of peer-reviewed contributions to the Workshop on Algebraic Graph ...
Firstly, we shall start with an introduction to the main topics in Graph Theory with special emphasi...
Applications of algebra to combinatorics and conversely. Topics include enumeration methods, partial...
I will give a gentle introduction to algebraic graph algorithms by showing how to determine if a giv...
The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explo...
Abstract:- The Theory of Graphs is a wonderful, practical discipline. Informatics has played a big p...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
This book introduces the study of algebra induced by combinatorial objects called directed graphs. T...
The paper presents a new framework for canonically associating an algorithm with a set of rewrite sy...
[1] M. Ajtai, J. Koml'os, and E. Szemer'edi. Sorting in c log n parallel steps. Combinator...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twent...
We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exch...
SIGLETIB: RN 7281 (146) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
There are many popular problems in different practical fields of computer sciences, computer network...
This book consists of a selection of peer-reviewed contributions to the Workshop on Algebraic Graph ...
Firstly, we shall start with an introduction to the main topics in Graph Theory with special emphasi...
Applications of algebra to combinatorics and conversely. Topics include enumeration methods, partial...
I will give a gentle introduction to algebraic graph algorithms by showing how to determine if a giv...
The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explo...
Abstract:- The Theory of Graphs is a wonderful, practical discipline. Informatics has played a big p...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
This book introduces the study of algebra induced by combinatorial objects called directed graphs. T...
The paper presents a new framework for canonically associating an algorithm with a set of rewrite sy...
[1] M. Ajtai, J. Koml'os, and E. Szemer'edi. Sorting in c log n parallel steps. Combinator...