Einloggen

Thematische Bibliographien / Simple graph / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Simple graph.

Dissertationen zum Thema „Simple graph“

Autor: Grafiati

Veröffentlicht am 18. Mai 2024

Zuletzt aktualisiert am 25. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-42 Dissertationen für die Forschung zum Thema "Simple graph" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

CRUCIANI, EMILIO. "Simple Randomized Distributed Algorithms for Graph Clustering." Doctoral thesis, Gran Sasso Science Institute, 2019. http://hdl.handle.net/20.500.12571/9951.

Der volle Inhalt der Quelle

Annotation:

Label Propagation Algorithms are a class of heuristics for the problem of graph clustering, i.e., the problem of detecting groups of nodes whose connections are dense within each group and sparse between the groups. At the onset, a label is assigned to each node of the graph; then, each node iteratively updates its label according to a function of the labels of its neighbors. Empirical studies show that, after only a few rounds, nodes in the same cluster share the same label while nodes in different clusters have different labels. Although they are widely used in practice given their simplicit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Matos, Jody Maick Araujo de. "Graph based algorithms to efficiently map VLSI circuits with simple cells." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/174523.

Der volle Inhalt der Quelle

Annotation:

Essa tese introduz um conjunto de algoritmos baseados em grafos para o mapeamento eficiente de circuitos VLSI com células simples. Os algoritmos propostos se baseiam em minimizar de maneira eficiente o número de elementos lógicos usados na implementação do circuito. Posteriormente, uma quantidade significativa de esforço é aplicada na minimização do número de inversores entre esses elementos lógicos. Por fim, essa representação lógica é mapeada para circuitos compostos somente por células NAND e NOR de duas entradas, juntamente com inversores. Células XOR e XNOR de duas entradas também podem s

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Bereczki, Márk. "Graph Neural Networks for Article Recommendation based on Implicit User Feedback and Content." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-300092.

Der volle Inhalt der Quelle

Annotation:

Recommender systems are widely used in websites and applications to help users find relevant content based on their interests. Graph neural networks achieved state- of-the- art results in the field of recommender systems, working on data represented in the form of a graph. However, most graph- based solutions hold challenges regarding computational complexity or the ability to generalize to new users. Therefore, we propose a novel graph- based recommender system, by modifying Simple Graph Convolution, an approach for efficient graph node classification, and add the capability of generalizing t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Kaykobad, M. Tanvir. "Transforming Plane Triangulations by Simultaneous Diagonal Flips." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40499.

Der volle Inhalt der Quelle

Annotation:

We explore the problem of transforming plane triangulations using simultaneous diagonal flips. Wagner showed that any n-vertex plane triangulation can be transformed to any other plane triangulation on equal number of vertices using a finite sequence of diagonal flips. Later on it has been established that O(n) individual flips suffice to complete this transformation. Bose et al. showed that the transformation can also be done in 4 × ( 2 / log 54/53 + 2 / log 6/5 ) logn + 2 ≈ 327.1 log n simultaneous flips. This bound is asymptotically tight. We present two algorithms to improve th

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Islam, Md Kamrul. "Explainable link prediction in large complex graphs - application to drug repurposing." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0203.

Der volle Inhalt der Quelle

Annotation:

De nombreux systèmes complexes du monde réel peuvent être représentés par des graphes, où les nœuds représentent des entités et les liens des relations entre les paires de nœuds. La prédiction de liens (LP) est l'un des problèmes les plus intéressants et les plus anciens dans le domaine de l'exploration de graphes ; elle prédit la probabilité d'un lien entre deux nœuds non connectés. Cette thèse étudie le problème LP dans les graphes simples et les graphes de connaissances (KGs). La première partie de cette thèse se concentre sur le problème LP dans les graphes simples. Dans la première étude,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Lehbab, Imène. "Problèmes métriques dans les espaces de Grassmann." Electronic Thesis or Diss., Mulhouse, 2023. http://www.theses.fr/2023MULH6508.

Der volle Inhalt der Quelle

Annotation:

