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: By finding explicit PD-sets, it is shown that permutation decoding can be used for the binary code obtained from an adjacency matrix of the triangular graph T(n) for any n ≥ 5.
Abstract: By finding explicit PD-sets we show that permutation decoding can be used for the binary code obtained from an adjacency matrix of the triangular graph T(n) for any n ≥ 5.
51 citations
TL;DR: A robust color image retrieval algorithm based on the hybrid graph representation, i.e., a dual graph which consists of the Modified Color Adjacency Graph (MCAG) and Spatial Variance Graph (SVG), which yields high retrieval performance with tolerable computational complexity is proposed.
50 citations
TL;DR: Efficient polygon amalgamation methods by excluding those internal polygons without retrieving them from the database are investigated, and two novel algorithms, adjacency-based and occupancy-based, are proposed.
Abstract: The polygon amalgamation operation computes the boundary of the union of a set of polygons. This is an important operation for spatial on-line analytical processing and spatial data mining, where polygons representing different spatial objects often need to be amalgamated by varying criteria when the user wants to aggregate or reclassify these objects. The processing cost of this operation can be very high for a large number of polygons. Based on the observation that not all polygons to be amalgamated contribute to the boundary, we investigate in this paper efficient polygon amalgamation methods by excluding those internal polygons without retrieving them from the database. Two novel algorithms, adjacency-based and occupancy-based, are proposed. While both algorithms can reduce the amalgamation cost significantly, the occupancy-based algorithm is particularly attractive because: 1) it retrieves a smaller amount of data than the adjacency-based algorithm; 2) it is based on a simple extension to a commonly used spatial indexing mechanism; and 3) it can handle fuzzy amalgamation.
50 citations
TL;DR: This work describes efficient algorithms for boundary and superimposing two maps encoded as line quadtrees, which facilitate several region processing algorithms.
Abstract: The ``line quadtree'' data structure hierarchically represents a region and its boundary. Based on the standard quadtree, each node in this structure stores adjacency information as well. While line quadtrees use the same amount of space as standard qaudtrees, they facilitate several region processing algorithms. In particular, we describe efficient algorithms for boundary and superimposing two maps encoded as line quadtrees.
50 citations
TL;DR: This research is about determining a solution for dynamic facility layout problem with equal departments by applying data envelopment analysis (DEA) with consideration of some specific criteria which are cost, adjacency, and distance requested.
Abstract: The facility layout problem (FLP) is a well-researched problem of finding positions of departments on a plant floor such that departments do not overlap and some specific critical criteria involved in FLP are optimized. In addition, the facility layout dramatically influences the efficiency of material handling within a manufacturing system. In order to ensure optimal performance within a manufacturing system, the facility layout should reflect changes throughout time. However, the static facility layout problem with constant material flows between departments may not be a realistic scenario because a manufacturing facility is a dynamic system that constantly evolves. On the other hand, layout problem has multi-objective nature, and it is necessary to apply various criteria and goals for determining a good facility layout. As a result, this research is about determining a solution for dynamic facility layout problem (DFLP) with equal departments by applying data envelopment analysis (DEA) with consideration of some specific criteria which are cost, adjacency, and distance requested. Cost as a negative criterion is minimized and used as an input, whereas adjacency and distance requested are considered positive criteria and used as output of DEA model. In the proposed algorithm, at first, the initial layout is generated, and then its neighborhood is created by the pair exchange and reverse strategy. By applying tabu search heuristic using diversification strategy which includes “frequency-based memory,” “penalty function,” and “dynamic tabu list size” to the DEA model, the most desired efficient layout is obtained. Two data sets taken from the relevant literature are used to test and evaluate the performance of the proposed heuristic. Computational experiments show that the proposed heuristic outperforms other heuristics presented in relevant literature, and the most efficient layout is achieved.
50 citations