Relevant bibliographies by topics / Graph drawing / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Graph drawing.

Dissertations / Theses on the topic 'Graph drawing'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Graph drawing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Suderman, Matthew. "Layered graph drawing." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86054.

Full text
Abstract:
A layered graph drawing is a two-dimensional drawing of a combinatorial graph in which the vertices lie on a given set of horizontal lines. Such drawings are used in application domains such as software engineering, bioinformatics, and VLSI design. In addition to being layered, drawings in these applications may also satisfy other constraints, for example bounds on the number of edge crossings. The problems related to obtaining these drawings are almost always NP -hard, so, in this thesis, we investigate restricted versions of these problems in order to find efficient algorithmic soluti
APA, Harvard, Vancouver, ISO, and other styles
2

Puppe, Thomas. "Spectral graph drawing." [S.l. : s.n.], 2005. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11759114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schulz, Michael. "Simultaneous graph drawing." Tönning Marburg Lübeck Der Andere Verl, 2008. http://d-nb.info/992494834/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aspegren, Villiam. "CluStic – Automatic graph drawing with clusters." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Full text
Abstract:
Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been barely explored however, is that users would like to specify portions of their layouts that are not altered by such algorithms. For example the user may have put a lot of manual effort into fixing a portion of a large layout and, while they would like an automatic layout applied to most of the layout, they do not want their work undone on the portion they manually fixed earlier. CluStic, the system developed and evaluated in this thesis, provides this capabili
APA, Harvard, Vancouver, ISO, and other styles
5

Pampel, Barbara [Verfasser]. "Constrained Graph Drawing / Barbara Pampel." Konstanz : Bibliothek der Universität Konstanz, 2012. http://d-nb.info/1024457656/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

He, Dayu. "Algorithms for Graph Drawing Problems." Thesis, State University of New York at Buffalo, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10284151.

Full text
Abstract:
<p> A graph G is called <i>planar</i> if it can be drawn on the plan such that no two distinct edges intersect each other but at common endpoints. Such drawing is called a plane embedding of <i>G.</i> A plane graph is a graph with a fixed embedding. A straight-line drawing <i>G</i> of a graph <i>G</i> = (<i>V, E</i>) is a drawing where each vertex of <i>V</i> is drawn as a distinct point on the plane and each edge of <i>G</i> is drawn as a line segment connecting two end vertices. In this thesis, we study a set of planar graph drawing problems. </p><p> First, we consider the problem of <i>mo
APA, Harvard, Vancouver, ISO, and other styles
7

Lauw, Madelaine L. "TiddlyGraph : graph drawing tool for TiddlyWiki /." Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Lauw.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Newton, Matthew. "Sequential and parallel algorithms for low-crossing graph drawing." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/12944.

Full text
Abstract:
The one- and two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on parallel imaginary lines, that has the minimum number of edge-crossings. Vertices of one part are in fixed positions for the one-sided problem, whereas all vertices are free to move along their lines in the two-sided version. Many different heuristics exist for finding approximations to these problems, which are NP-hard. New sequential and parallel methods for producing drawings with low edgecrossings are investigated and compared to existing algorithms, n
APA, Harvard, Vancouver, ISO, and other styles
9

Cornelsen, Sabine. "Drawing families of cuts in a graph." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=967110165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Klein, Karsten [Verfasser]. "Interactive graph drawing with constraints / Karsten Klein." Dortmund : Universitätsbibliothek Technische Universität Dortmund, 2011. http://d-nb.info/1011569876/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

陳建銘 and Kin-ming Chan. "Using graph drawing techniques to visualise software." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B31212086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Baker, Robert. "A method for graph drawing utilising patterns." Thesis, University of Kent, 2017. https://kar.kent.ac.uk/63895/.

Full text
Abstract:
This thesis describes a novel method for the layout of undirected graphs. It works by identifying certain patterns within the graph and drawing these in a consistent manner. For graphs to be useful and of benefit to a user, the result must clear and easy to understand. This process attempts to draw graphs in such a manner. Firstly, a background of graph problems and graph drawing is introduced, before the benefits of patterns are explained. Following this, there is an in-depth discussion of a number of existing graph drawing techniques, perceptual theories and methods for subgraph isomorphism.
APA, Harvard, Vancouver, ISO, and other styles
13

Chan, Kin-ming. "Using graph drawing techniques to visualise software /." [Hong Kong] : University of Hong Kong, 1995. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1479634X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Klemz, Boris [Verfasser]. "Facets of Planar Graph Drawing / Boris Klemz." Berlin : Freie Universität Berlin, 2020. http://d-nb.info/1221130323/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

