[책][B] Network analysis: methodological foundations

U Brandes - 2005 - books.google.com
'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …

[책][B] Handbook of graph drawing and visualization

R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

Layout adjustment and the mental map

K Misue, P Eades, W Lai, K Sugiyama - Journal of Visual Languages & …, 1995 - Elsevier
Many models in software and information engineering use graph representations; examples
are data flow diagrams, state transition diagrams, flow charts, PERT charts, organization …

[책][B] Drawing graphs: methods and models

M Kaufmann, D Wagner - 2003 - books.google.com
Graph drawing comprises all aspects of visualizing structural relations between objects. The
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …

A linear time implementation of SPQR-trees

C Gutwenger, P Mutzel - International Symposium on Graph Drawing, 2000 - Springer
The data structure SPQR-tree represents the decomposition of a biconnected graph with
respect to its triconnected components. SPQR-trees have been introduced by Di Battista and …

Drawing planar graphs using the canonical ordering

G Kant - Algorithmica, 1996 - Springer
We introduce a new method to optimize the required area, minimum angle, and number of
bends of planar graph drawings on a grid. The main tool is a new type of ordering on the …

[PDF][PDF] The Open Graph Drawing Framework (OGDF).

M Chimani, C Gutwenger, M Jünger, GW Klau… - Handbook of graph …, 2013 - ogdf.uos.de
We present the Open Graph Drawing Framework (OGDF), a C++ library of algorithms and
data structures for graph drawing. The ultimate goal of the OGDF is to help bridge the gap …

On-line maintenance of triconnected components with SPQR-trees

G Di Battista, R Tamassia - Algorithmica, 1996 - Springer
We 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 …

Quantitative information flow as network flow capacity

S McCamant, MD Ernst - Proceedings of the 29th ACM SIGPLAN …, 2008 - dl.acm.org
We present a new technique for determining how much information about a program's secret
inputs is revealed by its public outputs. In contrast to previous techniques based on …

[PDF][PDF] Dynamic graph algorithms

D Eppstein, Z Galil, GF Italiano - Algorithms and theory of computation …, 1999 - Citeseer
In many applications of graph algorithms, including communication networks, graphics,
assembly planning, and VLSI design, graphs are subject to discrete changes, such as …