Log in

Relevant bibliographies by topics / Directed graph / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Directed graph.

Dissertations / Theses on the topic 'Directed graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 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 'Directed graph.'

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

Myers, Joseph Samuel. "Extremal theory of graph minors and directed graphs." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Boore, Graeme C. "Directed graph iterated function systems." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/2109.

Full text

Abstract:

This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of standard (1-vertex directed graph) IFSs, with or without separation conditions. We also calculate their exact Hausdorff measure. Thus we are able to identify a new class of attractors for which the exact Hausdorff measure is known. We give a constructive algorithm for calculating the set of gap lengths of any attractor

APA, Harvard, Vancouver, ISO, and other styles

3

Cole, Julian. "Graph directed self-conformal multifractals." Thesis, University of St Andrews, 1999. http://hdl.handle.net/10023/13903.

Full text

Abstract:

In this thesis we study the multifractal structure of graph directed self-conformal measures. We begin by introducing a number of notions from geometric measure theory. In particular, several notions of dimension, graph directed iterated function schemes, and the thermodynamic formalism. We then give an historical introduction to multifractal analysis. Finally, we develop our own contribution to multifractal analysis. Our own contribution to multifractal analysis can be broken into three parts; the proof of two multifractal density theorems, the calculation of the multifractal spectrum of self

APA, Harvard, Vancouver, ISO, and other styles

4

Brownlee, Erin Ann. "Maximally Edge-Colored Directed Graph Algebras." Thesis, North Dakota State University, 2017. https://hdl.handle.net/10365/28666.

Full text

Abstract:

Graph C*-algebras are constructed using projections corresponding to the vertices of the graph, and partial isometries corresponding to the edges of the graph. Here, we use the gauge-invariant uniqueness theorem to first establish that the C*-algebra of a graph composed of a directed cycle with finitely many edges emitting away from that cycle is Mn+k(C(T)), where n is the length of the cycle and k is the number of edges emitting away. We use this result to establish the main results of the thesis, which pertain to maximally edge-colored directed graphs. We show that the C*-algebra of any fini

APA, Harvard, Vancouver, ISO, and other styles

5

Sun, Jiankai. "Directed Graph Analysis: Algorithms and Applications." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1565797455907422.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ghenciu, Eugen Andrei. "Dimension spectrum and graph directed Markov systems." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5226/.

Full text

Abstract:

In this dissertation we study graph directed Markov systems (GDMS) and limit sets associated with these systems. Given a GDMS S, by the Hausdorff dimension spectrum of S we mean the set of all positive real numbers which are the Hausdorff dimension of the limit set generated by a subsystem of S. We say that S has full Hausdorff dimension spectrum (full HD spectrum), if the dimension spectrum is the interval [0, h], where h is the Hausdorff dimension of the limit set of S. We give necessary conditions for a finitely primitive conformal GDMS to have full HD spectrum. A GDMS is said to be regular

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

Tang, Yin Ping Wendy. "Bandwidth of some classes of full directed trees." HKBU Institutional Repository, 1998. http://repository.hkbu.edu.hk/etd_ra/256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Palmer, Claire. "Creating signed directed graph models for process plants." Thesis, Loughborough University, 1999. https://dspace.lboro.ac.uk/2134/7081.

Full text

Abstract:

The identification of possible hazards in chemical plants is a very important part of the design process. This is because of the potential danger that large chemical installations pose to the public. One possible route for speeding up the identification of hazards in chemical plants is to use computers to identify hazards automatically. This will facilitate safe plant design and will avoid late design changes which can be very costly to implement. Previous research at Loughborough has concentrated on developing a model-based approach and an analysis algorithm for automating hazard identificati

APA, Harvard, Vancouver, ISO, and other styles

10

Prego, Lilach. "Algorithm for directed graph clustering, based on edge weights and the implementation on web graphs /." [S.l.] : [s.n.], 2005. http://lib.haifa.ac.il/theses/general/001344252.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Jahanbakht, Nafiseh, and University of Lethbridge Faculty of Arts and Science. "Energy of graphs and digraphs." Thesis, Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2010, 2010. http://hdl.handle.net/10133/2489.

Full text

Abstract:

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find

APA, Harvard, Vancouver, ISO, and other styles

12

Slade, Michael L. "A layout algorithm for hierarchical graphs with constraints /." Online version of thesis, 1994. http://hdl.handle.net/1850/11724.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Pearce, David James. "Some directed graph algorithms and their application to pointer analysis." Thesis, Imperial College London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417921.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Lu, Jia Wei. "Clustering-based force-directed algorithms for three-dimensional graph visualization." Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950626.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

