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
••
18 Dec 2007TL;DR: This work presents a few fundamental algorithms - including breadth first search, single source shortest path, and all-pairs shortest path - using CUDA on large graphs using the G80 line of Nvidia GPUs.
Abstract: Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end computers are reported but are accessible only to a few. Graphics Processing Units (GPUs) of today have high computation power and low price. They have a restrictive programming model and are tricky to use. The G80 line of Nvidia GPUs can be treated as a SIMD processor array using the CUDA programming model. We present a few fundamental algorithms - including breadth first search, single source shortest path, and all-pairs shortest path - using CUDA on large graphs. We can compute the single source shortest path on a 10 million vertex graph in 1.5 seconds using the Nvidia 8800GTX GPU costing $600. In some cases optimal sequential algorithm is not the fastest on the GPU architecture. GPUs have great potential as high-performance co-processors.
763 citations
••
TL;DR: The development of the concept attributed adjacency graph (AAG) for the recognition of machined features from a 3D boundary representation of a solid is presented.
Abstract: The internal representation of the solid modeller provides a description of parts which when used directly is useful for automation of the process planning function. So that the CAD model can be used to provide the information required for manufacturing, techniques to improve machine understanding of the part as required for manufacturing are needed. This paper presents the development of the concept attributed adjacency graph (AAG) for the recognition of machined features from a 3D boundary representation of a solid. Current implementation of the feature recogniser is limited to polyhedral features such as pockets, slots, steps, blind steps, blind slots, and polyhedral holes. Sample results that show the capabilities of the system are presented.
720 citations
••
TL;DR: For almost all graphs the answer to the question in the title is still unknown as mentioned in this paper, and the cases for which the answer is known are surveyed in the survey of cases where the Laplacian matrix is known.
605 citations
•
21 Jun 2010TL;DR: This paper addresses the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud via a unique idea called AnchorGraph which provides nonnegative adjacency matrices to guarantee positive semidefinite graph Laplacians.
Abstract: In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Critically, these anchor points enable nonparametric regression that predicts the label for each data point as a locally weighted average of the labels on anchor points. Because conventional graph construction is inefficient in large scale, we propose to construct a tractable large graph by coupling anchor-based label prediction and adjacency matrix design. Contrary to the Nystrom approximation of adjacency matrices which results in indefinite graph Laplacians and in turn leads to potential non-convex optimization over graphs, the proposed graph construction approach based on a unique idea called AnchorGraph provides nonnegative adjacency matrices to guarantee positive semidefinite graph Laplacians. Our approach scales linearly with the data size and in practice usually produces a large sparse graph. Experiments on large datasets demonstrate the significant accuracy improvement and scalability of the proposed approach.
542 citations
••
29 Jul 2013TL;DR: This paper describes the implementation of GPS and its novel features, and presents experimental results on the performance effects of both static and dynamic graph partitioning schemes, and describes the compilation of a high-level domain-specific programming language to GPS, enabling easy expression of complex algorithms.
Abstract: GPS (for Graph Processing System) is a complete open-source system we developed for scalable, fault-tolerant, and easy-to-program execution of algorithms on extremely large graphs. This paper serves the dual role of describing the GPS system, and presenting techniques and experimental results for graph partitioning in distributed graph-processing systems like GPS. GPS is similar to Google's proprietary Pregel system, with three new features: (1) an extended API to make global computations more easily expressed and more efficient; (2) a dynamic repartitioning scheme that reassigns vertices to different workers during the computation, based on messaging patterns; and (3) an optimization that distributes adjacency lists of high-degree vertices across all compute nodes to improve performance. In addition to presenting the implementation of GPS and its novel features, we also present experimental results on the performance effects of both static and dynamic graph partitioning schemes, and we describe the compilation of a high-level domain-specific programming language to GPS, enabling easy expression of complex algorithms.
541 citations