Il s'agit d'une contribution dans le domaine de la géométrie métrique du plan projectif complexe CP2 et de la variété de Grassmann réelle des plans dans R6. On s'intéresse à l'étude de tous les p-uplets, p ≥ 3, de droites équiangulaires dans C3 et des p-uplets de plans équi-isoclins dans R6. Sachant que 9 est le nombre maximum de droites équiangulaires que l'on peut construire dans C3, on décrit une méthode qui permet de construire tous les p-uplets de droites équiangulaires pour tout pϵ[3,9]. En particulier, on construit dans C3 cinq classes de congruence de quadruplets de droites équiangulai

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Montanaro, William M. Jr. "Character Degree Graphs of Almost Simple Groups." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1398345504.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Soames, Kieron, and Jonas Lind. "Detecting Cycles in GraphQL Schemas." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-156174.

Der volle Inhalt der Quelle

Annotation:

GraphQL is a database handling API created by Facebook, that provides an effective al-ternative to REST-style architectures. GraphQL provides the ability for a client to spec-ify exactly what data it wishes to receive. A problem with GraphQL is that the freedomof creating customized requests allows data to be included several times in the response,growing the response’s size exponentially. The thesis contributes to the field of GraphQLanalysis by studying the prevalence of simple cycles in GraphQL schemas. We have im-plemented a locally-run tool and webtool using Tarjan’s and Johnson’s algorit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Yan, Chenyu. "APPROXIMATING DISTANCES IN COMPLICATED GRAPHS BY DISTANCES IN SIMPLE GRAPHS WITH APPLICATIONS." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1184639623.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Okeke, Nnamdi, and University of Lethbridge Faculty of Arts and Science. "Character generators and graphs for simple lie algebras." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2006, 2006. http://hdl.handle.net/10133/532.

Der volle Inhalt der Quelle

Annotation:

We study character generating functions (character generators) of simple Lie algebras. The expression due to Patera and Sharp, derived from the Weyl character formula, is ¯rst re- viewed. A new general formula is then found. It makes clear the distinct roles of \outside" and \inside" elements of the integrity basis, and helps determine their quadratic incompati- bilities. We review, analyze and extend the results obtained by Gaskell using the Demazure character formulas. We ¯nd that the fundamental generalized-poset graphs underlying the character generators can be deduced from such calculatio

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Mahfoudh, Mariem. "Adaptation d'ontologies avec les grammaires de graphes typés : évolution et fusion." Thesis, Mulhouse, 2015. http://www.theses.fr/2015MULH1519/document.

Der volle Inhalt der Quelle

Annotation:

Étant une représentation formelle et explicite des connaissances d'un domaine, les ontologies font régulièrement l'objet de nombreux changements et ont ainsi besoin d'être constamment adaptées pour notamment pouvoir être réutilisées et répondre aux nouveaux besoins. Leur réutilisation peut prendre différentes formes (évolution, alignement, fusion, etc.), et présente plusieurs verrous scientifiques. L'un des plus importants est la préservation de la consistance de l'ontologie lors de son changement. Afin d'y répondre, nous nous intéressons dans cette thèse à étudier les changements ontologiques

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Sander, Torsten [Verfasser]. "On simply structured bases of graph eigenspaces / Torsten Sander." [Clausthal-Zellerfeld] : [Univ.-Bibliothek], 2009. http://d-nb.info/997062517/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Everett, Alistaire Duncan Fraser. "Commuting involution graphs of certain finite simple classical groups." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/commuting-involution-graphs-of-certain-finite-simple-classical-groups(dd54ee3d-8c94-42cd-87e1-d34770756466).html.

Der volle Inhalt der Quelle

Annotation:

For a group G and X a subset of G, the commuting graph of G on X, denoted by C(G,X), is the graph whose vertex set is X with x, y joined by an edge if x not equal to y and x and y commute. If the elements in X are involutions, then C(G,X) is called a commuting involution graph. This thesis studies C(G,X) when G is either a 4-dimensional projective symplectic group; a 3-dimensional unitary group; 4-dimensional unitary group over a field of characteristic 2; a 2-dimensional projective general linear group; or a 4-dimensional affne orthogonal group, and X a G-conjugacy class of involutions. We de

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Bosi, Gianluca <1991&gt. "Simple random walks on some partially directed planar graphs." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amsdottorato.unibo.it/8914/1/bosi_gianluca_tesi.pdf.

Der volle Inhalt der Quelle

Annotation:

