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: A new hybrid pseudo-CSG/BRep schema for product modelling is described that intends to capture the virtues of both representation schemas and eliminate as much as possible as their underlying drawbacks.
40 citations
TL;DR: In this article, the authors characterize injective continuous maps on the space of real or complex rectangular matrices preserving adjacent pairs of matrices, and extend Hua's fundamental theorem of the geometry of rectangular matrix matrices to the infinite-dimensional case.
Abstract: We characterize injective continuous maps on the space of real or complex rectangular matrices preserving adjacent pairs of matrices. We also extend Hua's fundamental theorem of the geometry of rectangular matrices to the infinite-dimensional case. An application in the theory of local automorphisms is presented.
39 citations
TL;DR: A randomized version of the ILT model is presented that exhibits a tunable densification power-law exponent and maintains several properties of the deterministic model.
Abstract: We present a deterministic model for online social networks (OSNs) based on transitivity and local knowledge in social interactions In the iterated local transitivity (ILT) model, at each time step and for every existing node x, a new node appears that joins to the closed neighbor set of x The ILT model provably satisfies a number of both local and global properties that have been observed in OSNs and other real-world complex networks, such as a densification power law, decreasing average distance, and higher clustering than in random graphs with the same average degree Experimental studies of social networks demonstrate poor expansion properties as a consequence of the existence of communities with low numbers of intercommunity edges Bounds on the spectral gap for both the adjacency and normalized Laplacian matrices are proved for graphs arising from the ILT model indicating such bad expansion properties The cop and domination numbers are shown to remain the same as those of the graph from
39 citations
TL;DR: An automatic system to annotate and retrieve images that assumes that regions in an image can be described using a vocabulary of blobs, and that a structural approach requires a smaller vocabulary size to reach its best performance.
39 citations
Proceedings Article•
09 Aug 2003TL;DR: A sparse representation of the closed list is proposed in which only a fraction of already expanded nodes need to be stored to perform the two functions of the Closed List - preventing duplicate search effort and allowing solution extraction.
Abstract: We describe a framework for reducing the space complexity of graph search algorithms such as A* that use Open and Closed lists to keep track of the frontier and interior nodes of the search space. We propose a sparse representation of the Closed list in which only a fraction of already expanded nodes need to be stored to perform the two functions of the Closed List - preventing duplicate search effort and allowing solution extraction. Our proposal is related to earlier work on search algorithms that do not use a Closed list at all [Korf and Zhang, 2000]. However, the approach we describe has several advantages that make it effective for a wider variety of problems.
39 citations