1,721,215 research outputs found
The architecture of Diagram Server
No full textA support tool for systems that manage a diagrammatic interface, called the Diagram Server, is discussed. It offers a tailorable interface independent from the system that uses it, and can manage objects through their diagrammatic representations. It supports multiple representations of the same object, and is largely independent from the graphic environment. The architecture of the Diagram Server is described, with an emphasis on the fundamental role played by its automatic layout facility
Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings (Extended Abstract)
No full text) Roberto Tamassia Department of Computer Science Brown University Providence, R.I. 02912--1910 Ioannis G. Tollis Department of Computer Science The University of Texas at Dallas Richardson, Texas 75083--0688 Jeffrey S. Vitter Department of Computer Science Brown University Providence, R.I. 02912--1910 Proc. IEEE Symposium on Parallel and Distributed Processing, 1991 Abstract We consider the problem of constructing a planar orthogonal grid drawing (or more simply, layout) of an n-vertex graph, with the goal of minimizing the number of bends along the edges. We exhibit graphs that require \Omega\Gamma n) bends in any layout, and show that there exist optimal drawings that require \Omega\Gamma n) bends and have all of them on a single edge of length\Omega\Gamma n 2 ). On the other side of the coin, we present a parallel algorithm that runs on a CREW PRAM in O(logn) time with n= log n processors and constructs layouts with O(n) maximum edge length and O(n 2 ) area. For bic..
On-Line Maintenance of Triconnected Components with SPQR-Trees
No full textWe consider the problem of maintaining on-line the triconnected components of a graph G. Let n be the current number of vertices of G. We present an O(n)-space data structure that supports insertions of vertices and edges, and queries of the type “Are there three vertex-disjoint paths between vertices v1 and v2?” A sequence of k operations takes time O(k · α(k, n)) if G is biconnected (α(k, n) denotes the well-known Ackermann’s function inverse), and time O(n log n + k) if G is not biconnected. Note that the bounds do not depend on the number of edges of G. We use the SPQR-tree, a versatile data structure that represents the decomposition of a biconnected graph with respect to its triconnected components, and the BC-tree, which represents the decomposition of a connected graph with respect to its biconnected components
Algorithms for Drawing Graphs: an Annotated Bibliography
No full textAbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate areas
Data structures and algorithms in C++ / Michael T. Goodrich, Roberto Tamassia, David M. Mount.
No full textIncludes bibliographical references and index.Includes bibliographical references and index.xxii, 714 pages :"An updated, innovative approach to data structures and algorithms Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and algorithms in C++. The unparalleled author team incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms. Offers a unique multimedia format for learning the fundamentals of data structures and algorithms Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design Provides clear approaches for developing programs Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms."-
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