In this thesis we analyze the recurrence behavior of simple random walks on some classes of directed planar graphs. Our first model is a version of the honeycomb lattice, where the horizontal edges are randomly oriented according to families of random variables: depending on their distribution, we prove a.s. transience in some cases, and a.s. recurrence in other ones. Our results extend those obtained by Campanino and Petritis (’03 and ’14) for partially oriented square grid lattices. Furthermore, we consider two directed square grid lattices on which, because of the direction imposed by the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Kimmel, Jason. "Simple Games on Networks." Oberlin College Honors Theses / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1307994412.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Fallahtoori, Sahar. "Distributed Graph Clustering: Study of DiDiC and Some Simpler Forms." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174831.

Der volle Inhalt der Quelle

Annotation:

The size of global electronic data in need of storage and retrieval is growing with an increasing rate. As a result of this growth, the development of technologies to process such data is a necessity. The data is developing in both complexity and connectivity, particularly for social networks. Connectivity of data means that the records to be stored are highly interdependent. Conventional relational databases are poorly suited for processing highly connected data. On the contrary, graph databases are inherently suited for such dependencies. This is mainly due to the fact that graph databases t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Wright, Benjamin. "Graphs associated with the sporadic simple groups Fi₂₄ and BM." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/graphs-associated-with-the-sporadic-simple-groups-fi24-and-bm(dcdd493b-929d-4f91-a6bc-48c6b5fda3ba).html.

Der volle Inhalt der Quelle

Annotation:

Our aim is to calculate some graphs associated with two of the larger sporadicsimple groups, Fi₂₄ and the Baby Monster. Firstly we calculate the point line collinearity graph for a maximal 2-local geometry of Fi₂₄. If T is such a geometry, then the point line collinearity graph G will be the graph whose vertices are the points in T, with any two vertices joined by an edge if and only if they are incident with a common line. We found that the graph has diameter 5 and we give its collapsed adjacency matrix. We also calculate part of the commuting involution graph, C, for the class 2C of the Baby

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Silva, Allan Kardec Messias da. "O degree graph dos grupos alternados e de outros grupos simples." reponame:Repositório Institucional da UnB, 2013. http://repositorio.unb.br/handle/10482/13601.

Der volle Inhalt der Quelle

Annotation:

