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: The results show that the proposed method outperforms the existing normalized cut based method for small road networks and provides impressive results for much larger networks, where other methods may face serious problems of time and space complexities.
37 citations
TL;DR: The results related to the eccentric-connectivity index, connective eccentricity index, total-eccentricity index and degree distance index of a new graph operation named as “subdivision vertex-edge join” of three graphs are given.
Abstract: The analysis of networks and graphs through topological descriptors carries out a useful role to derive their underlying topologies. This process has been widely used in biomedicine, cheminformatics, and bioinformatics, where assessments based on graph invariants have been made available for effectively communicating with the various challenging schemes. In the studies of quantitative structure-activity relationships (QSARs) and quantitative structure-property relationships (QSPRs), graph invariants are used to approximate the biological activities and properties of chemical compounds. In this paper, we give the results related to the eccentric-connectivity index, connective eccentricity index, total-eccentricity index, average eccentricity index, Zagreb eccentricity indices, eccentric geometric-arithmetic index, eccentric atom-bond connectivity index, eccentric adjacency index, modified eccentric-connectivity index, eccentric distance sum, Wiener index, Harary index, hyper-Wiener index and degree distance index of a new graph operation named as “subdivision vertex-edge join” of three graphs.
37 citations
TL;DR: Experimental results on ORL, AR and CMU PIE face databases validate the superiority of CRLDP over other state-of-the-art algorithms.
37 citations
TL;DR: This work has devised an automated component suggestion algorithm based on a probabilistic factor graph that helps the user to easily browse and select components from a database that are most compatible with the current state of 3D models being assembled.
Abstract: This work presents a novel and intuitive assembly based 3D modeling interface to support conceptual design exploration activities. In the presented modeling interface, unlabeled segmented components of the objects are assembled to create new 3D models. The development of the interface is motivated by two aspects. First, the focus is on novice users since they stand to gain the most from intuitive interfaces. Second, the intent is on creative reuse of a growing number and variety of 3D models available on vast online repositories like Turbosquid and Trimble 3D warehouse. Specifically, we have devised an automated component suggestion algorithm based on a probabilistic factor graph. This algorithm helps the user to easily browse and select components from a database that are most compatible with the current state of 3D models being assembled. The component suggestion algorithm incorporates various aspects such as shape similarity, repetitions of shapes, and adjacency relationships. Our new suggestive interface overcomes several limitations of traditional CAD interfaces by helping the users to quickly create and explore new conceptual designs. We present results on the conceptual design of several products. We present a novel 3D CAD tool for conceptual design exploration.Interactive concept exploration through assembly-based 3D modeling paradigm.Automated component suggestion algorithm based on probabilistic factor graph.Creative reuse of 3D models available on vast online repositories.
36 citations
08 Jun 2009
TL;DR: In this article, the problem of finding an area-universal layout for a given set of adjacency requirements whenever such a layout exists has been studied and a simple necessary and sufficient condition for a rectangular layout to be area universal has been identified.
Abstract: A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. They are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignments. A layout is area-universal if any assignment of areas to rectangles can be realized by a combinatorially equivalent rectangular layout. We identify a simple necessary and sufficient condition for a rectangular layout to be area-universal: a rectangular layout is area-universal if and only if it is one-sided. We also investigate similar questions for perimeter assignments. The adjacency requirements for the rectangles of a rectangular layout can be specified in various ways, most commonly via the dual graph of the layout. We show how to find an area-universal layout for a given set of adjacency requirements whenever such a layout exists.
36 citations