Results 1  10
of
70
Advances in the Theory and Practice of Graph Drawing
 THEOR. COMP. SCI
, 1996
"... The visualization of conceptual structures is a key component of support tools for complex applications in science and engineering. Foremost among the visual representations used are drawings of graphs and ordered sets. In this talk, we survey recent advances in the theory and practice of graph d ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The visualization of conceptual structures is a key component of support tools for complex applications in science and engineering. Foremost among the visual representations used are drawings of graphs and ordered sets. In this talk, we survey recent advances in the theory and practice of graph
Drawing graphs by eigenvectors: Theory and practice
 Computers and Mathematics with Applications
, 2005
"... Abstract. The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
Abstract. The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for ForceDirected, Spectral, and Circle Packing Drawings
, 2015
"... Many wellknown graph drawing techniques, including forcedirected drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than con ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Many wellknown graph drawing techniques, including forcedirected drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than
Graph drawing beyond planarity: some results and open problems
"... Abstract. We briefly review some recent findings and outline some emerging research directions about the theory of “nearly planar ” graphs, i.e. graphs that have drawings where some crossing configurations are forbidden. 1 Graph drawing beyond planarity Recent technological advances have generated t ..."
Abstract
 Add to MetaCart
Abstract. We briefly review some recent findings and outline some emerging research directions about the theory of “nearly planar ” graphs, i.e. graphs that have drawings where some crossing configurations are forbidden. 1 Graph drawing beyond planarity Recent technological advances have generated
Geometric Automorphism Groups of Graphs
, 2006
"... Constructing symmetric drawings of graphs is NPhard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an ngeometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Constructing symmetric drawings of graphs is NPhard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an ngeometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
graph theory, a mathematical discipline widely used in economic sociology. 2 Graph theory provides us with tools for describing networks at a "macro" level and for measuring the relative importance, or "centrality," of each actor in the network. Our centrality measures capture five
On the crossing number of almost planar graphs
 IN PROC. GD ’05, VOLUME 4372 OF LNCS
, 2006
"... Crossing minimization is one of the most challenging algorithmic problems in topological graph theory, with strong ties to graph drawing applications. Despite a long history of intensive research, no practical “good” algorithm for crossing minimization is known (that is hardly surprising, since the ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Crossing minimization is one of the most challenging algorithmic problems in topological graph theory, with strong ties to graph drawing applications. Despite a long history of intensive research, no practical “good” algorithm for crossing minimization is known (that is hardly surprising, since
Algorithms, Theory
"... In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [12] that one can find asymptotically optimal separators on these graphs if he is given both the graph and an embed ..."
Abstract
 Add to MetaCart
of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces.
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
 in Proceedings of the thirtysixth annual ACM symposium on Theory of computing, ACM
, 2004
"... Abstract. In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [13] that one can find asymptotically optimal separators on these graphs if he is given both the graph an ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces. 1. Introduction. Spectral
SIGNED GRAPH EMBEDDING: WHEN EVERYBODY CAN SIT CLOSER TO FRIENDS THAN ENEMIES∗
"... Abstract. Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions, recent empirical studies have proved that they fai ..."
Abstract
 Add to MetaCart
that they fail to reflect some current practices in real social networks. In this paper we address the issue of drawing signed graphs and capturing such social interactions. We relax the previous assumptions to define a drawing as a model in which every vertex has to be placed closer to its neighbors connected
Results 1  10
of
70