16

Tamburini, Caterina. "The isomorphism problem for directed acyclic graphs: an application to multivector fields." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/15793/.

Full text

Abstract:

This thesis is based on a project developed by a group of researchers at the Faculty of Mathematics and Computer Science at the Jagiellonian University of Krakow. They study sampled dynamics using combinatorial multivector fields. Applying a decomposition into strongly connected components, it is possible to create a directed acyclic graph, called Morse graph, which is a description of the multivector field's global dynamics. Therefore the purpose of this thesis is to compare directed acyclic graphs. In the first chapter we describe the creation process of a Morse graph and an algorithm to stu

APA, Harvard, Vancouver, ISO, and other styles

17

Sariaydin, Ayse. "Computation And Analysis Of Spectra Of Large Networks With Directed Graphs." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612249/index.pdf.

Full text

Abstract:

Analysis of large networks in biology, science, technology and social systems have become very popular recently. These networks are mathematically represented as graphs. The task is then to extract relevant qualitative information about the empirical networks from the analysis of these graphs. It was found that a graph can be conveniently represented by the spectrum of a suitable difference operator, the normalized graph Laplacian, which underlies diffusions and random walks on graphs. When applied to large networks, this requires computation of the spectrum of large matrices. The normalized

APA, Harvard, Vancouver, ISO, and other styles

18

Williams, Aaron. "Packing Directed Joins." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1024.

Full text

Abstract:

Edmonds and Giles conjectured that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture (which is still open). Schrijver found the first known counterexample to the Edmonds-Giles Conjecture, while Cornuejols and Guenin found the next two. In this thesis we introduce new counterexamples, and prove that all minimal counterexamples of a certain type have now been found.

APA, Harvard, Vancouver, ISO, and other styles

19

Ortega, Mattsson Alvaro. "Comparing the Readability of the Force-Directed and Orthogonal Graph Layout." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-282899.

Full text

Abstract:

The readability of a graph layout is defined as the efficiency of finding information on that graph, and is measured as the completion time and correctness when performing a task with that layout. Hence, the more readable a layout is, the more efficient a user becomes. As many application areas, such as fraud detection and cyber security uses graph visualizations, it has become essential that visualization designers should judge graph layouts by their readability instead of their aesthetic appeal in order to achieve maximum efficiency. In this study the readability of two well known graph layo

APA, Harvard, Vancouver, ISO, and other styles

20

Misra, Supratik Kumar. "Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers." Thesis, Virginia Tech, 2012. http://hdl.handle.net/10919/31153.

Full text

Abstract:

Continuous advances in VLSI technology have led to more complex digital designs and shrinking transistor sizes. Due to these developments, design verification and manufacturing test have gained more importance and 70 % of the design expenditure in on validation processes. Electronic Design Automation (EDA) tools play a huge role in the validation process with various verification and test tools. Their efficiency have a high impact in saving time and money in this competitive market. Direct Acyclic Graphs (DAGs) are the backbone for most of the EDA tools. DAG is the most efficient data structur

APA, Harvard, Vancouver, ISO, and other styles

21

Myung, Young-soo. "Valid Inequalities and Facets for the Steinger Problem in a Directed Graph." Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5223.

Full text

Abstract:

In this paper, we describe the facial structure of the steiner problem in a directed graph by formulating it as a set covering problem. We first characterize trivial facets and derive a necessary condition for nontrivial facets. We also introduce a class of valid inequalities with 0-1 coefficients and show when such inequalities define facets.

APA, Harvard, Vancouver, ISO, and other styles

22

Cuevas, Penelope H. (Penelope Huggins). "Visualizing the conversation pathways of telephone linked care in a directed graph." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54458.

Full text

Abstract:

Thesis (S.M.)--Harvard-MIT Division of Health Sciences and Technology, 2009.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 12).<br>Telephone linked care (TLC) is a telehealth intervention that has been shown to be effective in a variety of clinical settings. TLC is an interactive computerized telephone system. The system 'speaks' to patients, asking them questions and understanding their responses. There is logic built into the calls, so that a patient's response to a question will dictate the next question that is asked. This serves to personalize the cal

APA, Harvard, Vancouver, ISO, and other styles

23

Bi, Wenyi. "Knowledge Discovery by Attribute-Oriented Approach Under Directed Acyclic Concept Graph(DACG)." NSUWorks, 2001. http://nsuworks.nova.edu/gscis_etd/411.