Dissertação (mestrado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Matemática, 2013.<br>Submitted by Luiza Silva Almeida (luizaalmeida@bce.unb.br) on 2013-07-17T20:41:38Z No. of bitstreams: 1 2013_AllanKardecMessiasdaSilva.pdf: 811006 bytes, checksum: d150f5332d05a0c2ccff34412c37b29f (MD5)<br>Approved for entry into archive by Leandro Silva Borges(leandroborges@bce.unb.br) on 2013-07-17T21:22:19Z (GMT) No. of bitstreams: 1 2013_AllanKardecMessiasdaSilva.pdf: 811006 bytes, checksum: d150f5332d05a0c2ccff34412c37b29f (MD5)<br>Made available in DSpace on 2013-07-17T21:2

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Frondana, Iara Moreira. "Model selection for discrete Markov random fields on graphs." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-02022018-151123/.

Der volle Inhalt der Quelle

Annotation:

In this thesis we propose to use a penalized maximum conditional likelihood criterion to estimate the graph of a general discrete Markov random field. We prove the almost sure convergence of the estimator of the graph in the case of a finite or countable infinite set of variables. Our method requires minimal assumptions on the probability distribution and contrary to other approaches in the literature, the usual positivity condition is not needed. We present several examples with a finite set of vertices and study the performance of the estimator on simulated data from theses examples. We also

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

González, Ruiz Jacobo Leonardo 502510, and Ruiz Jacobo Leonardo González. "Calculo del clique-width en graficas simples de acuerdo a su estructura." Tesis de doctorado, Universidad Autónoma del Estado de México, 2018. http://hdl.handle.net/20.500.11799/95286.

Der volle Inhalt der Quelle

Annotation:

El cálculo del cliquewidth, un número entero que es un invariante para gráficas, ha sido estudiado de manera activa, ya que existen problemas catalogados como NP-Completos que tienen complejidad baja si su representación en gráficas tiene cliquewidth acotado. De cierta manera este parametro mide la dificultad de descomponer una gráfica en una estructura llamada árbol (por su topología). La importancia de este invariante radica en que si un problema de gráficas puede ser acotado por ella entonces puede ser resuelto en tiempo polinomial según el teorema principal de Courcelle. Por otra parte el

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

De, Saedeleer Julie. "The residually weakly primitive and locally two-transitive rank two geometries for the groups PSL(2, q)." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210037.

Der volle Inhalt der Quelle

Annotation:

The main goal of this thesis is a contribution to the classification of all incidence geometries<p>of rank two on which some group PSL(2,q), q a prime power, acts flag-transitively.<p>Actually we require that the action be RWPRI (residually weakly primitive) and (2T)1<p>(doubly transitive on every residue of rank one). In fact our definition of RWPRI requires<p>the geometry to be firm (each residue of rank one has at least two elements) and RC<p>(residually connected).<p><p>The main goal is achieved in this thesis.<p>It is stated in our "Main Theorem". The proof of this theorem requires more t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Schuhmacher, Michael Verfasser], and Simone Paolo [Akademischer Betreuer] [Ponzetto. "Knowledge Graph Exploration for Natural Language Understanding in Web Information Retrieval / Michael Schuhmacher ; Betreuer: Simone Paolo Ponzetto." Mannheim : Universitätsbibliothek Mannheim, 2016. http://d-nb.info/1120302587/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Schuhmacher, Michael [Verfasser], and Simone Paolo [Akademischer Betreuer] Ponzetto. "Knowledge Graph Exploration for Natural Language Understanding in Web Information Retrieval / Michael Schuhmacher ; Betreuer: Simone Paolo Ponzetto." Mannheim : Universitätsbibliothek Mannheim, 2016. http://d-nb.info/1120302587/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Biswas, Arindam. "Théorie des groupes approximatifs et ses applications." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS573.

Der volle Inhalt der Quelle

Annotation:

Dans la premier partie de cette thèse, nous étudions la structure des sous-groupes approximatifs dans les groupes metabéliens (groupes résolubles de classe de résolubilité 2) et montrons que si A est un tel sous-groupe K approximatif, il est K^⁰(r) contrôlée (au sens du Tao) par un groupe nilpotent où $ r désigne le rang de $ G=Fit (G) et Fit (G) $ est le sous-groupe de fitting de G. La deuxième partie est consacrée à l'étude de la croissance des ensembles dans GLn(Fq) où Fq est un corps fini. Nous montrons une borne sur le diamètre (par rapport à n'importe quel système des générateurs) pour t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Mattos, Bruno Donadelli Trajano. "Cálculo de áreas sem o uso do Teorema Fundamental do Cálculo." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-02022018-090342/.

Der volle Inhalt der Quelle

Annotation:

Desenvolvemos uma estratégia natural e acessível aos estudantes do Ensino Médio para o cálculo de áreas planas sem as ferramentas mais avançadas do Cálculo Diferencial e Integral.<br>We developed a natural strategy, achievable by high school students, for the computation of area of limited regions of the cartesian plane, without making use of more advanced resources of Differential and Integral Calculus.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Hwang, Joe, and 黃守偉. "Automatic Graph Drawing for Simple Graphs." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/62852007564092722674.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Chang, Chia-Yi, and 張嘉益. "Two Efficient Graph Representations for SimpleTwo Efficient Graph Representations for Simple Graphs." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/91938888012934084888.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立臺灣科技大學<br>資訊管理系<br>93<br>Representing graphs is a fundamental data-structuring problem. Adjacency matrices and adjacency lists are two well known representations. The operations on an adjacency matrix which contain adjacency test, inserting/deleting an edge can be done in constant time. However, finding all adjacency vertices of a given vertex will take θ(n) time by using an adjacent matrix. On the other hand, to test adjacency on adjacency lists will take O(deg(i)) time, where deg(i) is the degree of vertex i. In this thesis, we propose two efficient representations which not only sup

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Papoutsakis, Ioannis. "Tree Spanners of Simple Graphs." Thesis, 2013. http://hdl.handle.net/1807/35920.

Der volle Inhalt der Quelle

Annotation:

