Topic
Adjacency list
About: Adjacency list is a research topic. Over the lifetime, 4419 publications have been published within this topic receiving 78449 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, the spectral distance σ (G 1, G 2 ) between n vertex graphs G 1 and G 2 is defined by σ(G 1, G 2) = ∑ i = 1 n | λ i ( G 1 ) - λ I ( G 2 ), where i is the number of vertices in the graph.
42 citations
TL;DR: Results suggest that timber adjacency costs are not overly sensitive to alternative strategies for management unit design that emphasize the generation of specific spa...
Abstract: Spatial considerations in ecosystem management are addressed within the framework of the forest management scheduling adjacency problem. Emphasis is on both the effectiveness of adjacency regulations and the consequences of strategies for management unit design. Four strategies are presented that subdivide stands into maximum-sized harvest units. A dynamic-programming heuristic is used to plan harvest schedules that comply with adjacency constraints over temporal horizons extending up to eight 10-year periods. The impact of stand design and adjacency constraints upon the output of the forest management problem is assessed. Specifically, timber revenues and spatial conditions generated by combining adjacency constraints with alternative strategies are analyzed. Results from test computer runs are discussed for applications in nine scenarios. Results suggest that timber adjacency costs are not overly sensitive to alternative strategies for management unit design that emphasize the generation of specific spa...
42 citations
Patent•
IBM1
TL;DR: In this paper, a two-step procedure was proposed to reduce the required computational effort for performing online mining of association rules by creating an adjacency lattice which pre-stores a number of large itemsets at a level of support dictated by available memory.
Abstract: A computer method of online mining of association rules by pre-processing data within the constraint of available memory. The required computational effort for performing online mining of association rules is reduced by a two-step procedure that involves first creating an adjacency lattice which pre-stores a number of large itemsets at a level of support dictated by available memory. The lattice structure is useful for both finding the itemsets quickly, by reducing the amount of disk I/O required to perform the analysis, and also using the itemsets in order to generate the rules. Once the adjacency lattice is obtained, the second (mining) step is further comprised of two phases. The first phase involves a search algorithm used to find the corresponding itemsets at user specified levels of minimum support. The second phase involves using those itemsets to generate association rules at the user specified level of minimum confidence.
42 citations
TL;DR: It is shown that this is a larger class of graphs and some of its properties are investigated.
42 citations
TL;DR: The method of image segmentation by pyramid relinking is extended to the formalism of hierarchies of region adjacency graphs, and information on regions and boundaries between regions can be combined to guide the segmentation procedure.
42 citations