scispace - formally typeset
Search or ask a question

Showing papers on "Adjacency list published in 1978"




Journal ArticleDOI
TL;DR: Efficient data structures for picture processing are developed on the basis of graph-theoretic concepts by a directed split-and-merge algorithm and subsequent analysis is performed by examining either the region adjacency graph (RAG) or the vertex adjacencies graph (VAG).

22 citations


Book ChapterDOI
01 Jan 1978
TL;DR: In this article, the adjacency of two vertices on an arbitrary 0-1-polyhedron P is characterized by certain criteria involving the (prime) implicants of P, which are generalizations of the circuits of an independence system.
Abstract: The adjacency of two vertices on an arbitrary 0–1-polyhedron P is characterized by certain criteria involving the (prime) implicants of P, which are generalizations of the circuits of an independence system. These criteria can be checked by straightforward “colouring algorithms”. They are sufficient for all 0–1-polyhedra and necessary for at least three classes containing the polyhedra of many well-known discrete optimization problems, e.g. the vertex packing problem, set packing problem, vertex covering problem, matching problem, assignment problem, partitioning problem, linear ordering problem, partial ordering problem.

17 citations


Journal ArticleDOI
J Gilleard1
TL;DR: A computer-aided design package, LAYOUT, which can be used for the enumeration of rectangular dissections and for the construction of specific plan layouts depending upon requirements of adjacency and size is described.
Abstract: This paper describes a computer-aided design package, LAYOUT, which can be used for the enumeration of rectangular dissections. It can also be used for the construction of specific plan layouts depending upon requirements of adjacency and size. The work is related to recent research in the area of floor-plan enumeration.

12 citations


Journal ArticleDOI
Jr. Henry S. Warren1
TL;DR: This paper gives three relatively simple algorithms for computing node lists of a directed graph such that every simple path in the graph is a subsequence of the node list.

3 citations