1,721,045 research outputs found
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
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..
Proximity Drawability: A Survey (extended abstract)
No full textIncreasing attention has been given recently to drawings of graphs in which edges connect vertices based on some notion of proximity. Among such drawings are Gabriel, relative neighborhood, Delaunay, sphere of influence, and minimum spanning drawings. This paper attempts to survey the work that has been done to date on proximity drawings, along with some of the problems which remain open in this area
Fast Reachability Using DAG Decomposition
Full text linkWe present a fast and practical algorithm to compute the transitive closure (TC) of a directed graph. It is based on computing a reachability indexing scheme of a directed acyclic graph (DAG), G = (V, E). Given any path/chain decomposition of G we show how to compute in parameterized linear time such a reachability scheme that can answer reachability queries in constant time. The experimental results reveal that our method is significantly faster in practice than the theoretical bounds imply, indicating that path/chain decomposition algorithms can be applied to obtain fast and practical solutions to the transitive closure (TC) problem. Furthermore, we show that the number of non-transitive edges of a DAG G is ≤ width*|V| and that we can find a substantially large subset of the transitive edges of G in linear time using a path/chain decomposition. Our extensive experimental results show the interplay between these concepts in various models of DAGs
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
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
- …