JAIN, RACHANA. "IMPROVED TECHNIQUES IN GRAPH DRAWING USING FORCE DIRECTED METHODS FOR MODERATE SIZE GRAPHS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1081543392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Archambault, Daniel William. "Feature-based graph visualization." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/2839.

Full text
Abstract:
A graph consists of a set and a binary relation on that set. Each element of the set is a node of the graph, while each element of the binary relation is an edge of the graph that encodes a relationship between two nodes. Graph are pervasive in many areas of science, engineering, and the social sciences: servers on the Internet are connected, proteins interact in large biological systems, social networks encode the relationships between people, and functions call each other in a program. In these domains, the graphs can become very large, consisting of hundreds of thousands of nodes and millio
APA, Harvard, Vancouver, ISO, and other styles
17

Ma, Wenbin. "GDC, a graph drawing application with clustering techniques." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ60460.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Förster, Henry [Verfasser]. "Graph Drawing Beyond the Beaten Tracks / Henry Förster." Tübingen : Universitätsbibliothek Tübingen, 2020. http://d-nb.info/1220689629/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Kim, Dong Hyun. "Three-dimensional orthogonal graph drawing with direction constrained edges." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18469.

Full text
Abstract:
Graph drawing studies the problem of producing layouts of relational structures that can be represented by combinatorial graphs. An orthogonal drawing is one whose edges are drawn as polygonal lines, with constituent segments drawn parallel to the coordinate axes. Orthogonal drawings arise in applications in diverse fields such as information visualization and VLSI circuit layout. One of the most successful methodologies for generating 2D orthogonal layouts of graphs is the so-called Topology-Shape-Metrics approach, where the task of defining the combinatorial shape of the drawing is separated
APA, Harvard, Vancouver, ISO, and other styles
20

Mondal, Debajyoti. "Visualizing graphs: optimization and trade-offs." CCCG, 2014. http://hdl.handle.net/1993/31673.

Full text
Abstract:
Effective visualization of graphs is a powerful tool to help understand the relationships among the graph's underlying objects and to interact with them. Several styles for drawing graphs have emerged over the last three decades. Polyline drawing is a widely used style for drawing graphs, where each node is mapped to a distinct point in the plane and each edge is mapped to a polygonal chain between their corresponding nodes. Some common optimization criteria for such a drawing are defined in terms of area requirement, number of bends per edge, angular resolution, number of distinct line seg
APA, Harvard, Vancouver, ISO, and other styles
21

Behzadi, Lila. "An improved spring-based graph embedding algorithm and LayoutShow, a Java environment for graph drawing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq43368.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Wu, Yingxin. "Hybrid multivariate network visualization combining dimensional projection and graph drawing." Thesis, The University of Sydney, 2008. https://hdl.handle.net/2123/28136.

Full text
Abstract:
The goal of information visualization is to transform abstract data into efficient visual format which help humans extract useful information from the data collected. Two distinctive types of data are of particular interest to the information visualization community: one is multidimensional data in which each data point/entity is described by various attributes. The other is relational data which represent the interaction between the entities. These two types of data are common in the real world but difficult for people to understand. Many visualization approaches have been developed to h
APA, Harvard, Vancouver, ISO, and other styles
23

MONDAL, DEBAJYOTI. "Embedding a Planar Graph on a Given Point Set." Springer-Verlag Berlin, 2012. http://hdl.handle.net/1993/8869.

Full text
Abstract:
A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G, where each vertex of G is mapped to a distinct point of S. We prove that the point-set embeddability problem is NP-complete for 3-connected planar graphs, answering a question of Cabello [20]. We give an O(nlog^3n)-time algorithm for testing point-set embeddability of plane 3-trees, improving the algorithm of Moosa and Rahman [60]. We prove that no set of 24 points can support all planar 3-trees with 24 vertices, partially answering a question of Kobourov [55]. We compute 2-
APA, Harvard, Vancouver, ISO, and other styles
24

Klimenta, Mirza [Verfasser]. "Extending the Usability of Multidimensional Scaling for Graph Drawing / Mirza Klimenta." Konstanz : Bibliothek der Universität Konstanz, 2012. http://d-nb.info/1030479127/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Ismaeel, Alaa Aly Khalaf [Verfasser], and H. [Akademischer Betreuer] Schmeck. "Dynamic Hierarchical Graph Drawing / Alaa Aly Khalaf Ismaeel. Betreuer: H. Schmeck." Karlsruhe : KIT-Bibliothek, 2012. http://d-nb.info/1023081776/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Krug, Robert [Verfasser], and Michael [Akademischer Betreuer] Kaufmann. "New Approaches on Octilinear Graph Drawing / Robert Krug ; Betreuer: Michael Kaufmann." Tübingen : Universitätsbibliothek Tübingen, 2015. http://d-nb.info/1163396907/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Revoori, Soundarya. "Computing the Rectilinear Crossing Number of K." Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6936.

