Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Distance graphs)`

.
Showing records 1 – 27 of
27 total matches.

▼ Search Limiters

Virginia Tech

1.
Rhodes, Benjamin Robert.
On the Discrete Number of Tree * Graphs*.

Degree: MS, Mathematics, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/98536

► We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit…
(more)

Subjects/Keywords: tree graphs; distance problem; bounds

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rhodes, B. R. (2020). On the Discrete Number of Tree Graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/98536

Chicago Manual of Style (16^{th} Edition):

Rhodes, Benjamin Robert. “On the Discrete Number of Tree Graphs.” 2020. Masters Thesis, Virginia Tech. Accessed August 04, 2020. http://hdl.handle.net/10919/98536.

MLA Handbook (7^{th} Edition):

Rhodes, Benjamin Robert. “On the Discrete Number of Tree Graphs.” 2020. Web. 04 Aug 2020.

Vancouver:

Rhodes BR. On the Discrete Number of Tree Graphs. [Internet] [Masters thesis]. Virginia Tech; 2020. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10919/98536.

Council of Science Editors:

Rhodes BR. On the Discrete Number of Tree Graphs. [Masters Thesis]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/98536

University of Minnesota

2. Olsen, David. The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method.

Degree: PhD, Computer Science, 2015, University of Minnesota

URL: http://hdl.handle.net/11299/183343

► The goal of this project was to develop a general, complete linkage hierarchical clustering method that 1) substantially improves upon the accuracy of the standard…
(more)

Subjects/Keywords: automation; clustering; complete linkage; distance graphs; hierarchical

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Olsen, D. (2015). The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/183343

Chicago Manual of Style (16^{th} Edition):

Olsen, David. “The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method.” 2015. Doctoral Dissertation, University of Minnesota. Accessed August 04, 2020. http://hdl.handle.net/11299/183343.

MLA Handbook (7^{th} Edition):

Olsen, David. “The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method.” 2015. Web. 04 Aug 2020.

Vancouver:

Olsen D. The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method. [Internet] [Doctoral dissertation]. University of Minnesota; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/11299/183343.

Council of Science Editors:

Olsen D. The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method. [Doctoral Dissertation]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/183343

University of Delaware

3.
McGinnis, Matt.
Combinatorial and spectral properties of *graphs* and association schemes
.

Degree: 2018, University of Delaware

URL: http://udspace.udel.edu/handle/19716/23728

► The main topics of this dissertation are related to spectral graph theory, a subtopic of algebraic combinatorics. Algebraic combinatorics is the area of mathematics that…
(more)

Subjects/Keywords: Pure sciences; Association schemes; Distance-regular graphs; Graphs; Linear algebra; Spectral graph theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

McGinnis, M. (2018). Combinatorial and spectral properties of graphs and association schemes . (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/23728

Chicago Manual of Style (16^{th} Edition):

McGinnis, Matt. “Combinatorial and spectral properties of graphs and association schemes .” 2018. Doctoral Dissertation, University of Delaware. Accessed August 04, 2020. http://udspace.udel.edu/handle/19716/23728.

MLA Handbook (7^{th} Edition):

McGinnis, Matt. “Combinatorial and spectral properties of graphs and association schemes .” 2018. Web. 04 Aug 2020.

Vancouver:

McGinnis M. Combinatorial and spectral properties of graphs and association schemes . [Internet] [Doctoral dissertation]. University of Delaware; 2018. [cited 2020 Aug 04]. Available from: http://udspace.udel.edu/handle/19716/23728.

Council of Science Editors:

McGinnis M. Combinatorial and spectral properties of graphs and association schemes . [Doctoral Dissertation]. University of Delaware; 2018. Available from: http://udspace.udel.edu/handle/19716/23728

University of Waterloo

4.
Huang, Junbo.
Bipartite *Distance*-Regular *Graphs* of Diameter Four.

Degree: 2014, University of Waterloo

URL: http://hdl.handle.net/10012/8618

► Using a method by Godsil and Roy, bipartite *distance*-regular *graphs* of diameter four can be used to construct {0,α}-sets, a generalization of the widely applied…
(more)

Subjects/Keywords: Distance-Regular Graphs; Terwilliger Algebra; Unit Vectors with Few Inner Products; Krein Parameters; Halved Graphs

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Huang, J. (2014). Bipartite Distance-Regular Graphs of Diameter Four. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8618

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Huang, Junbo. “Bipartite Distance-Regular Graphs of Diameter Four.” 2014. Thesis, University of Waterloo. Accessed August 04, 2020. http://hdl.handle.net/10012/8618.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Junbo. “Bipartite Distance-Regular Graphs of Diameter Four.” 2014. Web. 04 Aug 2020.

Vancouver:

Huang J. Bipartite Distance-Regular Graphs of Diameter Four. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10012/8618.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang J. Bipartite Distance-Regular Graphs of Diameter Four. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8618

Not specified: Masters Thesis or Doctoral Dissertation

Kent State University

5.
Xiang, Yang.
Reachability, Routing and *Distance* Labeling Schemes in
*Graphs* with Applications in Networks and Graph Databases.

Degree: PhD, College of Arts and Sciences / Department of Computer Science, 2009, Kent State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703

► Three fundamental and related problems, with applications in networks and graph databases, are the focus of this dissertation. They are: how to answer quickly…
(more)

Subjects/Keywords: Computer Science; Reachability; Routing; Distance; Labeling schemes; Graphs; Networks; Graph databases

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Xiang, Y. (2009). Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703

Chicago Manual of Style (16^{th} Edition):

Xiang, Yang. “Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases.” 2009. Doctoral Dissertation, Kent State University. Accessed August 04, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703.

MLA Handbook (7^{th} Edition):

Xiang, Yang. “Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases.” 2009. Web. 04 Aug 2020.

Vancouver:

Xiang Y. Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases. [Internet] [Doctoral dissertation]. Kent State University; 2009. [cited 2020 Aug 04]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703.

Council of Science Editors:

Xiang Y. Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases. [Doctoral Dissertation]. Kent State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703

6.
Jebaraj, T.
Various *distance* related parameters in *graphs*;.

Degree: 2015, Manonmaniam Sundaranar University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/38422

newline

Subjects/Keywords: graphs; parameters; Various distance

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jebaraj, T. (2015). Various distance related parameters in graphs;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/38422

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Jebaraj, T. “Various distance related parameters in graphs;.” 2015. Thesis, Manonmaniam Sundaranar University. Accessed August 04, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/38422.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jebaraj, T. “Various distance related parameters in graphs;.” 2015. Web. 04 Aug 2020.

Vancouver:

Jebaraj T. Various distance related parameters in graphs;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2015. [cited 2020 Aug 04]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38422.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jebaraj T. Various distance related parameters in graphs;. [Thesis]. Manonmaniam Sundaranar University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38422

Not specified: Masters Thesis or Doctoral Dissertation

7. Vanhove, Frédéric. Incidence geometry from an algebraic graph theory point of view.

Degree: 2011, Ghent University

URL: http://hdl.handle.net/1854/LU-1209078

► The goal of this thesis is to apply techniques from algebraic graph theory to finite incidence geometry. The incidence geometries under consideration include projective spaces,…
(more)

Subjects/Keywords: Mathematics and Statistics; finite geometry; distance-regular graphs; association schemes

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Vanhove, F. (2011). Incidence geometry from an algebraic graph theory point of view. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1209078

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Vanhove, Frédéric. “Incidence geometry from an algebraic graph theory point of view.” 2011. Thesis, Ghent University. Accessed August 04, 2020. http://hdl.handle.net/1854/LU-1209078.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vanhove, Frédéric. “Incidence geometry from an algebraic graph theory point of view.” 2011. Web. 04 Aug 2020.

Vancouver:

Vanhove F. Incidence geometry from an algebraic graph theory point of view. [Internet] [Thesis]. Ghent University; 2011. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/1854/LU-1209078.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vanhove F. Incidence geometry from an algebraic graph theory point of view. [Thesis]. Ghent University; 2011. Available from: http://hdl.handle.net/1854/LU-1209078

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

8.
Rooney, Brendan.
Spectral Aspects of Cocliques in * Graphs*.

Degree: 2014, University of Waterloo

URL: http://hdl.handle.net/10012/8409

► This thesis considers spectral approaches to finding maximum cocliques in *graphs*. We focus on the relation between the eigenspaces of a graph and the size…
(more)

Subjects/Keywords: Algebraic Graph Theory; Spectral Methods; Computational Complexity; Distance-Regular Graphs; Strongly Regular Graphs; Association Schemes; Eigenpolytopes; Veronese Matrix

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rooney, B. (2014). Spectral Aspects of Cocliques in Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8409

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Rooney, Brendan. “Spectral Aspects of Cocliques in Graphs.” 2014. Thesis, University of Waterloo. Accessed August 04, 2020. http://hdl.handle.net/10012/8409.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rooney, Brendan. “Spectral Aspects of Cocliques in Graphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Rooney B. Spectral Aspects of Cocliques in Graphs. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10012/8409.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rooney B. Spectral Aspects of Cocliques in Graphs. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8409

Not specified: Masters Thesis or Doctoral Dissertation

University of Kentucky

9.
Harney, Isaiah H.
Colorings of Hamming-*Distance* * Graphs*.

Degree: 2017, University of Kentucky

URL: https://uknowledge.uky.edu/math_etds/49

► Hamming-*distance* *graphs* arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some…
(more)

Subjects/Keywords: Hamming distance; graphs; coloring; q-ary block codes; Algebra; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Harney, I. H. (2017). Colorings of Hamming-Distance Graphs. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/math_etds/49

Chicago Manual of Style (16^{th} Edition):

Harney, Isaiah H. “Colorings of Hamming-Distance Graphs.” 2017. Doctoral Dissertation, University of Kentucky. Accessed August 04, 2020. https://uknowledge.uky.edu/math_etds/49.

MLA Handbook (7^{th} Edition):

Harney, Isaiah H. “Colorings of Hamming-Distance Graphs.” 2017. Web. 04 Aug 2020.

Vancouver:

Harney IH. Colorings of Hamming-Distance Graphs. [Internet] [Doctoral dissertation]. University of Kentucky; 2017. [cited 2020 Aug 04]. Available from: https://uknowledge.uky.edu/math_etds/49.

Council of Science Editors:

Harney IH. Colorings of Hamming-Distance Graphs. [Doctoral Dissertation]. University of Kentucky; 2017. Available from: https://uknowledge.uky.edu/math_etds/49

Stellenbosch University

10.
Dadedzi, Kenneth.
Spectral radii of matrices associated with * graphs*.

Degree: MSc, 2015, Stellenbosch University

URL: http://hdl.handle.net/10019.1/98073

►

ENGLISH ABSTRACT : The spectral radius of a graph is defined as the largest absolute value of the eigenvalues of a matrix associated with the… (more)

Subjects/Keywords: Spectral radius; Adjacency Matrix; Distance Matrix; Graphs; Volkmann trees; Greedy trees; Extended star graph

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Dadedzi, K. (2015). Spectral radii of matrices associated with graphs. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/98073

Chicago Manual of Style (16^{th} Edition):

Dadedzi, Kenneth. “Spectral radii of matrices associated with graphs.” 2015. Masters Thesis, Stellenbosch University. Accessed August 04, 2020. http://hdl.handle.net/10019.1/98073.

MLA Handbook (7^{th} Edition):

Dadedzi, Kenneth. “Spectral radii of matrices associated with graphs.” 2015. Web. 04 Aug 2020.

Vancouver:

Dadedzi K. Spectral radii of matrices associated with graphs. [Internet] [Masters thesis]. Stellenbosch University; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10019.1/98073.

Council of Science Editors:

Dadedzi K. Spectral radii of matrices associated with graphs. [Masters Thesis]. Stellenbosch University; 2015. Available from: http://hdl.handle.net/10019.1/98073

Pontifícia Universidade Católica de São Paulo

11. Renata Martins Fortes. Interpretação de gráficos de velocidade em um ambiente robótico.

Degree: 2007, Pontifícia Universidade Católica de São Paulo

URL: http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=4536

►

Esta pesquisa tem por objetivo investigar o impacto de um ambiente robótico nas estratégias e representações utilizadas por estudantes na interpretação de gráficos apresentando relações… (more)

Subjects/Keywords: Robotics; construcionismo; Distance-time graphs; Robolab; gráficos; robótica; MATEMATICA; Robolab; Educacao matematica; Matematica – Estudo e ensino; Design Experiments; Design Experiments; Constructionism

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Fortes, R. M. (2007). Interpretação de gráficos de velocidade em um ambiente robótico. (Thesis). Pontifícia Universidade Católica de São Paulo. Retrieved from http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=4536

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Fortes, Renata Martins. “Interpretação de gráficos de velocidade em um ambiente robótico.” 2007. Thesis, Pontifícia Universidade Católica de São Paulo. Accessed August 04, 2020. http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=4536.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fortes, Renata Martins. “Interpretação de gráficos de velocidade em um ambiente robótico.” 2007. Web. 04 Aug 2020.

Vancouver:

Fortes RM. Interpretação de gráficos de velocidade em um ambiente robótico. [Internet] [Thesis]. Pontifícia Universidade Católica de São Paulo; 2007. [cited 2020 Aug 04]. Available from: http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=4536.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fortes RM. Interpretação de gráficos de velocidade em um ambiente robótico. [Thesis]. Pontifícia Universidade Católica de São Paulo; 2007. Available from: http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=4536

Not specified: Masters Thesis or Doctoral Dissertation

12.
Kakarlapudi, Geetha.
Analysis of beacon triangulation in random * graphs*.

Degree: 2005, Texas A&M University

URL: http://hdl.handle.net/1969.1/1447

► Our research focusses on the problem of finding nearby peers in the Internet. We focus on one particular approach, Beacon Triangulation that is widely used…
(more)

Subjects/Keywords: Beacon Triangulation; Random graphs; network distance estimation

…FIGURES
FIGURE
Page
1
*Distance* vectors used in Beaconing scheme… …distribution of nodes with equal *distance* vectors:
(a) n = 1000, λ = 7; (b) n… …Shortest path distribution of nodes with equal *distance* vectors:
(a) n = 10000, λ = 7… …*distance* vectors in a G(n, p) graph for n = 1000
and p = 0.01… …41
Ambiguities in *distance* vectors in a G(n, p) graph for n = 10000
and p…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kakarlapudi, G. (2005). Analysis of beacon triangulation in random graphs. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/1447

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kakarlapudi, Geetha. “Analysis of beacon triangulation in random graphs.” 2005. Thesis, Texas A&M University. Accessed August 04, 2020. http://hdl.handle.net/1969.1/1447.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kakarlapudi, Geetha. “Analysis of beacon triangulation in random graphs.” 2005. Web. 04 Aug 2020.

Vancouver:

Kakarlapudi G. Analysis of beacon triangulation in random graphs. [Internet] [Thesis]. Texas A&M University; 2005. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/1969.1/1447.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kakarlapudi G. Analysis of beacon triangulation in random graphs. [Thesis]. Texas A&M University; 2005. Available from: http://hdl.handle.net/1969.1/1447

Not specified: Masters Thesis or Doctoral Dissertation

13. El Khoury, Rachid. Partial 3D-shape indexing and retrieval : Indexation partielle de modèles 3D.

Degree: Docteur es, Informatique, 2013, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2013TELE0009

►

Un nombre croissant d’applications graphiques 3D ont un impact sur notre société. Ces applications sont utilisées dans plusieurs domaines allant des produits de divertissement numérique,… (more)

Subjects/Keywords: Modèles 3D; Noyau de la chaleur; Distance de diffusion; Distance de migration pendulaire; Graphes de Reeb; Indexation; Indexation partielle; Sacs de mots; 3D-models; Heat kernel; Diffusion distance; Commute time distance; Reeb graphs; Retrieval; Partial retrieval; Bag-of-features

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

El Khoury, R. (2013). Partial 3D-shape indexing and retrieval : Indexation partielle de modèles 3D. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2013TELE0009

Chicago Manual of Style (16^{th} Edition):

El Khoury, Rachid. “Partial 3D-shape indexing and retrieval : Indexation partielle de modèles 3D.” 2013. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed August 04, 2020. http://www.theses.fr/2013TELE0009.

MLA Handbook (7^{th} Edition):

El Khoury, Rachid. “Partial 3D-shape indexing and retrieval : Indexation partielle de modèles 3D.” 2013. Web. 04 Aug 2020.

Vancouver:

El Khoury R. Partial 3D-shape indexing and retrieval : Indexation partielle de modèles 3D. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2013. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2013TELE0009.

Council of Science Editors:

El Khoury R. Partial 3D-shape indexing and retrieval : Indexation partielle de modèles 3D. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2013. Available from: http://www.theses.fr/2013TELE0009

14.
Takes, Frank Willem.
Algorithms for analyzing and mining real-world * graphs*.

Degree: 2014, Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University

URL: http://hdl.handle.net/1887/29764

► This thesis is about algorithms for analyzing large real-world *graphs* (or networks). Examples include (online) social networks, webgraphs, information networks, biological networks and scientific collaboration…
(more)

Subjects/Keywords: Graphs; Algorithms; Networks; Social networks; Diameter; Distance; Shortest paths; Graphs; Algorithms; Networks; Social networks; Diameter; Distance; Shortest paths

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Takes, F. W. (2014). Algorithms for analyzing and mining real-world graphs. (Doctoral Dissertation). Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University. Retrieved from http://hdl.handle.net/1887/29764

Chicago Manual of Style (16^{th} Edition):

Takes, Frank Willem. “Algorithms for analyzing and mining real-world graphs.” 2014. Doctoral Dissertation, Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University. Accessed August 04, 2020. http://hdl.handle.net/1887/29764.

MLA Handbook (7^{th} Edition):

Takes, Frank Willem. “Algorithms for analyzing and mining real-world graphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Takes FW. Algorithms for analyzing and mining real-world graphs. [Internet] [Doctoral dissertation]. Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/1887/29764.

Council of Science Editors:

Takes FW. Algorithms for analyzing and mining real-world graphs. [Doctoral Dissertation]. Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University; 2014. Available from: http://hdl.handle.net/1887/29764

15. Agarwal, Rachit. Low latency queries on big graph data.

Degree: PhD, 1200, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/46810

► The availability of large datasets and on-demand system capacity to analyze these datasets has led to exciting new applications in the context of big graph…
(more)

Subjects/Keywords: Big Data; Graphs; Social networks; Distance Oracles; Sparse Graphs; Internet; Social search and recommendation

…We start by informally defining exact and approximate *distance* queries on
*graphs*. We then… …of *distance* oracles, the cases of dense
and sparse *graphs* are quite different. In the dense… …*distance* oracles.
2.1 *Graphs*
We start with some basic definitions and terminologies related to… …6.2 ASAP Sketch and Queries . . . . . . . . . .
6.3 Unweighted *Graphs*… …85
86
87
92
95
98
110
Chapter 7 ShapeShifter: Shortest Paths on Dynamic *Graphs*
7.1…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Agarwal, R. (2014). Low latency queries on big graph data. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46810

Chicago Manual of Style (16^{th} Edition):

Agarwal, Rachit. “Low latency queries on big graph data.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 04, 2020. http://hdl.handle.net/2142/46810.

MLA Handbook (7^{th} Edition):

Agarwal, Rachit. “Low latency queries on big graph data.” 2014. Web. 04 Aug 2020.

Vancouver:

Agarwal R. Low latency queries on big graph data. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/2142/46810.

Council of Science Editors:

Agarwal R. Low latency queries on big graph data. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46810

16.
Bellitto, Thomas.
Walks, Transitions and Geometric Distances in *Graphs* : Marches, Transitions et Distances G´eom´etriques dans les Graphes.

Degree: Docteur es, Informatique, 2018, Bordeaux

URL: http://www.theses.fr/2018BORD0124

►

Cette thèse étudie les aspects combinatoires, algorithmiques et la complexité de problèmes de théorie des graphes, et tout spécialement de problèmes liés aux notions de… (more)

Subjects/Keywords: Graphes; Marches; Transitions interdites; Homomorphismes de graphes; Nombre de stabilité; Distances géometriques; Ensemble évitant la distance 1; NP-complétude; Graphs; Walks; Forbidden transitions; Graph homomorphisms; Independence number; Geometric distances; Sets avoiding distance 1; NP-completeness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bellitto, T. (2018). Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2018BORD0124

Chicago Manual of Style (16^{th} Edition):

Bellitto, Thomas. “Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.” 2018. Doctoral Dissertation, Bordeaux. Accessed August 04, 2020. http://www.theses.fr/2018BORD0124.

MLA Handbook (7^{th} Edition):

Bellitto, Thomas. “Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.” 2018. Web. 04 Aug 2020.

Vancouver:

Bellitto T. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. [Internet] [Doctoral dissertation]. Bordeaux; 2018. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2018BORD0124.

Council of Science Editors:

Bellitto T. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. [Doctoral Dissertation]. Bordeaux; 2018. Available from: http://www.theses.fr/2018BORD0124

17.
Moustrou, Philippe.
Geometric *distance* *graphs*, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes.

Degree: Docteur es, Mathématiques pures, 2017, Bordeaux

URL: http://www.theses.fr/2017BORD0802

►

Un graphe métrique G(X;D) est un graphe dont l’ensemble des sommets est l’ensemble X des points d’un espace métrique (X; d), et dont les arêtes… (more)

Subjects/Keywords: Graphes métriques; Réseaux Euclidiens; Empilement de sphères; Borne de Minkowski-Hlawka; Codes linéaires; Polytopes pavant l’espace par translation; Nombre chromatique; Distance graphs; Euclidean lattices; Sphere packing; Minkowski- Hlawka bound; Linear codes; Parallelohedra; Chromatic number

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Moustrou, P. (2017). Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2017BORD0802

Chicago Manual of Style (16^{th} Edition):

Moustrou, Philippe. “Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes.” 2017. Doctoral Dissertation, Bordeaux. Accessed August 04, 2020. http://www.theses.fr/2017BORD0802.

MLA Handbook (7^{th} Edition):

Moustrou, Philippe. “Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes.” 2017. Web. 04 Aug 2020.

Vancouver:

Moustrou P. Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes. [Internet] [Doctoral dissertation]. Bordeaux; 2017. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2017BORD0802.

Council of Science Editors:

Moustrou P. Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes. [Doctoral Dissertation]. Bordeaux; 2017. Available from: http://www.theses.fr/2017BORD0802

18. Qayyum, Shiraz. Effective and Efficient Communication and Collaboration in Participatory Environments.

Degree: PhD, 2015, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/8712

► Participatory environments pose significant challenges to deploying real applications. This dissertation investigates exploitation of opportunistic contacts to enable effective and efficient data transfers in…
(more)

Subjects/Keywords: Contact duration; Logistic regression; Mobility estimation; Opportunistic networks; Temporal distance; Time varying graphs

…approaches . . . . . . . . . . . . . . . . . . . . . . . 13
2.2.4
Time varying *graphs*… …Instantaneous *Distance* . . . . . . . . . . . . . . . . . . . . . . . . 23
Data Rate Profile… …69
5.3.4
Temporal *distance* . . . . . . . . . . . . . . . . . . . . . . . . . . 69
5.3.5… …Direction estimation . . . . . . . . . . . . . . . . . . . . . . . . . 87
5.8.3
*Distance*… …on an Android framework . . . . . 83
5.6
Direction and *distance* estimation…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Qayyum, S. (2015). Effective and Efficient Communication and Collaboration in Participatory Environments. (Doctoral Dissertation). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/8712

Chicago Manual of Style (16^{th} Edition):

Qayyum, Shiraz. “Effective and Efficient Communication and Collaboration in Participatory Environments.” 2015. Doctoral Dissertation, Rochester Institute of Technology. Accessed August 04, 2020. https://scholarworks.rit.edu/theses/8712.

MLA Handbook (7^{th} Edition):

Qayyum, Shiraz. “Effective and Efficient Communication and Collaboration in Participatory Environments.” 2015. Web. 04 Aug 2020.

Vancouver:

Qayyum S. Effective and Efficient Communication and Collaboration in Participatory Environments. [Internet] [Doctoral dissertation]. Rochester Institute of Technology; 2015. [cited 2020 Aug 04]. Available from: https://scholarworks.rit.edu/theses/8712.

Council of Science Editors:

Qayyum S. Effective and Efficient Communication and Collaboration in Participatory Environments. [Doctoral Dissertation]. Rochester Institute of Technology; 2015. Available from: https://scholarworks.rit.edu/theses/8712

19.
Heysse, Kristin Elizabeth.
Constructions for cospectral *graphs* for the normalized Laplacian matrix and *distance* matrix.

Degree: 2017, Iowa State University

URL: https://lib.dr.iastate.edu/etd/15319

► In discrete mathematics, a graph is a representation of relationships between objects. Using linear algebraic techniques, we can encode a graph into a matrix. However,…
(more)

Subjects/Keywords: cospectral graphs; distance matrix; normalized Laplacian matrix; spectral graph theory; Mathematics

…the row for D omitted. The question of bipartite
*distance* cospectral *graphs* is discussed… …polynomials are equal.
Chapter 3 contains the paper “A construction for *distance* cospectral *graphs*… …x5B;12], submitted. In this paper, I consider creating *distance* cospectral *graphs* in… …two different ways. The
first creates *distance* cospectral *graphs* of varying edge counts by a… …are valid toggling modules.
28
CHAPTER 3.
A CONSTRUCTION FOR *DISTANCE* COSPECTRAL
*GRAPHS*…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Heysse, K. E. (2017). Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15319

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Heysse, Kristin Elizabeth. “Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix.” 2017. Thesis, Iowa State University. Accessed August 04, 2020. https://lib.dr.iastate.edu/etd/15319.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Heysse, Kristin Elizabeth. “Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix.” 2017. Web. 04 Aug 2020.

Vancouver:

Heysse KE. Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix. [Internet] [Thesis]. Iowa State University; 2017. [cited 2020 Aug 04]. Available from: https://lib.dr.iastate.edu/etd/15319.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Heysse KE. Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix. [Thesis]. Iowa State University; 2017. Available from: https://lib.dr.iastate.edu/etd/15319

Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

20. Malema, Gabofetswe Alafang. Low-density parity-check codes : construction and implementation.

Degree: 2007, University of Adelaide

URL: http://hdl.handle.net/2440/45525

► Low-density parity-check (LDPC) codes have been shown to have good error correcting performance approaching Shannon’s limit. Good error correcting performance enables efficient and reliable communication.…
(more)

Subjects/Keywords: LDPC codes; quasi-cyclic codes; girth; distance graphs; overlapping techniques; LDPC decoder; Error-correcting codes (Information theory) Coding theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Malema, G. A. (2007). Low-density parity-check codes : construction and implementation. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/45525

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Malema, Gabofetswe Alafang. “Low-density parity-check codes : construction and implementation.” 2007. Thesis, University of Adelaide. Accessed August 04, 2020. http://hdl.handle.net/2440/45525.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Malema, Gabofetswe Alafang. “Low-density parity-check codes : construction and implementation.” 2007. Web. 04 Aug 2020.

Vancouver:

Malema GA. Low-density parity-check codes : construction and implementation. [Internet] [Thesis]. University of Adelaide; 2007. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/2440/45525.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Malema GA. Low-density parity-check codes : construction and implementation. [Thesis]. University of Adelaide; 2007. Available from: http://hdl.handle.net/2440/45525

Not specified: Masters Thesis or Doctoral Dissertation

21.
Reiswig, Josiah.
A Few Problems on the Steiner *Distance* and Crossing Number of * Graphs*.

Degree: PhD, Mathematics, 2019, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/5386

► We provide a brief overview of the Steiner ratio problem in its original Euclidean context and briefly discuss the problem in other metric spaces.…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Steiner; ratio; distance; graphs; crossing numbers

…x28;mostly) avoid
finding Steiner trees.
7
Chapter 2
The Steiner *Distance* in *Graphs*… …previous proof . . . . . . . . . . . . . . . . . . . . . . .
33
Chapter 4 Steiner *Distance* of… …to metric spaces beyond the Euclidean
plane. A metric space is a set X with a *distance*… …been examined with
respect to weighted *graphs* [10], the rectangular metric space… …the Steiner tree problem in *graphs*
was included in Karp’s original list of NP-complete…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Reiswig, J. (2019). A Few Problems on the Steiner Distance and Crossing Number of Graphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/5386

Chicago Manual of Style (16^{th} Edition):

Reiswig, Josiah. “A Few Problems on the Steiner Distance and Crossing Number of Graphs.” 2019. Doctoral Dissertation, University of South Carolina. Accessed August 04, 2020. https://scholarcommons.sc.edu/etd/5386.

MLA Handbook (7^{th} Edition):

Reiswig, Josiah. “A Few Problems on the Steiner Distance and Crossing Number of Graphs.” 2019. Web. 04 Aug 2020.

Vancouver:

Reiswig J. A Few Problems on the Steiner Distance and Crossing Number of Graphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2019. [cited 2020 Aug 04]. Available from: https://scholarcommons.sc.edu/etd/5386.

Council of Science Editors:

Reiswig J. A Few Problems on the Steiner Distance and Crossing Number of Graphs. [Doctoral Dissertation]. University of South Carolina; 2019. Available from: https://scholarcommons.sc.edu/etd/5386

22. Planche, Léo. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Research of new major genetic mutations in Crohn's disease.

Degree: Docteur es, Mathématiques informatique, 2018, Sorbonne Paris Cité

URL: http://www.theses.fr/2018USPCB224

►

En collaboration avec des chercheurs en biologie à Jussieu, nous étudions des graphes issus de données biologiques afin de d'en améliorer la compréhension. Ces graphes… (more)

Subjects/Keywords: Théorie des graphes; Cycle isométrique; Excentricité; Plus court chemin; Domination; Graphe de reads; Label de distances; Laminaire; Graph theory; Isometric cycle; Eccentricity; Shortest path; Domination; Read graphs; Distance labeling; Laminarity; 511.5

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Planche, L. (2018). Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Research of new major genetic mutations in Crohn's disease. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2018USPCB224

Chicago Manual of Style (16^{th} Edition):

Planche, Léo. “Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Research of new major genetic mutations in Crohn's disease.” 2018. Doctoral Dissertation, Sorbonne Paris Cité. Accessed August 04, 2020. http://www.theses.fr/2018USPCB224.

MLA Handbook (7^{th} Edition):

Planche, Léo. “Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Research of new major genetic mutations in Crohn's disease.” 2018. Web. 04 Aug 2020.

Vancouver:

Planche L. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Research of new major genetic mutations in Crohn's disease. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2018. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2018USPCB224.

Council of Science Editors:

Planche L. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Research of new major genetic mutations in Crohn's disease. [Doctoral Dissertation]. Sorbonne Paris Cité; 2018. Available from: http://www.theses.fr/2018USPCB224

University of Florida

23.
Riddle, Fay Aycock, 1949-.
Bivariegated *graphs* and their isomorphisms.

Degree: University of Florida

URL: https://ufdc.ufl.edu/UF00098915

Subjects/Keywords: Automorphisms; Distance functions; Graduates; Graph theory; Isomorphism; Line graphs; Mathematics; Permutations; Semigroups; Vertices; Graphic methods; Mathematics thesis Ph. D

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Riddle, Fay Aycock, 1. (n.d.). Bivariegated graphs and their isomorphisms. (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/UF00098915

Note: this citation may be lacking information needed for this citation format:

No year of publication.

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Riddle, Fay Aycock, 1949-. “Bivariegated graphs and their isomorphisms.” Thesis, University of Florida. Accessed August 04, 2020. https://ufdc.ufl.edu/UF00098915.

Note: this citation may be lacking information needed for this citation format:

No year of publication.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Riddle, Fay Aycock, 1949-. “Bivariegated graphs and their isomorphisms.” Web. 04 Aug 2020.

Note: this citation may be lacking information needed for this citation format:

No year of publication.

Vancouver:

Riddle, Fay Aycock 1. Bivariegated graphs and their isomorphisms. [Internet] [Thesis]. University of Florida; [cited 2020 Aug 04]. Available from: https://ufdc.ufl.edu/UF00098915.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

No year of publication.

Council of Science Editors:

Riddle, Fay Aycock 1. Bivariegated graphs and their isomorphisms. [Thesis]. University of Florida; Available from: https://ufdc.ufl.edu/UF00098915

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

No year of publication.

University of Florida

24. Osteen, Robert Ernest, 1936-. Algebras of covers.

Degree: 1980, University of Florida

URL: https://ufdc.ufl.edu/AA00003472

Subjects/Keywords: Algebra; Binary relations; Cardinality; Conceptual lattices; Distance functions; Industrial refining; Line graphs; Mathematics; Partially ordered sets; Rectangles; Graph theory; Mappings (Mathematics); Set theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Osteen, Robert Ernest, 1. (1980). Algebras of covers. (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/AA00003472

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Osteen, Robert Ernest, 1936-. “Algebras of covers.” 1980. Thesis, University of Florida. Accessed August 04, 2020. https://ufdc.ufl.edu/AA00003472.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Osteen, Robert Ernest, 1936-. “Algebras of covers.” 1980. Web. 04 Aug 2020.

Vancouver:

Osteen, Robert Ernest 1. Algebras of covers. [Internet] [Thesis]. University of Florida; 1980. [cited 2020 Aug 04]. Available from: https://ufdc.ufl.edu/AA00003472.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Osteen, Robert Ernest 1. Algebras of covers. [Thesis]. University of Florida; 1980. Available from: https://ufdc.ufl.edu/AA00003472

Not specified: Masters Thesis or Doctoral Dissertation

25.
Peterson, Nicholas Richard.
On Random k-Out *Graphs* with Preferential Attachment.

Degree: PhD, Mathematics, 2013, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839

► In a series of papers, Hansen and Jaworski explored a very general model for choosing random mappings with exchangeable in-degrees. The special case in which…
(more)

Subjects/Keywords: Mathematics; Combinatorial probability; random graphs; random mappings; Hansen and Jaworski; digraphs; functional digraph; vertex connectivity; minimum vertex degree; k-core; total variation distance

…1.2
1.3
1.4
1.5
1.6
1.7
2
3
PAGE
Background: k-Out *Graphs* . . . . . .
Background… …Background: k-Out *Graphs*
In the study of random *graphs*, two (closely related) models… …x28;n, M ) is chosen uniformly
at random from the set of all *graphs* with vertex set… …15] that initiated the study of random
*graphs*. The model G(n, p), often… …of these random *graphs* is that necessary but
insuﬃcient conditions for complicated graph…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Peterson, N. R. (2013). On Random k-Out Graphs with Preferential Attachment. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839

Chicago Manual of Style (16^{th} Edition):

Peterson, Nicholas Richard. “On Random k-Out Graphs with Preferential Attachment.” 2013. Doctoral Dissertation, The Ohio State University. Accessed August 04, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839.

MLA Handbook (7^{th} Edition):

Peterson, Nicholas Richard. “On Random k-Out Graphs with Preferential Attachment.” 2013. Web. 04 Aug 2020.

Vancouver:

Peterson NR. On Random k-Out Graphs with Preferential Attachment. [Internet] [Doctoral dissertation]. The Ohio State University; 2013. [cited 2020 Aug 04]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839.

Council of Science Editors:

Peterson NR. On Random k-Out Graphs with Preferential Attachment. [Doctoral Dissertation]. The Ohio State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839

Brno University of Technology

26. Částek, Petr. Identifikace obličeje: Face Identification.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/53178

► This document is trying to introduce the reader with issues of identifying the face connected with miscellaneous scanning technologies and enviroments. Inside this document there…
(more)

Subjects/Keywords: identifikace obličeje; verifikace obličeje; popis rysů obličeje; strukturální metody; holistický přístup; normalizace; počítačové vidění; indexování; hashování; Analýza hlavních komponent (PCA); Diskriminační analýza (LDA); elastické shlukovací grafy; jet; strom; vzdálenost; identification of a face; verification of a face; definition of characteristics of a face; structural methods; holistic stance; normalization; computer sight; indexing; hashing; the analysis of main components; the discriminational analysis; the elastical clumpsing graphs; distance

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Částek, P. (2019). Identifikace obličeje: Face Identification. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53178

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Částek, Petr. “Identifikace obličeje: Face Identification.” 2019. Thesis, Brno University of Technology. Accessed August 04, 2020. http://hdl.handle.net/11012/53178.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Částek, Petr. “Identifikace obličeje: Face Identification.” 2019. Web. 04 Aug 2020.

Vancouver:

Částek P. Identifikace obličeje: Face Identification. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/11012/53178.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Částek P. Identifikace obličeje: Face Identification. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53178

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

27. Částek, Petr. Identifikace obličeje: Face Identification.

Degree: 2020, Brno University of Technology

URL: http://hdl.handle.net/11012/188650

► This document is trying to introduce the reader with issues of identifying the face connected with miscellaneous scanning technologies and enviroments. Inside this document there…
(more)

Subjects/Keywords: identifikace obličeje; verifikace obličeje; popis rysů obličeje; strukturální metody; holistický přístup; normalizace; počítačové vidění; indexování; hashování; Analýza hlavních komponent (PCA); Diskriminační analýza (LDA); elastické shlukovací grafy; jet; strom; vzdálenost; identification of a face; verification of a face; definition of characteristics of a face; structural methods; holistic stance; normalization; computer sight; indexing; hashing; the analysis of main components; the discriminational analysis; the elastical clumpsing graphs; distance

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Částek, P. (2020). Identifikace obličeje: Face Identification. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/188650

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Částek, Petr. “Identifikace obličeje: Face Identification.” 2020. Thesis, Brno University of Technology. Accessed August 04, 2020. http://hdl.handle.net/11012/188650.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Částek, Petr. “Identifikace obličeje: Face Identification.” 2020. Web. 04 Aug 2020.

Vancouver:

Částek P. Identifikace obličeje: Face Identification. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/11012/188650.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Částek P. Identifikace obličeje: Face Identification. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/188650

Not specified: Masters Thesis or Doctoral Dissertation