Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( Spectral graph theory). Showing records 1 – 30 of 67107 total matches.

[1] [2] [3] [4] [5] … [2237]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Hong Kong University of Science and Technology

1. Liu, Xiaogang. Spectral characterization and spectral estimation of some graphs.

Degree: 2011, Hong Kong University of Science and Technology

 This thesis studies two subjects. One is the spectral characterization problem, the other is the spectral estimation probelm. For the former, we mainly investigate the… (more)

Subjects/Keywords: Graph theory ; Spectral theory (Mathematics) ; Estimation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, X. (2011). Spectral characterization and spectral estimation of some graphs. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed July 16, 2020. http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Web. 16 Jul 2020.

Vancouver:

Liu X. Spectral characterization and spectral estimation of some graphs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2020 Jul 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu X. Spectral characterization and spectral estimation of some graphs. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

2. Bot, Fanny (author). A graph-matching approach to indoor localization: using a mobile device and a reference BIM.

Degree: 2019, Delft University of Technology

 Indoor localization provides for a much researched subject, as the complexity and size of many public buildings require extensive and properly designed methods to facilitate… (more)

Subjects/Keywords: Indoor Localization; Spectral Graph Theory; Graph Matching; Mobile Device

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bot, F. (. (2019). A graph-matching approach to indoor localization: using a mobile device and a reference BIM. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000

Chicago Manual of Style (16th Edition):

Bot, Fanny (author). “A graph-matching approach to indoor localization: using a mobile device and a reference BIM.” 2019. Masters Thesis, Delft University of Technology. Accessed July 16, 2020. http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000.

MLA Handbook (7th Edition):

Bot, Fanny (author). “A graph-matching approach to indoor localization: using a mobile device and a reference BIM.” 2019. Web. 16 Jul 2020.

Vancouver:

Bot F(. A graph-matching approach to indoor localization: using a mobile device and a reference BIM. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Jul 16]. Available from: http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000.

Council of Science Editors:

Bot F(. A graph-matching approach to indoor localization: using a mobile device and a reference BIM. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000


University of Johannesburg

3. Garner, Charles R. Investigations into the ranks of regular graphs.

Degree: PhD, 2012, University of Johannesburg

 In this thesis, the ranks of many types of regular and strongly regular graphs are determined. Also determined are ranks of regular graphs under unary… (more)

Subjects/Keywords: Graph theory; Graphic methods; Spectral theory (Mathematics); Eigenvalues

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garner, C. R. (2012). Investigations into the ranks of regular graphs. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6069

Chicago Manual of Style (16th Edition):

Garner, Charles R. “Investigations into the ranks of regular graphs.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed July 16, 2020. http://hdl.handle.net/10210/6069.

MLA Handbook (7th Edition):

Garner, Charles R. “Investigations into the ranks of regular graphs.” 2012. Web. 16 Jul 2020.

Vancouver:

Garner CR. Investigations into the ranks of regular graphs. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10210/6069.

Council of Science Editors:

Garner CR. Investigations into the ranks of regular graphs. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6069


East Tennessee State University

4. Witt, Walter G. Quantifying the Structure of Misfolded Proteins Using Graph Theory.

Degree: MS, Mathematical Sciences, 2017, East Tennessee State University

  The structure of a protein molecule is highly correlated to its function. Some diseases such as cystic fibrosis are the result of a change… (more)

Subjects/Keywords: mathematical biology; graph theory; proteins; spectral clustering; computational biology; nest graph model; Other Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Witt, W. G. (2017). Quantifying the Structure of Misfolded Proteins Using Graph Theory. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3244

Chicago Manual of Style (16th Edition):

Witt, Walter G. “Quantifying the Structure of Misfolded Proteins Using Graph Theory.” 2017. Masters Thesis, East Tennessee State University. Accessed July 16, 2020. https://dc.etsu.edu/etd/3244.

MLA Handbook (7th Edition):

Witt, Walter G. “Quantifying the Structure of Misfolded Proteins Using Graph Theory.” 2017. Web. 16 Jul 2020.

Vancouver:

Witt WG. Quantifying the Structure of Misfolded Proteins Using Graph Theory. [Internet] [Masters thesis]. East Tennessee State University; 2017. [cited 2020 Jul 16]. Available from: https://dc.etsu.edu/etd/3244.

Council of Science Editors:

Witt WG. Quantifying the Structure of Misfolded Proteins Using Graph Theory. [Masters Thesis]. East Tennessee State University; 2017. Available from: https://dc.etsu.edu/etd/3244


University of Manchester

5. Quiros Tortos, Jairo. Application of graph theory to intentional controlled islanding for blackout prevention and system sectionalising for parallel restoration.

Degree: PhD, 2014, University of Manchester

 This thesis investigates the application of graph theory to Intentional Controlled Islanding (ICI) for blackout prevention and system sectionalising for Parallel Power System Restoration (PPSR).… (more)

Subjects/Keywords: Spectral Graph Clustering; Parallel Power System Restoration; Intentional Controlled Islanding; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quiros Tortos, J. (2014). Application of graph theory to intentional controlled islanding for blackout prevention and system sectionalising for parallel restoration. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/application-of-graph-theory-to-intentional-controlled-islanding-for-blackout-prevention-and-system-sectionalising-for-parallel-restoration(00d7591d-5498-4aa3-b871-c0a771fd1663).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.779546

Chicago Manual of Style (16th Edition):

Quiros Tortos, Jairo. “Application of graph theory to intentional controlled islanding for blackout prevention and system sectionalising for parallel restoration.” 2014. Doctoral Dissertation, University of Manchester. Accessed July 16, 2020. https://www.research.manchester.ac.uk/portal/en/theses/application-of-graph-theory-to-intentional-controlled-islanding-for-blackout-prevention-and-system-sectionalising-for-parallel-restoration(00d7591d-5498-4aa3-b871-c0a771fd1663).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.779546.

MLA Handbook (7th Edition):

Quiros Tortos, Jairo. “Application of graph theory to intentional controlled islanding for blackout prevention and system sectionalising for parallel restoration.” 2014. Web. 16 Jul 2020.

Vancouver:

Quiros Tortos J. Application of graph theory to intentional controlled islanding for blackout prevention and system sectionalising for parallel restoration. [Internet] [Doctoral dissertation]. University of Manchester; 2014. [cited 2020 Jul 16]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/application-of-graph-theory-to-intentional-controlled-islanding-for-blackout-prevention-and-system-sectionalising-for-parallel-restoration(00d7591d-5498-4aa3-b871-c0a771fd1663).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.779546.

Council of Science Editors:

Quiros Tortos J. Application of graph theory to intentional controlled islanding for blackout prevention and system sectionalising for parallel restoration. [Doctoral Dissertation]. University of Manchester; 2014. Available from: https://www.research.manchester.ac.uk/portal/en/theses/application-of-graph-theory-to-intentional-controlled-islanding-for-blackout-prevention-and-system-sectionalising-for-parallel-restoration(00d7591d-5498-4aa3-b871-c0a771fd1663).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.779546


University of Manchester

6. Quiros Tortos, Jairo Humberto. Application of Graph Theory to Intentional Controlled Islanding for Blackout Prevention and System Sectionalising for Parallel Restoration.

Degree: 2014, University of Manchester

 This thesis investigates the application of graph theory to Intentional Controlled Islanding (ICI) for blackout prevention and system sectionalising for Parallel Power System Restoration (PPSR).… (more)

Subjects/Keywords: Graph Theory; Intentional Controlled Islanding; Parallel Power System Restoration; Spectral Graph Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quiros Tortos, J. H. (2014). Application of Graph Theory to Intentional Controlled Islanding for Blackout Prevention and System Sectionalising for Parallel Restoration. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:227024

Chicago Manual of Style (16th Edition):

Quiros Tortos, Jairo Humberto. “Application of Graph Theory to Intentional Controlled Islanding for Blackout Prevention and System Sectionalising for Parallel Restoration.” 2014. Doctoral Dissertation, University of Manchester. Accessed July 16, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:227024.

MLA Handbook (7th Edition):

Quiros Tortos, Jairo Humberto. “Application of Graph Theory to Intentional Controlled Islanding for Blackout Prevention and System Sectionalising for Parallel Restoration.” 2014. Web. 16 Jul 2020.

Vancouver:

Quiros Tortos JH. Application of Graph Theory to Intentional Controlled Islanding for Blackout Prevention and System Sectionalising for Parallel Restoration. [Internet] [Doctoral dissertation]. University of Manchester; 2014. [cited 2020 Jul 16]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:227024.

Council of Science Editors:

Quiros Tortos JH. Application of Graph Theory to Intentional Controlled Islanding for Blackout Prevention and System Sectionalising for Parallel Restoration. [Doctoral Dissertation]. University of Manchester; 2014. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:227024


Rice University

7. Mikesell, Derek Justin. A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models.

Degree: MA, Engineering, 2016, Rice University

 Given a network G=(V,E), consider the problem of selecting a subset of nodes, A, of a fixed size, k, such that the sum expected walk… (more)

Subjects/Keywords: Graph Theory; Hitting Set; Consensus Model; Spectral; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mikesell, D. J. (2016). A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/95559

Chicago Manual of Style (16th Edition):

Mikesell, Derek Justin. “A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models.” 2016. Masters Thesis, Rice University. Accessed July 16, 2020. http://hdl.handle.net/1911/95559.

MLA Handbook (7th Edition):

Mikesell, Derek Justin. “A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models.” 2016. Web. 16 Jul 2020.

Vancouver:

Mikesell DJ. A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models. [Internet] [Masters thesis]. Rice University; 2016. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/1911/95559.

Council of Science Editors:

Mikesell DJ. A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models. [Masters Thesis]. Rice University; 2016. Available from: http://hdl.handle.net/1911/95559


University of Washington

8. Southerland, Joshua. The Laplacian: An Exploration and Historical Survey Tailored for Translation Surfaces.

Degree: 2019, University of Washington

 This thesis is a historical survey of the Laplacian as an operator on L2-functions specifically geared towards building the understanding necessary to define a Laplacian… (more)

Subjects/Keywords: Geometric Analysis; Graph Theory; Laplacian; Representation Theory; Spectral Theory; Translation Surfaces; Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Southerland, J. (2019). The Laplacian: An Exploration and Historical Survey Tailored for Translation Surfaces. (Thesis). University of Washington. Retrieved from http://hdl.handle.net/1773/44368

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Southerland, Joshua. “The Laplacian: An Exploration and Historical Survey Tailored for Translation Surfaces.” 2019. Thesis, University of Washington. Accessed July 16, 2020. http://hdl.handle.net/1773/44368.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Southerland, Joshua. “The Laplacian: An Exploration and Historical Survey Tailored for Translation Surfaces.” 2019. Web. 16 Jul 2020.

Vancouver:

Southerland J. The Laplacian: An Exploration and Historical Survey Tailored for Translation Surfaces. [Internet] [Thesis]. University of Washington; 2019. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/1773/44368.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Southerland J. The Laplacian: An Exploration and Historical Survey Tailored for Translation Surfaces. [Thesis]. University of Washington; 2019. Available from: http://hdl.handle.net/1773/44368

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

9. Devriendt, Karel (author). Structure and dynamics of complex networks: Network epidemics and a geometric robustness measure.

Degree: 2017, Delft University of Technology

 As new technologies continue to find their way into everyday life, the world becomes more and more connected. Airplanes and other means of transportation provide… (more)

Subjects/Keywords: complex networks; SIS epidemics; mean-field theory; network robustness; effective resistance; spectral graph theory; Laplacian matrix; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Devriendt, K. (. (2017). Structure and dynamics of complex networks: Network epidemics and a geometric robustness measure. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:00b2ef38-02d0-4bf2-90ef-bfc38f928da8

Chicago Manual of Style (16th Edition):

Devriendt, Karel (author). “Structure and dynamics of complex networks: Network epidemics and a geometric robustness measure.” 2017. Masters Thesis, Delft University of Technology. Accessed July 16, 2020. http://resolver.tudelft.nl/uuid:00b2ef38-02d0-4bf2-90ef-bfc38f928da8.

MLA Handbook (7th Edition):

Devriendt, Karel (author). “Structure and dynamics of complex networks: Network epidemics and a geometric robustness measure.” 2017. Web. 16 Jul 2020.

Vancouver:

Devriendt K(. Structure and dynamics of complex networks: Network epidemics and a geometric robustness measure. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2020 Jul 16]. Available from: http://resolver.tudelft.nl/uuid:00b2ef38-02d0-4bf2-90ef-bfc38f928da8.

Council of Science Editors:

Devriendt K(. Structure and dynamics of complex networks: Network epidemics and a geometric robustness measure. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:00b2ef38-02d0-4bf2-90ef-bfc38f928da8


Northeastern University

10. Nazari, Sam. Robust Fault Detection And Network Resilience.

Degree: PhD, Department of Electrical and Computer Engineering, 2019, Northeastern University

 This dissertation summarizes the results of my doctoral studies in robust fault detection and network resilience in distributed dynamic systems. In this endeavor, my main… (more)

Subjects/Keywords: Control Theory; Fault Detection; Positive Systems; Spectral Graph Theory; Mathematics; Electrical engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nazari, S. (2019). Robust Fault Detection And Network Resilience. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20323960

Chicago Manual of Style (16th Edition):

Nazari, Sam. “Robust Fault Detection And Network Resilience.” 2019. Doctoral Dissertation, Northeastern University. Accessed July 16, 2020. http://hdl.handle.net/2047/D20323960.

MLA Handbook (7th Edition):

Nazari, Sam. “Robust Fault Detection And Network Resilience.” 2019. Web. 16 Jul 2020.

Vancouver:

Nazari S. Robust Fault Detection And Network Resilience. [Internet] [Doctoral dissertation]. Northeastern University; 2019. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2047/D20323960.

Council of Science Editors:

Nazari S. Robust Fault Detection And Network Resilience. [Doctoral Dissertation]. Northeastern University; 2019. Available from: http://hdl.handle.net/2047/D20323960


University of Colorado

11. Monnig, Nathan D. From Nonlinear Embedding to Graph Distances: A Spectral Perspective.

Degree: PhD, Applied Mathematics, 2015, University of Colorado

  In this thesis, we explore applications of spectral graph theory to the analysis of complex datasets and networks. We consider spectral embeddings of general… (more)

Subjects/Keywords: effective resistance; graph distances; graph theory; nonlinear dimension reduction; radial basis functions; spectral algorithms; Numerical Analysis and Computation; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monnig, N. D. (2015). From Nonlinear Embedding to Graph Distances: A Spectral Perspective. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/64

Chicago Manual of Style (16th Edition):

Monnig, Nathan D. “From Nonlinear Embedding to Graph Distances: A Spectral Perspective.” 2015. Doctoral Dissertation, University of Colorado. Accessed July 16, 2020. https://scholar.colorado.edu/appm_gradetds/64.

MLA Handbook (7th Edition):

Monnig, Nathan D. “From Nonlinear Embedding to Graph Distances: A Spectral Perspective.” 2015. Web. 16 Jul 2020.

Vancouver:

Monnig ND. From Nonlinear Embedding to Graph Distances: A Spectral Perspective. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2020 Jul 16]. Available from: https://scholar.colorado.edu/appm_gradetds/64.

Council of Science Editors:

Monnig ND. From Nonlinear Embedding to Graph Distances: A Spectral Perspective. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/appm_gradetds/64


Universidade do Rio Grande do Sul

12. Oliveira, Alessandro Bof de. Descritor de forma 2D baseado em redes complexas e teoria espectral de grafos.

Degree: 2016, Universidade do Rio Grande do Sul

A identificação de formas apresenta inúmeras aplicações na área de visão computacional, pois representa uma poderosa ferramenta para analisar as características de um objeto. Dentre… (more)

Subjects/Keywords: Computação gráfica; Image processing; 2D shape; Processamento : Imagem; Grafos; Spectral graph theory; Complex network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oliveira, A. B. d. (2016). Descritor de forma 2D baseado em redes complexas e teoria espectral de grafos. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/134397

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oliveira, Alessandro Bof de. “Descritor de forma 2D baseado em redes complexas e teoria espectral de grafos.” 2016. Thesis, Universidade do Rio Grande do Sul. Accessed July 16, 2020. http://hdl.handle.net/10183/134397.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oliveira, Alessandro Bof de. “Descritor de forma 2D baseado em redes complexas e teoria espectral de grafos.” 2016. Web. 16 Jul 2020.

Vancouver:

Oliveira ABd. Descritor de forma 2D baseado em redes complexas e teoria espectral de grafos. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2016. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10183/134397.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira ABd. Descritor de forma 2D baseado em redes complexas e teoria espectral de grafos. [Thesis]. Universidade do Rio Grande do Sul; 2016. Available from: http://hdl.handle.net/10183/134397

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Carnegie Mellon University

13. Peng, Richard. Algorithm Design Using Spectral Graph Theory.

Degree: 2013, Carnegie Mellon University

Spectral graph theory is the interplay between linear algebra and combinatorial graph theory. Laplace’s equation and its discrete form, the Laplacian matrix, appear ubiquitously in… (more)

Subjects/Keywords: Combinatorial Preconditioning; Linear System Solvers; Spectral Graph Theory; Parallel Algorithms; Low Stretch Embeddings; Image Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peng, R. (2013). Algorithm Design Using Spectral Graph Theory. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/277

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Peng, Richard. “Algorithm Design Using Spectral Graph Theory.” 2013. Thesis, Carnegie Mellon University. Accessed July 16, 2020. http://repository.cmu.edu/dissertations/277.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Peng, Richard. “Algorithm Design Using Spectral Graph Theory.” 2013. Web. 16 Jul 2020.

Vancouver:

Peng R. Algorithm Design Using Spectral Graph Theory. [Internet] [Thesis]. Carnegie Mellon University; 2013. [cited 2020 Jul 16]. Available from: http://repository.cmu.edu/dissertations/277.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Peng R. Algorithm Design Using Spectral Graph Theory. [Thesis]. Carnegie Mellon University; 2013. Available from: http://repository.cmu.edu/dissertations/277

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Carnegie Mellon University

14. Kruzick, Stephen M. Optimal Graph Filter Design for Large-Scale Random Networks.

Degree: 2018, Carnegie Mellon University

Graph signal processing analyzes signals supported on the nodes of a network with respect to a shift operator matrix that conforms to the graph structure.… (more)

Subjects/Keywords: distributed average consensus; filter design; graph signal processing; random matrix theory; random networks; spectral asymptotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kruzick, S. M. (2018). Optimal Graph Filter Design for Large-Scale Random Networks. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/1165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kruzick, Stephen M. “Optimal Graph Filter Design for Large-Scale Random Networks.” 2018. Thesis, Carnegie Mellon University. Accessed July 16, 2020. http://repository.cmu.edu/dissertations/1165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kruzick, Stephen M. “Optimal Graph Filter Design for Large-Scale Random Networks.” 2018. Web. 16 Jul 2020.

Vancouver:

Kruzick SM. Optimal Graph Filter Design for Large-Scale Random Networks. [Internet] [Thesis]. Carnegie Mellon University; 2018. [cited 2020 Jul 16]. Available from: http://repository.cmu.edu/dissertations/1165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kruzick SM. Optimal Graph Filter Design for Large-Scale Random Networks. [Thesis]. Carnegie Mellon University; 2018. Available from: http://repository.cmu.edu/dissertations/1165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Delaware

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

Degree: 2018, University of Delaware

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

McGinnis M. Combinatorial and spectral properties of graphs and association schemes . [Internet] [Doctoral dissertation]. University of Delaware; 2018. [cited 2020 Jul 16]. 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

16. Behmo, Régis. Visual feature graphs and image recognition : Graphes d'attributs et reconnaissance d'images.

Degree: Docteur es, Traitement d'images - mathématiques appliquées, 2010, Châtenay-Malabry, Ecole centrale de Paris

La problèmatique dont nous nous occupons dans cette thèse est la classification automatique d'images bidimensionnelles, ainsi que la détection d'objets génériques dans des images. Les… (more)

Subjects/Keywords: Reconnaissance visuelle; Classification d'images; Théorie spectrale des graphes; Visual recognition; Image classification; Spectral graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Behmo, R. (2010). Visual feature graphs and image recognition : Graphes d'attributs et reconnaissance d'images. (Doctoral Dissertation). Châtenay-Malabry, Ecole centrale de Paris. Retrieved from http://www.theses.fr/2010ECAP0026

Chicago Manual of Style (16th Edition):

Behmo, Régis. “Visual feature graphs and image recognition : Graphes d'attributs et reconnaissance d'images.” 2010. Doctoral Dissertation, Châtenay-Malabry, Ecole centrale de Paris. Accessed July 16, 2020. http://www.theses.fr/2010ECAP0026.

MLA Handbook (7th Edition):

Behmo, Régis. “Visual feature graphs and image recognition : Graphes d'attributs et reconnaissance d'images.” 2010. Web. 16 Jul 2020.

Vancouver:

Behmo R. Visual feature graphs and image recognition : Graphes d'attributs et reconnaissance d'images. [Internet] [Doctoral dissertation]. Châtenay-Malabry, Ecole centrale de Paris; 2010. [cited 2020 Jul 16]. Available from: http://www.theses.fr/2010ECAP0026.

Council of Science Editors:

Behmo R. Visual feature graphs and image recognition : Graphes d'attributs et reconnaissance d'images. [Doctoral Dissertation]. Châtenay-Malabry, Ecole centrale de Paris; 2010. Available from: http://www.theses.fr/2010ECAP0026

17. Nelsen, Lauren Morey. Applications of Geometric and Spectral Methods in Graph Theory.

Degree: PhD, Mathematics, 2019, U of Denver

  Networks, or graphs, are useful for studying many things in today’s world. Graphs can be used to represent connections on social media, transportation networks,… (more)

Subjects/Keywords: Probabilistic method; Spectral graph theory; Graphs; Graph curvature; Geometry and Topology; Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelsen, L. M. (2019). Applications of Geometric and Spectral Methods in Graph Theory. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1607

Chicago Manual of Style (16th Edition):

Nelsen, Lauren Morey. “Applications of Geometric and Spectral Methods in Graph Theory.” 2019. Doctoral Dissertation, U of Denver. Accessed July 16, 2020. https://digitalcommons.du.edu/etd/1607.

MLA Handbook (7th Edition):

Nelsen, Lauren Morey. “Applications of Geometric and Spectral Methods in Graph Theory.” 2019. Web. 16 Jul 2020.

Vancouver:

Nelsen LM. Applications of Geometric and Spectral Methods in Graph Theory. [Internet] [Doctoral dissertation]. U of Denver; 2019. [cited 2020 Jul 16]. Available from: https://digitalcommons.du.edu/etd/1607.

Council of Science Editors:

Nelsen LM. Applications of Geometric and Spectral Methods in Graph Theory. [Doctoral Dissertation]. U of Denver; 2019. Available from: https://digitalcommons.du.edu/etd/1607


Univerzitet u Beogradu

18. Mihailović, Bojana Lj., 1960-. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

Matematika - Spektralna teorija grafova / Mathematics - Spectral graph theory

Predmet ove disertacije pripada oblasti spektralne teorije grafova, mladoj grani matematičke kombinatorike, odnosno teorije… (more)

Subjects/Keywords: spectral graph theory; second largest eigenvalue; hereditary graph property; maximal graphs; minimal forbidden graphs; treelike graphs (cacti); reflexive graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mihailović, Bojana Lj., 1. (2018). Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mihailović, Bojana Lj., 1960-. “Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.” 2018. Thesis, Univerzitet u Beogradu. Accessed July 16, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mihailović, Bojana Lj., 1960-. “Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.” 2018. Web. 16 Jul 2020.

Vancouver:

Mihailović, Bojana Lj. 1. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2020 Jul 16]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mihailović, Bojana Lj. 1. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Sussman, Daniel Lewis. Foundations of Adjacency Spectral Embedding.

Degree: 2014, Johns Hopkins University

 The eigendecomposition of an adjacency matrix provides a way to embed a graph as points in finite dimensional Euclidean space. This embedding allows the full… (more)

Subjects/Keywords: graph; spectral decomposition; embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sussman, D. L. (2014). Foundations of Adjacency Spectral Embedding. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37075

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sussman, Daniel Lewis. “Foundations of Adjacency Spectral Embedding.” 2014. Thesis, Johns Hopkins University. Accessed July 16, 2020. http://jhir.library.jhu.edu/handle/1774.2/37075.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sussman, Daniel Lewis. “Foundations of Adjacency Spectral Embedding.” 2014. Web. 16 Jul 2020.

Vancouver:

Sussman DL. Foundations of Adjacency Spectral Embedding. [Internet] [Thesis]. Johns Hopkins University; 2014. [cited 2020 Jul 16]. Available from: http://jhir.library.jhu.edu/handle/1774.2/37075.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sussman DL. Foundations of Adjacency Spectral Embedding. [Thesis]. Johns Hopkins University; 2014. Available from: http://jhir.library.jhu.edu/handle/1774.2/37075

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Johannesburg

20. Desormeaux, Wyatt Jules. Total domination in graphs and graph modifications.

Degree: PhD, 2012, University of Johannesburg

 In this thesis, our primary objective is to investigate the effects that various graph modifications have on the total domination number of a graph. In… (more)

Subjects/Keywords: Graph theory; Domination (Graph theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Desormeaux, W. J. (2012). Total domination in graphs and graph modifications. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6158

Chicago Manual of Style (16th Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed July 16, 2020. http://hdl.handle.net/10210/6158.

MLA Handbook (7th Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Web. 16 Jul 2020.

Vancouver:

Desormeaux WJ. Total domination in graphs and graph modifications. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10210/6158.

Council of Science Editors:

Desormeaux WJ. Total domination in graphs and graph modifications. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6158

21. Parra Vogel, Daniel Alejandro. Théorie spectrale et de la diffusion pour les réseaux cristallins : Spectral and scattering theory for crystal lattices.

Degree: Docteur es, Mathématiques, 2017, Lyon

Dans cette thèse les théories spectrale et de la diffusion sur des graphes périodiques sont investigué. Le chapitre 1 présente des résultats de préservation de… (more)

Subjects/Keywords: Théorie spectrale; Théorie de la diffusion; Graphe périodique; Laplacien discret; Spectral theory; Scattering theory; Periodic graph; Discrete Laplacian; 511.33

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parra Vogel, D. A. (2017). Théorie spectrale et de la diffusion pour les réseaux cristallins : Spectral and scattering theory for crystal lattices. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSE1001

Chicago Manual of Style (16th Edition):

Parra Vogel, Daniel Alejandro. “Théorie spectrale et de la diffusion pour les réseaux cristallins : Spectral and scattering theory for crystal lattices.” 2017. Doctoral Dissertation, Lyon. Accessed July 16, 2020. http://www.theses.fr/2017LYSE1001.

MLA Handbook (7th Edition):

Parra Vogel, Daniel Alejandro. “Théorie spectrale et de la diffusion pour les réseaux cristallins : Spectral and scattering theory for crystal lattices.” 2017. Web. 16 Jul 2020.

Vancouver:

Parra Vogel DA. Théorie spectrale et de la diffusion pour les réseaux cristallins : Spectral and scattering theory for crystal lattices. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Jul 16]. Available from: http://www.theses.fr/2017LYSE1001.

Council of Science Editors:

Parra Vogel DA. Théorie spectrale et de la diffusion pour les réseaux cristallins : Spectral and scattering theory for crystal lattices. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSE1001

22. Tobin, Robin Joshua. Extremal Spectral Invariants of Graphs.

Degree: Mathematics, 2017, University of California – San Diego

 We address several problems in spectral graph theory, with a common theme of optimizing or computing a spectral graph invariant, such as the spectral radius… (more)

Subjects/Keywords: Mathematics; graph theory; planar graphs; spectral graph theory

…papers “Three conjectures in extremal spectral graph theory”, [51], to appear in… …address several problems in spectral graph theory, with a common theme of optimizing or… …Introduction 1.1 Preliminaries The subject of this dissertation is spectral graph theory, which… …regular if every vertex has degree d. 1.2 1.2.1 Spectral graph theory Matrices associated to… …the proofs of some classic inequalities in spectral graph theory which we will use… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tobin, R. J. (2017). Extremal Spectral Invariants of Graphs. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/8pw2j45q

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tobin, Robin Joshua. “Extremal Spectral Invariants of Graphs.” 2017. Thesis, University of California – San Diego. Accessed July 16, 2020. http://www.escholarship.org/uc/item/8pw2j45q.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tobin, Robin Joshua. “Extremal Spectral Invariants of Graphs.” 2017. Web. 16 Jul 2020.

Vancouver:

Tobin RJ. Extremal Spectral Invariants of Graphs. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2020 Jul 16]. Available from: http://www.escholarship.org/uc/item/8pw2j45q.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tobin RJ. Extremal Spectral Invariants of Graphs. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/8pw2j45q

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Goddet, Étienne. Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique : Spectral analysis and monitoring of meshed current return path networks in aeronautics.

Degree: Docteur es, Genie electrique, 2017, Université Grenoble Alpes (ComUE)

Depuis plusieurs années, l’aéronautique est confrontée à une mutation majeure due à l’émergence des matériaux composites. Ce changement, justifié par les excellentes propriétés mécaniques des… (more)

Subjects/Keywords: Théorie spectrale des graphes; Théorie des graphes; Avion composite; Topologie des réseaux; Spectral graph theory; Graph theory; Composite aircraft; Network topology; 620

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goddet, E. (2017). Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique : Spectral analysis and monitoring of meshed current return path networks in aeronautics. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2017GREAT099

Chicago Manual of Style (16th Edition):

Goddet, Étienne. “Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique : Spectral analysis and monitoring of meshed current return path networks in aeronautics.” 2017. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed July 16, 2020. http://www.theses.fr/2017GREAT099.

MLA Handbook (7th Edition):

Goddet, Étienne. “Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique : Spectral analysis and monitoring of meshed current return path networks in aeronautics.” 2017. Web. 16 Jul 2020.

Vancouver:

Goddet E. Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique : Spectral analysis and monitoring of meshed current return path networks in aeronautics. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2017. [cited 2020 Jul 16]. Available from: http://www.theses.fr/2017GREAT099.

Council of Science Editors:

Goddet E. Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique : Spectral analysis and monitoring of meshed current return path networks in aeronautics. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2017. Available from: http://www.theses.fr/2017GREAT099

24. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

 In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node… (more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed July 16, 2020. http://hdl.handle.net/10045/98110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 16 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10045/98110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

25. Gelling, Eric Neil. On 1-factorizations of the complete graph and the relationship to round robin schedules.

Degree: Department of Mathematics and Statistics, 2016, University of Victoria

 The following new results concerning 1-factorizations of the complete graph are proved: (1) There are exactly 6 equivalence classes of 1-factorizations of the complete graph(more)

Subjects/Keywords: graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gelling, E. N. (2016). On 1-factorizations of the complete graph and the relationship to round robin schedules. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7341

Chicago Manual of Style (16th Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Masters Thesis, University of Victoria. Accessed July 16, 2020. http://hdl.handle.net/1828/7341.

MLA Handbook (7th Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Web. 16 Jul 2020.

Vancouver:

Gelling EN. On 1-factorizations of the complete graph and the relationship to round robin schedules. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/1828/7341.

Council of Science Editors:

Gelling EN. On 1-factorizations of the complete graph and the relationship to round robin schedules. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7341


University of Waterloo

26. de Jong, Jamie. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.

Degree: 2020, University of Waterloo

 In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-flow. This was extended by Jaeger et al. (1992) to… (more)

Subjects/Keywords: Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

de Jong, J. (2020). Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15821

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

de Jong, Jamie. “Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.” 2020. Thesis, University of Waterloo. Accessed July 16, 2020. http://hdl.handle.net/10012/15821.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

de Jong, Jamie. “Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.” 2020. Web. 16 Jul 2020.

Vancouver:

de Jong J. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10012/15821.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

de Jong J. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15821

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

27. Rooney, Brendan. Spectral Aspects of Cocliques in Graphs.

Degree: 2014, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rooney, Brendan. “Spectral Aspects of Cocliques in Graphs.” 2014. Web. 16 Jul 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


KTH

28. Gustavsson, Hanna. Clustering Based Outlier Detection for Improved Situation Awareness within Air Traffic Control.

Degree: Optimization and Systems Theory, 2019, KTH

The aim of this thesis is to examine clustering based outlier detection algorithms on their ability to detect abnormal events in flight traffic. A… (more)

Subjects/Keywords: Applied Mathematics; Clustering; Spectral Clustering; Graph Theory; GMM; Outlier Detection; Tillämpad matematik; Klustering; Spektralklustering; grafteori; GMM; anomalidetektering; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gustavsson, H. (2019). Clustering Based Outlier Detection for Improved Situation Awareness within Air Traffic Control. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264215

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gustavsson, Hanna. “Clustering Based Outlier Detection for Improved Situation Awareness within Air Traffic Control.” 2019. Thesis, KTH. Accessed July 16, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264215.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gustavsson, Hanna. “Clustering Based Outlier Detection for Improved Situation Awareness within Air Traffic Control.” 2019. Web. 16 Jul 2020.

Vancouver:

Gustavsson H. Clustering Based Outlier Detection for Improved Situation Awareness within Air Traffic Control. [Internet] [Thesis]. KTH; 2019. [cited 2020 Jul 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264215.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gustavsson H. Clustering Based Outlier Detection for Improved Situation Awareness within Air Traffic Control. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264215

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brigham Young University

29. Passey Jr., David Joseph. Growing Complex Networks for Better Learning of Chaotic Dynamical Systems.

Degree: MS, 2020, Brigham Young University

  This thesis advances the theory of network specialization by characterizing the effect of network specialization on the eigenvectors of a network. We prove and… (more)

Subjects/Keywords: Complex networks; dynamical systems; reservoir computing; network growth; isospectral transformations; spectral graph theory; chaos; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Passey Jr., D. J. (2020). Growing Complex Networks for Better Learning of Chaotic Dynamical Systems. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=9146&context=etd

Chicago Manual of Style (16th Edition):

Passey Jr., David Joseph. “Growing Complex Networks for Better Learning of Chaotic Dynamical Systems.” 2020. Masters Thesis, Brigham Young University. Accessed July 16, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=9146&context=etd.

MLA Handbook (7th Edition):

Passey Jr., David Joseph. “Growing Complex Networks for Better Learning of Chaotic Dynamical Systems.” 2020. Web. 16 Jul 2020.

Vancouver:

Passey Jr. DJ. Growing Complex Networks for Better Learning of Chaotic Dynamical Systems. [Internet] [Masters thesis]. Brigham Young University; 2020. [cited 2020 Jul 16]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=9146&context=etd.

Council of Science Editors:

Passey Jr. DJ. Growing Complex Networks for Better Learning of Chaotic Dynamical Systems. [Masters Thesis]. Brigham Young University; 2020. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=9146&context=etd


Texas Tech University

30. Peterson, Cheryl Anne. Asymptotic and spectral analysis of nonselfadjoint operators generated by a coupled Euler-Bernoulli/Timoshenko beam model.

Degree: Accounting and Information Systems, 2002, Texas Tech University

 This dissertation is devoted to the asymptotic and spectral analysis of a coupled Euler-Bernoulli and Timoshenko beam model. The model is governed by a system… (more)

Subjects/Keywords: Spectral analysis; Eulerian graph theory; Timoshenko beams

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peterson, C. A. (2002). Asymptotic and spectral analysis of nonselfadjoint operators generated by a coupled Euler-Bernoulli/Timoshenko beam model. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/9437

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Peterson, Cheryl Anne. “Asymptotic and spectral analysis of nonselfadjoint operators generated by a coupled Euler-Bernoulli/Timoshenko beam model.” 2002. Thesis, Texas Tech University. Accessed July 16, 2020. http://hdl.handle.net/2346/9437.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Peterson, Cheryl Anne. “Asymptotic and spectral analysis of nonselfadjoint operators generated by a coupled Euler-Bernoulli/Timoshenko beam model.” 2002. Web. 16 Jul 2020.

Vancouver:

Peterson CA. Asymptotic and spectral analysis of nonselfadjoint operators generated by a coupled Euler-Bernoulli/Timoshenko beam model. [Internet] [Thesis]. Texas Tech University; 2002. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2346/9437.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Peterson CA. Asymptotic and spectral analysis of nonselfadjoint operators generated by a coupled Euler-Bernoulli/Timoshenko beam model. [Thesis]. Texas Tech University; 2002. Available from: http://hdl.handle.net/2346/9437

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [2237]

.