Full text

Abstract:

Knowledge discovery in databases (KDD) is an active and promising research area with potentially high payoffs in business and scientific applications. The great challenge of knowledge discovery in databases is to process large quantities of raw data automatically, to identify the most significant and meaningful patterns, and to present this knowledge in an appropriate form for decision making and other purposes. In previous researches, Attribute-Oriented Induction, implemented artificial intelligence, "learning from examples" paradigm. This method integrates traditional database operations to

APA, Harvard, Vancouver, ISO, and other styles

24

ARTARIA, ANDREA. "Objective Bayesian Analysis for Differential Gaussian Directed Acyclic Graphs." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2014. http://hdl.handle.net/10281/55327.

Full text

Abstract:

Often we are confronted with heterogeneous multivariate data, i.e., data coming from several categories, and the interest may center on the differential structure of stochastic dependence among the variables between the groups. The focus in this work is on the two groups problem and is faced modeling the system through a Gaussian directed acyclic graph (DAG) couple linked in a fashion to obtain a joint estimation in order to exploit, whenever they exist, similarities between the graphs. The model can be viewed as a set of separate regressions and the proposal consists in assigning a non-local

APA, Harvard, Vancouver, ISO, and other styles

25

Cederquist, Aaron. "Frequent Pattern Mining among Weighted and Directed Graphs." Case Western Reserve University School of Graduate Studies / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=case1228328123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Thiebaut, Jocelyn. "Algorithmic and structural results on directed cycles in dense digraphs." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS059.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à quelques problèmes algorithmiques et structurels du packing de cycles (orientés) dans les graphes orientés denses. Ces problèmes sont notamment motivés par la compréhension de la structure de tels graphes, mais également car de nombreux problèmes algorithmiques sont faciles (résolubles en temps polynomial) sur des graphes orientés acycliques alors qu'il sont NP-difficiles sur les graphes orientés en général.Plus spécifiquement, nous étudions dans un premier temps le packing de cycles et le packing de triangles dans les tournois. Ces problèmes sont les

APA, Harvard, Vancouver, ISO, and other styles

27

Choudhry, Arjun. "Narrative Generation to Support Causal Exploration of Directed Graphs." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/98670.

Full text

Abstract:

Causal graphs are a useful notation to represent the interplay between the actors as well as the polarity and strength of the relationship that they share. They are used extensively in educational, professional, and industrial contexts to simulate different scenarios, validate behavioral aspects, visualize the connections between different processes, and explore the adversarial effects of changing certain nodes. However, as the size of the causal graphs increase, interpreting them also becomes increasingly tougher. In such cases, new analytical tools are required to enhance the user's comprehe

APA, Harvard, Vancouver, ISO, and other styles

28

Chaudhuri, Sanjay. "Using the structure of d-connecting paths as a qualitative measure of the strength of dependence /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/8948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Hille, Martial R. "Resonances for graph directed Markov systems, and geometry of infinitely generated dynamical systems." Thesis, St Andrews, 2009. http://hdl.handle.net/10023/719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Neppare, Christoffer. "A Force Directed Graph for Visualization of Voters Preferences Relative to Political Parties." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239030.

Full text

Abstract:

As conversations in society to a larger extent are carried out on the internet, so are the civic conversations that are the basis of the democratic process. To help citizens better navigate the democratic process, several news agencies in Sweden provide a version of Valkompassen, the election compass. The intent behind Valkompassen is to give the normal reader an easily understood answer for which party they are most aligned with on 25 questions relevant for the election. This paper suggests an alternative information visualization based on a force directed graph of the results from Valkompass

APA, Harvard, Vancouver, ISO, and other styles

31

Trinajstic, Katja. "Convergence to the Tracy-Widom distribution for longest paths in a directed random graph." Licentiate thesis, Uppsala universitet, Analys och sannolikhetsteori, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-215078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Tungol, Ronald M. "The size of the reflexive, transitive closure in an evolving random directed acyclic graph /." The Ohio State University, 1996. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487940308434447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

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

34

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

35

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

36

Spritzer, Andre Suslik. "MagnetViz : design and evaluation of a physics-based interaction technique for graph visualization." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2009. http://hdl.handle.net/10183/17023.

Full text

Abstract:

Esta dissertação apresenta MagnetViz, uma técnica para visualização de grafos. Enquanto a maior parte das técnicas visualizam um layout de grafo estático pre-computado, MagnetViz permite que usuários dinamicamente alterem o layout de um grafo de forma a melhor satisfazer suas necessidades. Isso é feito ao construir em cima da metáfora de física de algoritmos dirigidos à força para proporcionar aos usuários imãs virtuais, que podem atrair nodos que satisfazem um conjunto de critérios associados a eles. Critérios podem ser baseados na topologia ou semântica do grafo. Através de boundary shapes,

APA, Harvard, Vancouver, ISO, and other styles

37

King, James Lowell. "Gene Ontology-Guided Force-Directed Visualization of Protein Interaction Networks." Diss., NSUWorks, 2019. https://nsuworks.nova.edu/gscis_etd/1066.

Full text

Abstract:

Protein interaction data is being generated at unprecedented rates thanks to advancements made in high throughput techniques such as mass spectrometry and DNA microarrays. Biomedical researchers, operating under budgetary constraints, have found it difficult to scale their efforts to keep up with the ever-increasing amount of available data. They often lack the resources and manpower required to analyze the data using existing methodologies. These research deficiencies impede our ability to understand diseases, delay the advancement of clinical therapeutics, and ultimately costs lives. One of

APA, Harvard, Vancouver, ISO, and other styles

38

Tapankov, Martin. "Managing Dependencies in Knowledge-Based Systems: A Graph-Based Approach." Thesis, Jönköping University, JTH, Mechanical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-9176.

Full text

Abstract:

<p>In knowledge-based engineering, the inference engine plays an important part in the behaviour of the system. A flexible and adaptive execution scheme allows the designer to experiment with different modes of operation and selecting an appropriate one with respect to the initial data set and the execution goal.</p><p>In this project, an extension of an existing research prototype software in the field of knowledge-based engineering will be developed, with the goal of building a reliable and easy to use dependency resolution engine that will replace a less-than-ideal current implementation of

APA, Harvard, Vancouver, ISO, and other styles

39

Mantrach, Amin. "Novel measures on directed graphs and applications to large-scale within-network classification." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210033.

Full text

Abstract:

Ces dernières années, les réseaux sont devenus une source importante d’informations dans différents domaines aussi variés que les sciences sociales, la physique ou les mathématiques. De plus, la taille de ces réseaux n’a cessé de grandir de manière conséquente. Ce constat a vu émerger de nouveaux défis, comme le besoin de mesures précises et intuitives pour caractériser et analyser ces réseaux de grandes tailles en un temps raisonnable.<p>La première partie de cette thèse introduit une nouvelle mesure de similarité entre deux noeuds d’un réseau dirigé et pondéré :la covariance “sum-over-paths”

APA, Harvard, Vancouver, ISO, and other styles

40

Kim, Sungmin. "Community Detection in Directed Networks and its Application to Analysis of Social Networks." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397571499.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Walker, DayVon L. "Power Graphs of Quasigroups." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7984.

Full text

Abstract:

We investigate power graphs of quasigroups. The power graph of a quasigroup takes the elements of the quasigroup as its vertices, and there is an edge from one element to a second distinct element when the second is a left power of the first. We first compute the power graphs of small quasigroups (up to four elements). Next we describe quasigroups whose power graphs are directed paths, directed cycles, in-stars, out-stars, and empty. We do so by specifying partial Cayley tables, which cannot always be completed in small examples. We then consider sinks in the power graph of a quasigroup,

APA, Harvard, Vancouver, ISO, and other styles

42

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Circuit Bases of Strongly Connected Digraphs." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/178/1/document.pdf.

Full text

Abstract:

The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

43

Seidler, Steffen. "Über Minoren gerichteter Graphen." Master's thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-68153.

Full text

Abstract:

Seit 1983 begründet die Publikationsreihe "Graph Minors" von N. Robertson und P.D. Seymour im Wesentlichen die Minorentheorie mit mächtigen Hilfsmitteln wie der Baumzerlegung und weitreichenden Resultaten wie dem Minorensatz. Für gerichtete Graphen existiert allerdings noch keine einheitliche Minorentheorie und verschiedene Ansätze werden in dieser Arbeit systematisiert. Einige gerichtete Versionen der Baumzerlegung (gerichtete Baumzerlegung nach B. Reed, arboreale, D- und DAG-Zerlegung) werden unter einheitlichen Aspekten untersucht. Die D-Weite ist dabei besonders vielversprechend. Enge Ver

APA, Harvard, Vancouver, ISO, and other styles

44

Kaiser, Patricia. "Optimization of a Software Defined Radio multi-standard system using Graph Theory." Thesis, Supélec, 2012. http://www.theses.fr/2012SUPL0025/document.