A tree $t$-spanner $T$ of a simple graph $G$ is a spanning tree of $G$, such that for every pair of vertices of $G$ their distance in $T$ is at most $t$ times their distance in $G$, where $t$ is called a stretch factor of $T$ in $G$. It has been shown that there is a linear time algorithm to find a tree 2-spanner in a graph; it has also been proved that, for each $t>3$, determining whether a graph admits a tree $t$-spanner is an NP-complete problem. This thesis studies tree $t$-spanners from both theoretical and algorithmic perspectives. In particular, it is proved that a nontree graph admits

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

邱建綸. "On the Book-thickness of a simple graph." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/07580213763515161824.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立中正大學<br>數學系研究所<br>105<br>We went to discuss the book embedding of a simple G into a book B is a drawing of this G on the pages of the book B such that there are no edge crossings on each page of this book B. Then, use Bounds of Book-thickness to discuss some special graphs. Finally, classified all the finite local rings with planar zero-divisor graphs of Book-thickness.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Rahmati, Zahed. "Simple, Faster Kinetic Data Structures." Thesis, 2014. http://hdl.handle.net/1828/5627.

Der volle Inhalt der Quelle

Annotation:

Proximity problems and point set embeddability problems are fundamental and well-studied in computational geometry and graph drawing. Examples of such problems that are of particular interest to us in this dissertation include: finding the closest pair among a set P of points, finding the k-nearest neighbors to each point p in P, answering reverse k-nearest neighbor queries, computing the Yao graph, the Semi-Yao graph and the Euclidean minimum spanning tree of P, and mapping the vertices of a planar graph to a set P of points without inducing edge crossings. In this dissertation, we consider

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Sutuntivorakoon, Kanes. "Maximal Clique Scheduling: A Simple Algorithm to Bound Maximal Independent Graph Scheduling." Thesis, 2012. http://hdl.handle.net/1911/64702.

Der volle Inhalt der Quelle

Annotation:

In this paper, we consider interference networks where the connectivity is known globally while the channel gains are known up to a particular distance from each node. In this setting, we provide a new achievability, called Maximal Clique Scheduling (MCS), which is a special case of Maximal Independent Graph Scheduling (MIG Scheduling) proposed earlier. The strategy is evaluated using the notion of normalized sum rate which is a metric to evaluate performance of networks with mismatched knowledge. The achievable normalized sum rate of the proposed MCS strategy is easier to analyze for certai

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Chiang, Wei-Ling, and 江韋伶. "A Linear Time Algorithm for the Simple Moplex Ordering of a Strongly Chordal Graph." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/26826356427901784124.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立臺北商業技術學院<br>資訊與決策科學研究所<br>102<br>Berry [A. Berry, J. P. Bordat, Moplex elimination orderings, Electronic Notes in Discrete Mathematics, 8 (2001) 6--9] proved that a graph G is choral if and only if G admits a moplex ordering. In this thesis, we also prove that a strongly chordal graph has a similar ordering namely simple moplex ordering. Then, we propose an algorithm that can be run in linear time to find such an ordering.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Dona, Daniele. "Growth in finite groups and the Graph Isomorphism Problem." Doctoral thesis, 2020. http://hdl.handle.net/21.11130/00-1735-0000-0005-145F-B.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Liao, Chia-Ying, and 廖家瑩. "The Effect of Trigger-based Animated Instruction on Learning Achievement and Cognitive Load in Simple Quadratic Functions Graph." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/01176774279264291417.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立交通大學<br>理學院科技與數位學習學程<br>98<br>Trigger-based Animated Instruction is based on the concept of cognitive load theory and multimedia learning theory. Based on the Trigger-based Animated Instruction, instructors design teaching materials corresponded to classroom instructions, which contribute to guiding attention more easily; and help students take the initiative to search, select and organize information; reduce the burden on working memory as well as cognitive load; and enhance learning. This study adopted a quasi-experimental design by using the simple quadratic function graph of mathem

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

黃楷智. "A Study on the Effect of GeoGebra on Math Learning Achievement and Cognitive Diagnosis – a Case of Simple Quadratic Functions Graph." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/60743840479873938966.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立交通大學<br>理學院科技與數位學習學程<br>99<br>GeoGebra (dynamic geometry system) is an interactive software that combines algebraic calculation and geometric construction. The main feature focuses on students’ own initiatives to operate and observe mathematical objects through interactive methods. It facilitates building mathematical concepts through tangible experiences. With properly designed teaching materials, it can focus students’ attentions, promote cognitive learning and encourage student-teacher interactions. Using the quasi-experimental method, the study uses simple quadratic function as

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Kynčl, Jan. "Kombinatorické otázky v geometrii." Doctoral thesis, 2013. http://www.nusl.cz/ntk/nusl-328681.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Rodrigues, Bernardo Gabriel. "Codes of designs and graphs from finite simple groups." Thesis, 2002. http://hdl.handle.net/10413/3895.

