A factorization procedure that is equivalent to successive over relaxation /

"This work was supported in part by the National Science Foundation under Grant No. GJ812."

On algorithms for finding all circuits of a graph

Bibliography: p. [37]-[39]

A symmetric factorization procedure for the solution of elliptic boundary value problems /

Vita.

Analysis of algorithms for finding all spanning trees of a graph.

"Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."

Studies in graph algorithms : generation and labeling problems /

Thesis--Illinois.

A graph-structure transformation model for picture parsing,

"COO-2118-0031."

Numerical studies of Stone's symmetric factorization and the iteration parameters, and [tau].

Thesis (M.S.)--University of Illinois.

Pánta ta kat' exoch?n kaloumena Biblia Theias d?lad? Graph?s palaias te, kai neas = Sacrae scripturae veteris nouaéque omnia.

CCBE S. XVI,

Peri to O, hermēneutōn tēs Palaias Theias Graphēs vivlia 4.

Mode of access: Internet.

Unit graph and loss rate optimization : Hydrologic Engineering Center computer program 23-J2-L211.

At head of title : Generalized computer program.

Unit graph and hydrograph computation : Hydrologic Engineering Center computer program 23-J2-L228.

At head of cover title : Generalized computer program.

Understanding human genome regulation through entropic graph-based regularization and submodular optimization

Thesis (Ph.D.)--University of Washington, 2016-06

Graph-based Semi-Supervised Learning in Acoustic Modeling for Automatic Speech Recognition

Thesis (Ph.D.)--University of Washington, 2016-06

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.