Full text

Abstract:

Le concept de radio logicielle (SDR) est une solution pertinente pour concevoir des équipements multi-standards. Une façon de réaliser de tels équipements est d'identifier les fonctions et opérateurs communs entre les standards. Cette approche s’appelle la paramétrisation et est divisée en deux catégories : l'approche pragmatique qui est une version pratique pour créer et développer des opérateurs communs à partir d’opérateurs existants, et l'approche théorique dont l’objectif est de réaliser une exploration graphique d’un équipement multi-standards selon différents niveaux de granularité, acc

APA, Harvard, Vancouver, ISO, and other styles

45

Bruno, Nicholas J. "A Sufficient Condition for Hamiltonian Connectedness in Standard 2-Colored Multigraphs." Miami University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=miami1438385443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Dodo, Meva. "Etude de l'apport de la visualisation 3D interactive pour l'administration de systèmes complexe." Toulouse 3, 2008. http://thesesups.ups-tlse.fr/358/.

Full text

Abstract:

Cette thèse propose de nouvelles méthodes qui permettent de faciliter l'analyse et la compréhension de la structure des systèmes complexes ainsi que les différents événements générés par les ressources. Des techniques de représentation 3D sont proposées afin de permettre la visualisation de tout type de structure de systèmes complexes. Notre approche est matérialisée par un nouvel algorithme d'affichage 3D de larges graphes. Cette algorithme est basé sur une nouvelle approche d'optimisation de l'algorithme force-attraction-répulsion (FDP) afin mieux de distribuer les nœuds d'un graphe dans un

APA, Harvard, Vancouver, ISO, and other styles

47

Sadeghi, Kayvan. "Graphical representation of independence structures." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:86ff6155-a6b9-48f9-9dac-1ab791748072.

Full text

Abstract:

In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The class of LMGs contains almost all known classes of graphs used in the literature of graphical Markov models. We focus in particular on the subclass of ribbonless graphs (RGs), which as special cases include undirected graphs, bidirected graphs, and directed acyclic graphs, as well as ancestral graphs and summary graphs. We define a unifying interpretation of independence structure for LMGs and pairwise and global Markov properties for RGs, discuss their maximality, and

APA, Harvard, Vancouver, ISO, and other styles

48

Lee, Sang-Gu. "On the Generalizations of Gershgorin's Theorem." DigitalCommons@USU, 1986. https://digitalcommons.usu.edu/etd/6993.

Full text

Abstract:

This paper deals with generalization fo Gershgorin's theorem. This theorem is investigated and generalized in terms of contour integrals, directed graphs, convex analysis, and clock matrices. These results are shown to apply to some specified matrices such as stable and stochastic matrices and some examples will show the relationship of eigenvalue inclusion regions among them.

APA, Harvard, Vancouver, ISO, and other styles

49

Římský, Adam. "Využití teorie grafů pro návrh a optimalizaci architektur datových sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218337.

Full text

Abstract:

This masters'sthesis deals with graph theory and utilization of this theory for design and optimization of data network structures. Introduction chapter describes graph theory in general view, i.e. fundamental terms used for graph description, graph distinguishing, etc. Next part describes graph algorithms, for example a shortest path finding. After this I write about actual routing protocols where the graph algorithms are used. Last but one part deals with queuing theory and final part describes practical presentation of using graph theory for design and optimization of data network structure

APA, Harvard, Vancouver, ISO, and other styles

50

Witt, Carl Philipp. "Predictive Resource Management for Scientific Workflows." Doctoral thesis, Humboldt-Universität zu Berlin, 2020. http://dx.doi.org/10.18452/21608.

Full text

Abstract:

Um Erkenntnisse aus großen Mengen wissenschaftlicher Rohdaten zu gewinnen, sind komplexe Datenanalysen erforderlich. Scientific Workflows sind ein Ansatz zur Umsetzung solcher Datenanalysen. Um Skalierbarkeit zu erreichen, setzen die meisten Workflow-Management-Systeme auf bereits existierende Lösungen zur Verwaltung verteilter Ressourcen, etwa Batch-Scheduling-Systeme. Die Abschätzung der Ressourcen, die zur Ausführung einzelner Arbeitsschritte benötigt werden, wird dabei immer noch an die Nutzer:innen delegiert. Dies schränkt die Leistung und Benutzerfreundlichkeit von Workflow-Management-S

APA, Harvard, Vancouver, ISO, and other styles

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!