Full text
Abstract:
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all straight line edges. The problem of drawing an n-vertex complete graph such that its rectilinear crossing number is minimum is known to be an NP-Hard problem. In this thesis, we present a heuristic that attempts to achieve the theoretical lower bound value of the rectilinear crossing number of a n+1 vertex complete graph from that of n vertices. Our algorithm accepts an optimal or near-optimal rectilinear drawing of Kn graph as input and tries to place a new node such that the
APA, Harvard, Vancouver, ISO, and other styles
28

Jezný, Lukáš. "Automatické rozvržení diagramů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-412807.

Full text
Abstract:
Automatic layouts for diagram drawing is described in this paper. Major methods, algorithms, metrics for automatic layouts are introduced in theretical part. Practical part of this work was developing algorithms for automatic layouts of organizational structures and business process model diagrams.
APA, Harvard, Vancouver, ISO, and other styles
29

Meidiana, Amyra. "Sublinear-time Algorithms and Faithfulness Metrics for Big Complex Graph Visualisation." Thesis, The University of Sydney, 2022. https://hdl.handle.net/2123/27429.

Full text
Abstract:
With the continuing ability to gather and store increasingly larger amounts of data, so has grown the size of network data being collected. The networks, which can be represented as graphs, are not only big in scale, but also complex, introducing issues of scalability and complexity in visualising and analysing them. With the rate of growth in the size of these graphs, traditional graph drawing algorithms have failed to scale when visualising big, complex graphs. Furthermore, evaluation of graph drawing algorithms is important to ensure that the algorithms are not only efficient, but also effe
APA, Harvard, Vancouver, ISO, and other styles
30

Kindermann, Philipp [Verfasser], Alexander [Gutachter] Wolff, and André [Gutachter] Schulz. "Angular Schematization in Graph Drawing / Philipp Kindermann. Gutachter: Alexander Wolff ; André Schulz." Würzburg : Würzburg University Press, 2015. http://d-nb.info/1111783756/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Tsuchida, Kensei. "The complexity and algorithms of graph drawing = Gurafu byōga no keisanryō to arugorizumu /." Electronic version of summary, 1994. http://www.wul.waseda.ac.jp/gakui/gaiyo/2089.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Radermacher, Marcel [Verfasser], and D. [Akademischer Betreuer] Wagner. "Geometric Graph Drawing Algorithms - Theory, Engineering and Experiments / Marcel Radermacher ; Betreuer: D. Wagner." Karlsruhe : KIT-Bibliothek, 2020. http://d-nb.info/1206646632/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Pennarun, Claire. "Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0609/document.