Der volle Inhalt der Quelle

Annotation:

Discrete mathematics has had many applications in recent years and this is only one reason for its increasing dynamism. The study of finite structures is a broad area which has a unity not merely of description but also in practice, since many of the structures studied give results which can be applied to other, apparently dissimilar structures. Apart from the applications, which themselves generate problems, internally there are still many difficult and interesting problems in finite geometry and combinatorics. There are still many puzzling features about sub-structures of finite projective s

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Huang, Wei-Chih, and 黃韋誌. "Dynamic Monopoly in Simple Directed Graphs with Girth g." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/79606676945973446482.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立臺灣大學<br>資訊工程學研究所<br>99<br>Suppose G(V,E) is a simple directed graph, where there is at most one directed edge between each pair of vertices. We say G(V,E) has girth g if the length of the shortest cycle in is . We shall require that each vertex in a simple directed graph have at least one in-neighbor. Now, consider a process of propagations in a directed graph G(V,E) as follows. Some vertices, called seeds, in V are initially active, and the others are inactive. Later, an inactive vertex is activated if over half of its in-neighbors are active, and such activations end while no more

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Chang, Ting-Chung, and 張庭鈞. "A graph-based simplex method for performance-driven layout compaction." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/56936939712251087832.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立成功大學<br>電機工程研究所<br>81<br>As the increasing requirement of high speed circuit, the performance issue must be addressed at layout compaction. In this thesis, a new layout compaction approach which aims at this purpose is considered. This compaction approach consists of two stages: In the first stage, the upper bound of delay on a set of timing critical path is minimized; and in the second stage, the area of the layout is minimized while all the timing cirtical paths are c

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Alallah, Fouad Shoie. "OA-Graphs: Orientation Agnostic Graphs for improving the legibility of simple visualizations on horizontal displays." 2011. http://hdl.handle.net/1993/4451.

Der volle Inhalt der Quelle

Annotation:

Horizontal displays, such as tabletop systems, are emerging as the de facto platform for engaging participants in collaborative tasks. Despite significant efforts in improving the interactivity of information on such systems, very little research has been invested in understanding how groups of people view data visualizations in such environments. Numerous studies introduced different techniques to support viewing visualization for groups of people, such as duplicating or reorienting the visual displays. However, when visualizations compete for pixels on the display, prior solutions do not wor

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Chen, Yu-Chih, and 陳育志. "A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/6c9872.

Der volle Inhalt der Quelle

Annotation:

碩士<br>中原大學<br>應用數學研究所<br>91<br>In this paper, we introduce a simple scheme for generating ``{sl good}" bipartite graphs. A bipartite graph $G$ with bipartition $W$ and $B$ is a good graph if it is {sl 1-hamiltonian} and {sl hamiltonian laceable}. More specifically, $G$ is good if $G-F$ remains hamiltonian where $F$ consists of an edge or a pair of vertices ${v_1,v_2mid v_1in W, v_2in B}$, and if there exists a hamiltonian path joining $u$ to $v$ for any $uin W, vin B$. This scheme is called ``{sl edge replacement}". Simple examples of good bipartite graphs, as well as the family of {sl brothe

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Chin-Chien, Hsieh, and 謝謹謙. "A Study of Instructional Design by Trigger-based Animation on Learning Achievement by Cognitively Diagnostic Assessment-Graphs of Simple Quadratic Functions as an Example." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/35178586906271850088.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立交通大學<br>理學院科技與數位學習學程<br>99<br>There are some questions to explore in multimedia teaching on this study. Are the materials designed by Trigger-based Animated Instruction different from those designed with slides? Is there significant difference to different academic achievement students in those teaching? Is there significant difference to test the students in attribute prevalence levels and cognitive levels by Cognitively Diagnostic Assessment? How do students perform in each attribute prevelence levels and in cognitive levels in the posttest and the postpone test? Overall, in the pos

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!