Search results

(1 - 9 of 9)

: Determining Cliques of a Graph
Author(s):: Johnson
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: A generalization of the neighborhood of a vertex [7] is used to prove several results on the relation of a set of vertices of...

: Subroutines with variable number of arguments
Author(s):: Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: In designing a general purpose subroutine package to solve a class of problems, one often has to write subroutines with a...

: Quadrature formulae for functions of two variables and applications
Author(s):: Garey, LeBlanc
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report

: Remote job entry and output through APL
Author(s):: Gujar
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1974
Type:: Technical Report
: The power of interactive computing and especially of APL is already well recognized. Some limitations and inconveniences of...

: An algorithm for determining the chromatic number of a graph
Author(s):: Miller
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: An algorithm for determining the chromatic number of a graph is presented. The storage requirement is on the order of the...

: Block methods for nonlinear Volterra integral equations
Author(s):: Garey
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report
: An adaptation of a method by Boland [3] leading to a generalization of the block methods of Linz [8] are presented in this...

: Comments on "A General Fortran Emulator for IBM 360/370 Random Number Generator 'Randu' 1"
Author(s):: Fellows
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1975
Type:: Technical Report

: A search algorithm for finding the simple cycles of a directed graph
Author(s):: Johnson
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1974
Type:: Technical Report
: Two efficient algorithms, that admit each simple cycle once in searching the ares of a digraph, are presented and a proof of...

: A new spanning tree algorithm
Author(s):: Wasson, McIssaac
Discipline:: Computer Science
Discipline:: Computer Science
Date:: 1974
Type:: Technical Report
: The algorithm outlined in this paper finds all the spanning trees of a non-directed graph G. The graph is represented by a...

Zircon - This is a contributing Drupal Theme
Design by WeebPal.