Showing papers on "Adjacency list published in 1974"

Adjacency in digital pictures

Abstract: Let S be a subset of a digital picture, and let s be the complement of S. It is well known that the connected components of S and s, under the relation “is adjacent to,≓ form a tree, and algorithms for constructing this tree have been devised. The main purpose of this paper is to prove that the components do form a tree, and in the process, to provide a basis for proving the validity of the tree-constructing algorithms.

Determining graph properties from matrix representations

Abstract: An open problem, posed by A. Rosenberg [R], motivates the consideration of representations of graphs and the effect of these representations on the efficiency of algorithms which determine properties of unlabelled graphs. In this paper we investigate three matrix representations of graphs; the (vertex) adjacency matrix, the edge-adjacency matrix, and the incidence matrix. With the exception of one instance of the edge-adjacency matrix, these structures determine an unlabelled graph up to isomorphism and are, as a result, natural candidates for computer representations of graphs.

On adjacency preserving maps

Abstract: In his paper [1] on homogeneous spaces W. L. Chow states that “ Any one-toone adjacency preserving transformation of the Grassmann space of all the [r] of Sn (0 < r < n— 1) onto itself is a transformation of the basic group of the space.” In the proof both the transformation and its inverse are assumed to be adjacency preserving. See also Dieudonne [2] p. 81.

On the Aanderaa-Rosenberg Conjecture

Abstract: In a recent paper [1], Rosenberg conjectures that the results found in Holt and Reingold [2], can be generalized. Suppose that graphs are presented via their adjacency matrices. Then Holt and Reingold show that any algorithm which detects whether or not a graph is strongly connected (respectively, contains a cycle) must in worst case probe 0(n2) entries of the given n x n adjacency matrix. Rosenberg then considers restrictions on graph property P such that any algorithm takes in worst case 0(n2) probes to determine whether or not a n-node graph has property P.

Diffusion model for the adjacency effect in viscous development

Abstract: The adjacency effect in film developed by viscous materials causes image-dependent nonlinearities in the photographic image. This effect has seriously restricted the use of viscous-developed film in applications where accurate quantitative sensitometry is desired. In this paper, we present a fundamental diffusion model for viscous development that allows prediction of the developed image from the exposure distribution. A comparison of theoretical experimental results is included.

Adjacency and prediction in school-age stutterers.

Abstract: The adjacency effect is the tendency for stutterings to occur adjacent to previously stuttered words which have been blotted out in successive readings of a passage. It is presumed to show that stu...

Representing Geographic Information for Efficient Computer Search

Abstract: Computer-based modeling of related natural and cultural processes for a large geographic area requires an information system which accurately represents the process parameters in a readily accessible form. This paper describes the representational techniques used in an experimental system applied to the study of one such process: microwave radiation characteristics of terrain. It is shown that with these techniques depicting terrain coverage, elevation, and slope parameters, data can be retrieved easily according to physical properties and geographic locations. The representations also provide a means for efficiently analyzing spatial relationships such as adjacency and inclusion of features. Typical encoding and retrieval times are indicated.