Full text
Abstract:
Dans cette thèse, nous présentons trois problèmes concernant les graphes planaires.Nous travaillons tout d'abord sur les dessins planaires non-alignés, c'est-à-dire des dessins planaires de graphes sur une grille sans que deux sommets se trouvent sur la même ligne ou la même colonne.Nous caractérisons les graphes planaires possédant un tel dessin sur une grille de taille $n times n$, et nous présentons deux algorithmes générant un dessin planaire non-aligné avec arêtes brisées sur cette grille pour tout graphe planaire, avec $n-3$ ou $min(frac{2n-3}{5},$ $#{text{triangles s{'e}parateurs}}+1)$
APA, Harvard, Vancouver, ISO, and other styles
34

Fink, Martin [Verfasser], Alexander Gutachter] Wolff, and Michael [Gutachter] [Kaufmann. "Crossings, Curves, and Constraints in Graph Drawing / Martin Fink. Gutachter: Alexander Wolff ; Michael Kaufmann." Würzburg : Würzburg University Press, 2014. http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-98235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Fink, Martin Verfasser], Alexander [Gutachter] Wolff, and Michael [Gutachter] [Kaufmann. "Crossings, Curves, and Constraints in Graph Drawing / Martin Fink. Gutachter: Alexander Wolff ; Michael Kaufmann." Würzburg : Würzburg University Press, 2014. http://d-nb.info/1111508038/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Hinge, Antoine. "Dessin de graphe distribué par modèle de force : application au Big Data." Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0092/document.

Full text
Abstract:
Les graphes, outil mathématique pour modéliser les relations entre des entités, sont en augmentation constante du fait d'internet (par exemple les réseaux sociaux). La visualisation de graphe (aussi appelée dessin) permet d'obtenir immédiatement des informations sur le graphe. Les graphes issus d'internet sont généralement stockés de manière morcelée sur plusieurs machines connectées par un réseau. Cette thèse a pour but de développer des algorithmes de dessin de très grand graphes dans le paradigme MapReduce, utilisé pour le calcul sur cluster. Parmi les algorithmes de dessin, les algorithmes
APA, Harvard, Vancouver, ISO, and other styles
37

Gaconnet, Christopher James. "Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language." Thesis, University of North Texas, 2009. https://digital.library.unt.edu/ark:/67531/metadc12125/.

Full text
Abstract:
Non-strict pure functional programming often requires redesigning algorithms and data structures to work more effectively under new constraints of non-strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in the non-strict pure functional programming model. Additionally, there is currently no freely licensed standalone toolkit used to quantitatively analyze aesthetics of graph drawings. This thesis addresses two previously unexplored questions. Can a force-directed graph drawing algorithm be implemented in a non-strict functional
APA, Harvard, Vancouver, ISO, and other styles
38

Winkelmolen, Guus. "Improving The Visualization And Animation Of Weighted Dynamic Networks Using Force-Directed Graph Drawing Algorithms." Thesis, Linköpings universitet, Institutet för analytisk sociologi, IAS, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-178699.

Full text
Abstract:
The visualization of networks as graphs composed of nodes and vertices benefits many fields of science including social network analysis. The use case of visualizations is twofold. Firstly, easy initial visualization of networks will help researchers find and specify their hypotheses before having to do any technical analysis. Secondly, once hypotheses are con confirmed, visualizations can be used to support these findings, making it possible to explain them to a broad audience. This thesis will expand upon the tools currently available for visualizing undirected graphs in two ways. Modern for
APA, Harvard, Vancouver, ISO, and other styles
39

Gaconnet, Christopher James Tarau Paul. "Force-directed graph drawing and aesthetics measurement in a non-strict pure functional programming language." [Denton, Tex.] : University of North Texas, 2009. http://digital.library.unt.edu/ark:/67531/metadc12125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Heinsohn, Niklas [Verfasser], and Michael [Akademischer Betreuer] Kaufmann. "Ply and Bar Visibility - Some Advanced Concepts in Graph Drawing / Niklas Heinsohn ; Betreuer: Michael Kaufmann." Tübingen : Universitätsbibliothek Tübingen, 2020. http://d-nb.info/1210484250/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Fowler, Joe. "Unlabled Level Planarity." Diss., The University of Arizona, 2009. http://hdl.handle.net/10150/195812.

Full text
Abstract:
Consider a graph G with vertex set V in which each of the n vertices is assigned a number from the set {1, ..., k} for some positive integer k. This assignment phi is a labeling if all k numbers are used. If phi does not assign adjacent vertices the same label, then phi partitions V into k levels. In a level drawing, the y-coordinate of each vertex matches its label and the edges are drawn strictly y-monotone. This leads to level drawings in the xy-plane where all vertices with label j lie along the line lj = {(x, j) : x in Reals} and where each edge crosses any of the k horizontal lines lj
APA, Harvard, Vancouver, ISO, and other styles
42

Chan, Hubert. "A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1090.

Full text
Abstract:
We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point on the plane, and each edge is represented by a curve that connects its two endpoints. Directed graphs are often used to model hierarchical structures; in order to visualize the hierarchy represented by such a graph, it is desirable that a drawing of the graph reflects this hierarchy. This can be achieved by drawing all the edges in the graph such that they all point in an upwards direction. A graph t
APA, Harvard, Vancouver, ISO, and other styles
43

Do, Nascimento Hugo Alexandre Dantas. "User hints for optimisation processes." Thesis, The University of Sydney, 2003. http://hdl.handle.net/2123/591.

Full text
Abstract:
Innovative improvements in the area of Human-Computer Interaction and User Interfaces have en-abled intuitive and effective applications for a variety of problems. On the other hand, there has also been the realization that several real-world optimization problems still cannot be totally auto-mated. Very often, user interaction is necessary for refining the optimization problem, managing the computational resources available, or validating or adjusting a computer-generated solution. This thesis investigates how humans can help optimization methods to solve such difficult prob-lems. It pr
APA, Harvard, Vancouver, ISO, and other styles
44

Do, Nascimento Hugo Alexandre Dantas. "User hints for optimisation processes." University of Sydney. Information Technologies, 2003. http://hdl.handle.net/2123/591.

Full text
Abstract:
Innovative improvements in the area of Human-Computer Interaction and User Interfaces have en-abled intuitive and effective applications for a variety of problems. On the other hand, there has also been the realization that several real-world optimization problems still cannot be totally auto-mated. Very often, user interaction is necessary for refining the optimization problem, managing the computational resources available, or validating or adjusting a computer-generated solution. This thesis investigates how humans can help optimization methods to solve such difficult prob-lems. It pr
APA, Harvard, Vancouver, ISO, and other styles
45

Renata, Vaderna. "Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2018. https://www.cris.uns.ac.rs/record.jsf?recordId=107524&source=NDLTD&language=en.

Full text
Abstract:
U sklopu doktorske disertacije izvršeno je istraživanje vezano za automatskoraspoređivanje elemenata dijagrama. Kroz analizu postojećih rešenja uočen jeprostor za poboljšanja, posebno po pitanju raznovrsnosti dostupnih algoritamai pomoći korisniku pri izboru najpogodnijeg od njih. U okviru istraživanjaproučavan, implementiran i u pojedinim slučajevima unapređen je širokspektar algoritama za crtanje i analizu grafova. Definisan je postupakautomatskog izbora odgovarajućeg algoritma za raspoređivanje elemenatagrafova na osnovu njihovih osobina. Dodatno, osmišljen je jezik specifičan zadomen koji
APA, Harvard, Vancouver, ISO, and other styles
46

Gronemann, Martin [Verfasser], Michael [Akademischer Betreuer] Jünger, Markus [Akademischer Betreuer] Chimani, and Bettina [Akademischer Betreuer] Speckmann. "Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings / Martin Gronemann. Gutachter: Michael Jünger ; Markus Chimani ; Bettina Speckmann." Köln : Universitäts- und Stadtbibliothek Köln, 2015. http://d-nb.info/1076864759/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Köstinger, Harald. "ViNCent – Visualization of NetworkCentralities." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-10793.

Full text
Abstract:
In the area of information visualization social or biological networks are visualized ina way so that they can be explored easily and one can get more information about thestructure of the network out of it. The use of network centralities in the field of network analysis plays an importantrole when it comes to the rating of the relative importance of vertices within the networkstructure based on the neighborhood of them. Such a single network can be renderedeasily by the use of standard graph drawing algorithms. But it is not only the explorationof one centrality which is important. Furthermo
APA, Harvard, Vancouver, ISO, and other styles
48

Bharadwaj, Aditya. "Mixed-Initiative Methods for Following Design Guidelines in Creative Tasks." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/99857.

Full text
Abstract:
Practitioners in creative domains such as web design, data visualization, and software development face many challenges while trying to create novel solutions that satisfy the guidelines around practical constraints and quality considerations. My dissertation work addresses two of these challenges. First, guidelines may conflict with each other, creating a need for slow and time-consuming expert intervention. Second, guidelines may be hard to check programmatically, requiring experts to manually use multipage style guides that suffer from drawbacks related to searchability, navigation, conflic
APA, Harvard, Vancouver, ISO, and other styles
49

Assunção, Guilherme Puglia. "Representações retangulares de grafos planares." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-07052012-164622/.

Full text
Abstract:
Uma representação retangular de um grafo plano G é uma representação de G, onde cada vértice é desenhado como um retângulo de modo que dois retângulos devem compartilhar algum segmento de seus lados se e somente se existe uma aresta em G entre os vértices correspondentes aos retângulos. Ainda, a representação de G deve formar um retângulo e não deve existir buracos, ou seja, toda região interna deve corresponder a algum vértice de G. Um desenho retangular de um grafo plano H é um desenho de H, onde todas as arestas são desenhadas como segmentos horizontais ou verticais. Ainda, todas as
APA, Harvard, Vancouver, ISO, and other styles
50

af, Sandeberg Joakim. "Graphical system visualization and flow display : A visual representation of an authentication, authorization, and accounting backend." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-190007.

Full text
Abstract:
Displaying the architecture of a software system is not a simple task. Showing all of the available information will unnecessarily complicate the view, while showing too little might render the view unhelpful. Furthermore, showing the dynamics of the operation of such a system is even more challenging. This thesis project describes the development of a graphical tool that can both display the configuration of an advanced authentication, authorization, and accounting (AAA) system and the messages passed between nodes in the system.  The solution described uses force-based graph layouts coupled
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Graph drawing' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography