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:(Adjacency Matrix). Showing records 1 – 26 of 26 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Penn State University

1. Xiao, Gaoyao. Detecting automated agents based insider attacks through adjacency matrix analysis.

Degree: 2015, Penn State University

 An insider attack is an attack to an organization that comes from people in the organization, namely insiders. Since insiders are often familiar with the… (more)

Subjects/Keywords: Insider attack detection; adjacency matrix analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiao, G. (2015). Detecting automated agents based insider attacks through adjacency matrix analysis. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/24862

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):

Xiao, Gaoyao. “Detecting automated agents based insider attacks through adjacency matrix analysis.” 2015. Thesis, Penn State University. Accessed March 03, 2021. https://submit-etda.libraries.psu.edu/catalog/24862.

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

MLA Handbook (7th Edition):

Xiao, Gaoyao. “Detecting automated agents based insider attacks through adjacency matrix analysis.” 2015. Web. 03 Mar 2021.

Vancouver:

Xiao G. Detecting automated agents based insider attacks through adjacency matrix analysis. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Mar 03]. Available from: https://submit-etda.libraries.psu.edu/catalog/24862.

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

Council of Science Editors:

Xiao G. Detecting automated agents based insider attacks through adjacency matrix analysis. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/24862

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


University of Victoria

2. Wang, Ying. CloneCompass: visualizations for code clone analysis.

Degree: Department of Computer Science, 2020, University of Victoria

 Code clones are identical or similar code fragments in a single software system or across multiple systems. Frequent copy-paste-modify activities and reuse of existing systems… (more)

Subjects/Keywords: data visualisation; Adjacency Matrix visualizations; code clone analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2020). CloneCompass: visualizations for code clone analysis. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11729

Chicago Manual of Style (16th Edition):

Wang, Ying. “CloneCompass: visualizations for code clone analysis.” 2020. Masters Thesis, University of Victoria. Accessed March 03, 2021. http://hdl.handle.net/1828/11729.

MLA Handbook (7th Edition):

Wang, Ying. “CloneCompass: visualizations for code clone analysis.” 2020. Web. 03 Mar 2021.

Vancouver:

Wang Y. CloneCompass: visualizations for code clone analysis. [Internet] [Masters thesis]. University of Victoria; 2020. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/1828/11729.

Council of Science Editors:

Wang Y. CloneCompass: visualizations for code clone analysis. [Masters Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/11729


Stellenbosch University

3. Dadedzi, Kenneth. Spectral radii of matrices associated with graphs.

Degree: MSc, 2015, Stellenbosch University

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

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

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

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

MLA Handbook (7th Edition):

Dadedzi, Kenneth. “Spectral radii of matrices associated with graphs.” 2015. Web. 03 Mar 2021.

Vancouver:

Dadedzi K. Spectral radii of matrices associated with graphs. [Internet] [Masters thesis]. Stellenbosch University; 2015. [cited 2021 Mar 03]. 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


University of Colorado

4. Carpenter, Marshall. Statistical Properties of Avalanches on Complex Networks.

Degree: MS, Applied Mathematics, 2012, University of Colorado

  We characterize the distribution of sizes and durations of avalanches propagating in complex networks. We find that the statistics of avalanches can be characterized… (more)

Subjects/Keywords: Adjacency Matrix; Avalanches; Degree Distribution; Networks; Perron-Frobenius; Power-law; Mathematics; Neurosciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carpenter, M. (2012). Statistical Properties of Avalanches on Complex Networks. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/25

Chicago Manual of Style (16th Edition):

Carpenter, Marshall. “Statistical Properties of Avalanches on Complex Networks.” 2012. Masters Thesis, University of Colorado. Accessed March 03, 2021. https://scholar.colorado.edu/appm_gradetds/25.

MLA Handbook (7th Edition):

Carpenter, Marshall. “Statistical Properties of Avalanches on Complex Networks.” 2012. Web. 03 Mar 2021.

Vancouver:

Carpenter M. Statistical Properties of Avalanches on Complex Networks. [Internet] [Masters thesis]. University of Colorado; 2012. [cited 2021 Mar 03]. Available from: https://scholar.colorado.edu/appm_gradetds/25.

Council of Science Editors:

Carpenter M. Statistical Properties of Avalanches on Complex Networks. [Masters Thesis]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/appm_gradetds/25

5. Ancykutty, Joseph; Dr.Krishnamoorthy,A. On infinite graphs and related matrices.

Degree: mathematics, 2000, Cochin University of Science and Technology

This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any… (more)

Subjects/Keywords: Graphs and Digraphs; Theory of rings; Adjacency matrix,; Infinite digraph; Arc adjacency operator

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ancykutty, J. D. K. (2000). On infinite graphs and related matrices. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/3142

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):

Ancykutty, Joseph; Dr Krishnamoorthy,A. “On infinite graphs and related matrices.” 2000. Thesis, Cochin University of Science and Technology. Accessed March 03, 2021. http://dyuthi.cusat.ac.in/purl/3142.

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

MLA Handbook (7th Edition):

Ancykutty, Joseph; Dr Krishnamoorthy,A. “On infinite graphs and related matrices.” 2000. Web. 03 Mar 2021.

Vancouver:

Ancykutty JDK. On infinite graphs and related matrices. [Internet] [Thesis]. Cochin University of Science and Technology; 2000. [cited 2021 Mar 03]. Available from: http://dyuthi.cusat.ac.in/purl/3142.

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

Council of Science Editors:

Ancykutty JDK. On infinite graphs and related matrices. [Thesis]. Cochin University of Science and Technology; 2000. Available from: http://dyuthi.cusat.ac.in/purl/3142

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

6. Laurila, Jonas Bergman. Ontology Slice Generation and Alignment for Enhanced Life Science Literature Search.

Degree: Computer and Information Science, 2009, Linköping UniversityLinköping University

  Query composition is an often complicated and cumbersome task for persons performing a literature search. This thesis is part of a project which aims… (more)

Subjects/Keywords: Ontologies; Alignment; Graph mining; Adjacency matrix; Bioinformatics; Bioinformatik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Laurila, J. B. (2009). Ontology Slice Generation and Alignment for Enhanced Life Science Literature Search. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16440

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):

Laurila, Jonas Bergman. “Ontology Slice Generation and Alignment for Enhanced Life Science Literature Search.” 2009. Thesis, Linköping UniversityLinköping University. Accessed March 03, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16440.

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

MLA Handbook (7th Edition):

Laurila, Jonas Bergman. “Ontology Slice Generation and Alignment for Enhanced Life Science Literature Search.” 2009. Web. 03 Mar 2021.

Vancouver:

Laurila JB. Ontology Slice Generation and Alignment for Enhanced Life Science Literature Search. [Internet] [Thesis]. Linköping UniversityLinköping University; 2009. [cited 2021 Mar 03]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16440.

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

Council of Science Editors:

Laurila JB. Ontology Slice Generation and Alignment for Enhanced Life Science Literature Search. [Thesis]. Linköping UniversityLinköping University; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16440

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


University of Illinois – Urbana-Champaign

7. Dominguez Sagarena, Francisco J. Diffusion in heterogeneous networks.

Degree: MS, Electrical & Computer Engineering, 2015, University of Illinois – Urbana-Champaign

 We create a program to simulate diffusion in random graphs. Specifically,we create a generalization of bootstrap percolation which incorporates any number of societies and an… (more)

Subjects/Keywords: Bootstrap Percolation; Computer Simulation; Diffusion; Random graphs; Adjacency matrix; Heterogeneous; adoption; innovations; Game theory; threshold; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dominguez Sagarena, F. J. (2015). Diffusion in heterogeneous networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/87981

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):

Dominguez Sagarena, Francisco J. “Diffusion in heterogeneous networks.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed March 03, 2021. http://hdl.handle.net/2142/87981.

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

MLA Handbook (7th Edition):

Dominguez Sagarena, Francisco J. “Diffusion in heterogeneous networks.” 2015. Web. 03 Mar 2021.

Vancouver:

Dominguez Sagarena FJ. Diffusion in heterogeneous networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2142/87981.

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

Council of Science Editors:

Dominguez Sagarena FJ. Diffusion in heterogeneous networks. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/87981

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


Univerzitet u Beogradu

8. Koledin, Tamara D. Neke klase spektralno ograničenih grafova.

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

Matematika-Algebarska teorija grafova / Mathematics-Algebraic graph theory

Spektralna teorija grafova je grana matematike koja je nastala pedesetih godina pro²log veka i od tada se neprestano… (more)

Subjects/Keywords: adjacency matrix; signless Laplace matrix; graph spectrum; signless La- place spectrum; second largest eigenvalue; regular graph; bipartite graph; nested graph; balanced incomplete block design; partially balanced incomplete block de- sign

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koledin, T. D. (2014). Neke klase spektralno ograničenih grafova. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:7048/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):

Koledin, Tamara D. “Neke klase spektralno ograničenih grafova.” 2014. Thesis, Univerzitet u Beogradu. Accessed March 03, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:7048/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):

Koledin, Tamara D. “Neke klase spektralno ograničenih grafova.” 2014. Web. 03 Mar 2021.

Vancouver:

Koledin TD. Neke klase spektralno ograničenih grafova. [Internet] [Thesis]. Univerzitet u Beogradu; 2014. [cited 2021 Mar 03]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7048/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:

Koledin TD. Neke klase spektralno ograničenih grafova. [Thesis]. Univerzitet u Beogradu; 2014. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get

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


Brno University of Technology

9. Miloš, Roman. Příprava domácích úloh pro předmět Algoritmy: Preparation of Homeworks in the Course Algorithms.

Degree: 2019, Brno University of Technology

 This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs… (more)

Subjects/Keywords: Graf; grafové algoritmy; Jarníkův algoritmus; Floyd-Warshallův algoritmus; úplný graf; diskrétní graf; souvislý graf; klika; matice sousednosti; seznam sousednosti; Graph; graph algorithms; Prim's algorithm; Floyd-Warshall algorithm; complete graph; edgeless graph; connected graph; clique; adjacency matrix; adjacency list

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Miloš, R. (2019). Příprava domácích úloh pro předmět Algoritmy: Preparation of Homeworks in the Course Algorithms. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54623

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):

Miloš, Roman. “Příprava domácích úloh pro předmět Algoritmy: Preparation of Homeworks in the Course Algorithms.” 2019. Thesis, Brno University of Technology. Accessed March 03, 2021. http://hdl.handle.net/11012/54623.

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

MLA Handbook (7th Edition):

Miloš, Roman. “Příprava domácích úloh pro předmět Algoritmy: Preparation of Homeworks in the Course Algorithms.” 2019. Web. 03 Mar 2021.

Vancouver:

Miloš R. Příprava domácích úloh pro předmět Algoritmy: Preparation of Homeworks in the Course Algorithms. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/11012/54623.

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

Council of Science Editors:

Miloš R. Příprava domácích úloh pro předmět Algoritmy: Preparation of Homeworks in the Course Algorithms. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/54623

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


Brno University of Technology

10. Daňhel, Tomáš. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.

Degree: 2015, Brno University of Technology

 The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the… (more)

Subjects/Keywords: distribuované algoritmy; orientovaný graf; neorientovaný graf; matice sousednosti; average consensus; konvergence algoritmu; distributed algorithms; directed/undirected graphs; adjacency matrix; average consensus; distributed computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daňhel, T. (2015). Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/41359

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):

Daňhel, Tomáš. “Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.” 2015. Thesis, Brno University of Technology. Accessed March 03, 2021. http://hdl.handle.net/11012/41359.

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

MLA Handbook (7th Edition):

Daňhel, Tomáš. “Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.” 2015. Web. 03 Mar 2021.

Vancouver:

Daňhel T. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. [Internet] [Thesis]. Brno University of Technology; 2015. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/11012/41359.

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

Council of Science Editors:

Daňhel T. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. [Thesis]. Brno University of Technology; 2015. Available from: http://hdl.handle.net/11012/41359

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


Brno University of Technology

11. Daňhel, Tomáš. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.

Degree: 2016, Brno University of Technology

 The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the… (more)

Subjects/Keywords: distribuované algoritmy; orientovaný graf; neorientovaný graf; matice sousednosti; average consensus; konvergence algoritmu; distributed algorithms; directed/undirected graphs; adjacency matrix; average consensus; distributed computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daňhel, T. (2016). Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56788

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):

Daňhel, Tomáš. “Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.” 2016. Thesis, Brno University of Technology. Accessed March 03, 2021. http://hdl.handle.net/11012/56788.

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

MLA Handbook (7th Edition):

Daňhel, Tomáš. “Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.” 2016. Web. 03 Mar 2021.

Vancouver:

Daňhel T. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. [Internet] [Thesis]. Brno University of Technology; 2016. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/11012/56788.

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

Council of Science Editors:

Daňhel T. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. [Thesis]. Brno University of Technology; 2016. Available from: http://hdl.handle.net/11012/56788

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


Brno University of Technology

12. Daňhel, Tomáš. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.

Degree: 2017, Brno University of Technology

 The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the… (more)

Subjects/Keywords: distribuované algoritmy; orientovaný graf; neorientovaný graf; matice sousednosti; average consensus; konvergence algoritmu; distributed algorithms; directed/undirected graphs; adjacency matrix; average consensus; distributed computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daňhel, T. (2017). Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/63804

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):

Daňhel, Tomáš. “Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.” 2017. Thesis, Brno University of Technology. Accessed March 03, 2021. http://hdl.handle.net/11012/63804.

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

MLA Handbook (7th Edition):

Daňhel, Tomáš. “Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm.” 2017. Web. 03 Mar 2021.

Vancouver:

Daňhel T. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/11012/63804.

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

Council of Science Editors:

Daňhel T. Vplyvy vlasností grafových štruktúr na správanie vybraného distribuovaného algoritmu: Impact of graph structures' features on the behaviour of the choosen distributed algorithm. [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/63804

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


Universitat Politècnica de Catalunya

13. Martínez Barona, Berenice. (1, ≤ ℓ)-identifying codes in digraphs and graphs.

Degree: 2020, Universitat Politècnica de Catalunya

 El principal tema de esta tesis doctoral es el estudio de los (1,=l)-códigos identificadores en digrafos. Los resultados presentados en este trabajo están divididos en… (more)

Subjects/Keywords: Adjacency matrix; Graph; Digraph; Dominating set; Edge-identifying code; Eigenvalues; Eeigenvectors; Linedigraph; Separating set; Spectra; Àrees temàtiques de la UPC::Matemàtiques i estadística; 512

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martínez Barona, B. (2020). (1, ≤ ℓ)-identifying codes in digraphs and graphs. (Thesis). Universitat Politècnica de Catalunya. Retrieved from http://hdl.handle.net/10803/669726

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):

Martínez Barona, Berenice. “(1, ≤ ℓ)-identifying codes in digraphs and graphs.” 2020. Thesis, Universitat Politècnica de Catalunya. Accessed March 03, 2021. http://hdl.handle.net/10803/669726.

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

MLA Handbook (7th Edition):

Martínez Barona, Berenice. “(1, ≤ ℓ)-identifying codes in digraphs and graphs.” 2020. Web. 03 Mar 2021.

Vancouver:

Martínez Barona B. (1, ≤ ℓ)-identifying codes in digraphs and graphs. [Internet] [Thesis]. Universitat Politècnica de Catalunya; 2020. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10803/669726.

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

Council of Science Editors:

Martínez Barona B. (1, ≤ ℓ)-identifying codes in digraphs and graphs. [Thesis]. Universitat Politècnica de Catalunya; 2020. Available from: http://hdl.handle.net/10803/669726

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

14. Pacheco, Maria de Fátima Moreira da Silva. Recognition of graphs with convex quadratic stability number .

Degree: 2019, Universidade de Aveiro

 A maximum stable set is a stable set with the largest possible size, for a given graph G. This size is called the stability number… (more)

Subjects/Keywords: Spectral graph theory; Convex quadratic programming in graphs; Stable sets; Adjacency matrix; Graphs with convex-QP stability number; Star sets, (κ, τ )- regular sets; Hamiltonian graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pacheco, M. d. F. M. d. S. (2019). Recognition of graphs with convex quadratic stability number . (Thesis). Universidade de Aveiro. Retrieved from http://hdl.handle.net/10773/29883

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):

Pacheco, Maria de Fátima Moreira da Silva. “Recognition of graphs with convex quadratic stability number .” 2019. Thesis, Universidade de Aveiro. Accessed March 03, 2021. http://hdl.handle.net/10773/29883.

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

MLA Handbook (7th Edition):

Pacheco, Maria de Fátima Moreira da Silva. “Recognition of graphs with convex quadratic stability number .” 2019. Web. 03 Mar 2021.

Vancouver:

Pacheco MdFMdS. Recognition of graphs with convex quadratic stability number . [Internet] [Thesis]. Universidade de Aveiro; 2019. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10773/29883.

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

Council of Science Editors:

Pacheco MdFMdS. Recognition of graphs with convex quadratic stability number . [Thesis]. Universidade de Aveiro; 2019. Available from: http://hdl.handle.net/10773/29883

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

15. Jesus, José Vitor Oliveira de. Introdução à teoria espectral de grafos.

Degree: 2018, Universidade da Madeira

O objetivo principal desta dissertação é fazer uma introdução à teoria espectral de grafos. Abordaremos algumas propriedades dos grafos, nomeadamente o polinómio característico, os valores… (more)

Subjects/Keywords: Energia de um grafo; Espectro de um grafo; Grafo; Matriz de adjacência; Matriz laplaciana; Medidas de centralidade; Adjacency matrix; Centrality measures; Energy of a graph; Graph; Laplacian matrix; Spectrum of a graph; Matemática; .; Faculdade de Ciências Exatas e da Engenharia; Domínio/Área Científica::Ciências Naturais::Matemáticas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jesus, J. V. O. d. (2018). Introdução à teoria espectral de grafos. (Thesis). Universidade da Madeira. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:digituma.uma.pt:10400.13/2115

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):

Jesus, José Vitor Oliveira de. “Introdução à teoria espectral de grafos.” 2018. Thesis, Universidade da Madeira. Accessed March 03, 2021. https://www.rcaap.pt/detail.jsp?id=oai:digituma.uma.pt:10400.13/2115.

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

MLA Handbook (7th Edition):

Jesus, José Vitor Oliveira de. “Introdução à teoria espectral de grafos.” 2018. Web. 03 Mar 2021.

Vancouver:

Jesus JVOd. Introdução à teoria espectral de grafos. [Internet] [Thesis]. Universidade da Madeira; 2018. [cited 2021 Mar 03]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:digituma.uma.pt:10400.13/2115.

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

Council of Science Editors:

Jesus JVOd. Introdução à teoria espectral de grafos. [Thesis]. Universidade da Madeira; 2018. Available from: https://www.rcaap.pt/detail.jsp?id=oai:digituma.uma.pt:10400.13/2115

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

16. Buelow, Zachary. Out-Tournament Adjacency Matrices with Equal Ranks.

Degree: 2016, Marquette University

 Much work has been done in analyzing various classes of tournaments, giving a partial characterization of tournaments with adjacency matrices having equal and full real,… (more)

Subjects/Keywords: {0; 1}-matrix rank; adjacency matrix; Boolean rank; digraph; out-tournament; Mathematics

adjacency matrix ranks in general. In addition to the usual linear algebra techniques, two of the… …allow more complete characterization of adjacency matrix ranks in terms of natural graph… …bigraphs and their adjacency matrix ranks. The biclique cover number of a bigraph is the minimum… …nonnegative integer rank of its adjacency matrix, and the biclique cover number of the bigraph… …equals the biclique cover number of its adjacency matrix. A nice consequence of this is the… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buelow, Z. (2016). Out-Tournament Adjacency Matrices with Equal Ranks. (Thesis). Marquette University. Retrieved from https://epublications.marquette.edu/dissertations_mu/618

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):

Buelow, Zachary. “Out-Tournament Adjacency Matrices with Equal Ranks.” 2016. Thesis, Marquette University. Accessed March 03, 2021. https://epublications.marquette.edu/dissertations_mu/618.

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

MLA Handbook (7th Edition):

Buelow, Zachary. “Out-Tournament Adjacency Matrices with Equal Ranks.” 2016. Web. 03 Mar 2021.

Vancouver:

Buelow Z. Out-Tournament Adjacency Matrices with Equal Ranks. [Internet] [Thesis]. Marquette University; 2016. [cited 2021 Mar 03]. Available from: https://epublications.marquette.edu/dissertations_mu/618.

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

Council of Science Editors:

Buelow Z. Out-Tournament Adjacency Matrices with Equal Ranks. [Thesis]. Marquette University; 2016. Available from: https://epublications.marquette.edu/dissertations_mu/618

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


Universidade Presbiteriana Mackenzie

17. Wander Lairson Costa. Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares.

Degree: 2013, Universidade Presbiteriana Mackenzie

Autômatos celulares são sistemas totalmente discretos que agem localmente de forma simples e determinística, mas cujo comportamento global resultante pode ser extremamente complexo. O conjunto… (more)

Subjects/Keywords: comportamento limite; autômato celular elementar; linguagem regular; grafo de processo; autômato finito; matriz de adjacência, complexidade; elementary cellular automaton; limit behavior; regular language; finite automaton; process graph; adjacency matrix; complexity; ENGENHARIA ELETRICA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Costa, W. L. (2013). Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares. (Thesis). Universidade Presbiteriana Mackenzie. Retrieved from http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761

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):

Costa, Wander Lairson. “Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares.” 2013. Thesis, Universidade Presbiteriana Mackenzie. Accessed March 03, 2021. http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761.

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

MLA Handbook (7th Edition):

Costa, Wander Lairson. “Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares.” 2013. Web. 03 Mar 2021.

Vancouver:

Costa WL. Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares. [Internet] [Thesis]. Universidade Presbiteriana Mackenzie; 2013. [cited 2021 Mar 03]. Available from: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761.

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

Council of Science Editors:

Costa WL. Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares. [Thesis]. Universidade Presbiteriana Mackenzie; 2013. Available from: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761

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


Universidade do Estado do Rio de Janeiro

18. Sabrina de Oliveira Figueira. Análise espectral de redes complexas.

Degree: Master, 2010, Universidade do Estado do Rio de Janeiro

Neste estudo são apresentados os resultados do trabalho sobre simulações de redes de conexões complexas. Foram simuladas redes regulares, intermediárias e aleatórias com o número… (more)

Subjects/Keywords: Redes (Matemática) Métodos de simulação; Teoria espectral (Matemática); Teoria dos grafos; Autovalores; Redes complexas; Redes aleatórias; Matriz de adjacência; Nets (Mathematics) - Simulation methods; Spectral theory (Mathematics); Graph theory; Eigenvalues; Complex networks; Aleatory networks; Adjacency matrix; MATEMATICA APLICADA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Figueira, S. d. O. (2010). Análise espectral de redes complexas. (Masters Thesis). Universidade do Estado do Rio de Janeiro. Retrieved from http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=1805 ;

Chicago Manual of Style (16th Edition):

Figueira, Sabrina de Oliveira. “Análise espectral de redes complexas.” 2010. Masters Thesis, Universidade do Estado do Rio de Janeiro. Accessed March 03, 2021. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=1805 ;.

MLA Handbook (7th Edition):

Figueira, Sabrina de Oliveira. “Análise espectral de redes complexas.” 2010. Web. 03 Mar 2021.

Vancouver:

Figueira SdO. Análise espectral de redes complexas. [Internet] [Masters thesis]. Universidade do Estado do Rio de Janeiro; 2010. [cited 2021 Mar 03]. Available from: http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=1805 ;.

Council of Science Editors:

Figueira SdO. Análise espectral de redes complexas. [Masters Thesis]. Universidade do Estado do Rio de Janeiro; 2010. Available from: http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=1805 ;

19. Shi, Jinhong. Protein inference based on peptides identified from tandem mass spectra.

Degree: 2012, University of Saskatchewan

 Protein inference is a critical computational step in the study of proteomics. It lays the foundation for further structural and functional analysis of proteins, based… (more)

Subjects/Keywords: Protein inference; peptide identification; tandem mass spectra; Gaussian mixture model; logistic regression; adjacency matrix; unified framework

…search proteins in the database. Third, an adjacency matrix which shows whether two peptides… …regularized with the adjacency matrix (W2 ) constructed from the selected high-confidence… …proteins. This indicates that the adjacency matrix updated with the selected high-confidence… …updated adjacency matrix between peptides, can essentially improve peptide scores, and thus… …list of putative inferred proteins, as the construction of an adjacency matrix between… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shi, J. (2012). Protein inference based on peptides identified from tandem mass spectra. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/ETD-2012-12-837

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):

Shi, Jinhong. “Protein inference based on peptides identified from tandem mass spectra.” 2012. Thesis, University of Saskatchewan. Accessed March 03, 2021. http://hdl.handle.net/10388/ETD-2012-12-837.

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

MLA Handbook (7th Edition):

Shi, Jinhong. “Protein inference based on peptides identified from tandem mass spectra.” 2012. Web. 03 Mar 2021.

Vancouver:

Shi J. Protein inference based on peptides identified from tandem mass spectra. [Internet] [Thesis]. University of Saskatchewan; 2012. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10388/ETD-2012-12-837.

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

Council of Science Editors:

Shi J. Protein inference based on peptides identified from tandem mass spectra. [Thesis]. University of Saskatchewan; 2012. Available from: http://hdl.handle.net/10388/ETD-2012-12-837

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

20. ZHANG JUNXIA. Capacity evaluation for ad hoc networks with end-to-end delay constraints.

Degree: 2005, National University of Singapore

Subjects/Keywords: Ad hoc network; Capacity; End-to-end delay; Adjacency matrix; IEEE 802.11; Average hop count

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

JUNXIA, Z. (2005). Capacity evaluation for ad hoc networks with end-to-end delay constraints. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/14690

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):

JUNXIA, ZHANG. “Capacity evaluation for ad hoc networks with end-to-end delay constraints.” 2005. Thesis, National University of Singapore. Accessed March 03, 2021. http://scholarbank.nus.edu.sg/handle/10635/14690.

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

MLA Handbook (7th Edition):

JUNXIA, ZHANG. “Capacity evaluation for ad hoc networks with end-to-end delay constraints.” 2005. Web. 03 Mar 2021.

Vancouver:

JUNXIA Z. Capacity evaluation for ad hoc networks with end-to-end delay constraints. [Internet] [Thesis]. National University of Singapore; 2005. [cited 2021 Mar 03]. Available from: http://scholarbank.nus.edu.sg/handle/10635/14690.

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

Council of Science Editors:

JUNXIA Z. Capacity evaluation for ad hoc networks with end-to-end delay constraints. [Thesis]. National University of Singapore; 2005. Available from: http://scholarbank.nus.edu.sg/handle/10635/14690

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

21. Koledin Tamara. Some classes of spectrally constrained graphs.

Degree: PhD, Mathematics, 2013, University of Belgrade

 Spectral graph theory is a branch of mathematics that emerged more than sixty years ago, and since then has been continuously developing. Its importance is… (more)

Subjects/Keywords: adjacency matrix; signless Laplace matrix; graph spectrum; signless Laplace spectrum; second largest eigenvalue; regular graph; bipartite graph; nested graph; balanced incomplete block design; partially balanced incomplete block design; matrica susedstva grafa; nenegativna Laplasova matrica grafa; spektar grafa; nenegativni Laplasov spektar grafa; druga sopstvena vrednost; regularan graf; bipartitni graf; ugnežđeni graf; uravnotežena nekompletna blok-šema; delimično uravnotežena nekompletna blok-šema

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tamara, K. (2013). Some classes of spectrally constrained graphs. (Doctoral Dissertation). University of Belgrade. Retrieved from http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079

Chicago Manual of Style (16th Edition):

Tamara, Koledin. “Some classes of spectrally constrained graphs.” 2013. Doctoral Dissertation, University of Belgrade. Accessed March 03, 2021. http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079.

MLA Handbook (7th Edition):

Tamara, Koledin. “Some classes of spectrally constrained graphs.” 2013. Web. 03 Mar 2021.

Vancouver:

Tamara K. Some classes of spectrally constrained graphs. [Internet] [Doctoral dissertation]. University of Belgrade; 2013. [cited 2021 Mar 03]. Available from: http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079.

Council of Science Editors:

Tamara K. Some classes of spectrally constrained graphs. [Doctoral Dissertation]. University of Belgrade; 2013. Available from: http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079


Brno University of Technology

22. Matula, Radek. Grafická reprezentace grafů: Graphics Graph Representation.

Degree: 2018, Brno University of Technology

 This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph… (more)

Subjects/Keywords: Teorie grafů; vrchol; hrana; ohodnocený graf; orientovaný graf; matice sousednosti; matice vzdáleností; matice incidence; Laplaceova matice; seznam sousedů; seznam vrcholů a hran; algoritmus High-Dimensional Embedding; algoritmus založený na silách; pružinový algoritmus; algoritmus Kamada-Kawai; algoritmus Fruchterman-Reingold; Graph theory; vertex; edge; edge-weighted graph; directed graph; adjacency matrix; distance matrix; incidence matrix; Laplacian matrix; list of neighbors; list of vertices and edges; mapping vertices on the circle; High-Dimensional Embedding algorithm; Force-based algorithm; Spring algorithm; Kamada-Kawai algorithm; Fruchterman-Reingold algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Matula, R. (2018). Grafická reprezentace grafů: Graphics Graph Representation. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53896

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):

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Thesis, Brno University of Technology. Accessed March 03, 2021. http://hdl.handle.net/11012/53896.

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

MLA Handbook (7th Edition):

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Web. 03 Mar 2021.

Vancouver:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/11012/53896.

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

Council of Science Editors:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53896

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

23. Zemljič, Katja. Energija grafa.

Degree: 2019, Univerza v Mariboru

Magistrsko delo zajema področje kemijske teorije grafov. Energija grafa je ena izmed invariant grafa, ki je povezana s fizikalno-kemijskimi lastnostmi obravnavanih molekul. Energijo grafa definiramo… (more)

Subjects/Keywords: Energija grafa; molekulski graf; matrika sosednosti; karakteristični polinom grafa; spekter grafa; Hücklova molekularna orbitalna teorija; Coulsonova integralna formula; metode dokazovanja.; Graph energy; molecular graph; adjacency matrix; characteristic polynomial of a graph; a spectrum of a graph; Hückel molecular orbital theory; Coulson integral formula; common proof methods.; info:eu-repo/classification/udc/519.17:512.6(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zemljič, K. (2019). Energija grafa. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=74176 ; https://dk.um.si/Dokument.php?id=135825&dn= ; https://plus.si.cobiss.net/opac7/bib/24752648?lang=sl

Chicago Manual of Style (16th Edition):

Zemljič, Katja. “Energija grafa.” 2019. Masters Thesis, Univerza v Mariboru. Accessed March 03, 2021. https://dk.um.si/IzpisGradiva.php?id=74176 ; https://dk.um.si/Dokument.php?id=135825&dn= ; https://plus.si.cobiss.net/opac7/bib/24752648?lang=sl.

MLA Handbook (7th Edition):

Zemljič, Katja. “Energija grafa.” 2019. Web. 03 Mar 2021.

Vancouver:

Zemljič K. Energija grafa. [Internet] [Masters thesis]. Univerza v Mariboru; 2019. [cited 2021 Mar 03]. Available from: https://dk.um.si/IzpisGradiva.php?id=74176 ; https://dk.um.si/Dokument.php?id=135825&dn= ; https://plus.si.cobiss.net/opac7/bib/24752648?lang=sl.

Council of Science Editors:

Zemljič K. Energija grafa. [Masters Thesis]. Univerza v Mariboru; 2019. Available from: https://dk.um.si/IzpisGradiva.php?id=74176 ; https://dk.um.si/Dokument.php?id=135825&dn= ; https://plus.si.cobiss.net/opac7/bib/24752648?lang=sl


Université de Lorraine

24. Nguyen, Huu-Hiep. Social Graph Anonymization : Anonymisation de graphes sociaux.

Degree: Docteur es, Informatique, 2016, Université de Lorraine

La vie privée est une préoccupation des utilisateurs des réseaux sociaux. Les réseaux sociaux sont une source de données précieuses pour des analyses scientifiques ou… (more)

Subjects/Keywords: Réseaux sociaux; Incertaine matrice d'adjacence; Maximum Variance; Vie privée différentielle; Top-M-Filte; Détection de communautés; LouvainDP; ModDivisive; Échange intime des liens; (α,ß)-Échange; Social networks; Uncertain Adjacency Matrix; Maximum Variance; Differential privacy; Top-M-Filter; Community detection; LouvainDP; ModDivisive; Private link exchange; (α,ß)-Exchange; 005.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, H. (2016). Social Graph Anonymization : Anonymisation de graphes sociaux. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2016LORR0168

Chicago Manual of Style (16th Edition):

Nguyen, Huu-Hiep. “Social Graph Anonymization : Anonymisation de graphes sociaux.” 2016. Doctoral Dissertation, Université de Lorraine. Accessed March 03, 2021. http://www.theses.fr/2016LORR0168.

MLA Handbook (7th Edition):

Nguyen, Huu-Hiep. “Social Graph Anonymization : Anonymisation de graphes sociaux.” 2016. Web. 03 Mar 2021.

Vancouver:

Nguyen H. Social Graph Anonymization : Anonymisation de graphes sociaux. [Internet] [Doctoral dissertation]. Université de Lorraine; 2016. [cited 2021 Mar 03]. Available from: http://www.theses.fr/2016LORR0168.

Council of Science Editors:

Nguyen H. Social Graph Anonymization : Anonymisation de graphes sociaux. [Doctoral Dissertation]. Université de Lorraine; 2016. Available from: http://www.theses.fr/2016LORR0168


Pontifical Catholic University of Rio de Janeiro

25. ANDRE DA ROCHA LOPES. [en] SPACES OF SEQUENCE.

Degree: 2007, Pontifical Catholic University of Rio de Janeiro

[pt] Estudaremos dinâmicas simbólicas associadas a alfabetos finitos. Consideraremos seqüências bi-infinitas e espaços com memória finita. Estudaremos propriedades invariantes por conjugação. Analisaremos a relação entre… (more)

Subjects/Keywords: [pt] ENTROPIA; [en] ENTROPY; [pt] GRAFOS; [en] GRAPHS; [pt] ESPACOS DE SEQUENCIAS; [en] SPACES OF SEQUENCE; [pt] SHIFTS; [en] SHIFTS; [pt] MATRIZ ADJACENTE; [en] ADJACENCY MATRIX; [pt] TEOREMA DE PERRON-FROBEIUS; [en] PERRON-FROBENIUS THEOREM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LOPES, A. D. R. (2007). [en] SPACES OF SEQUENCE. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9827

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):

LOPES, ANDRE DA ROCHA. “[en] SPACES OF SEQUENCE.” 2007. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 03, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9827.

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

MLA Handbook (7th Edition):

LOPES, ANDRE DA ROCHA. “[en] SPACES OF SEQUENCE.” 2007. Web. 03 Mar 2021.

Vancouver:

LOPES ADR. [en] SPACES OF SEQUENCE. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. [cited 2021 Mar 03]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9827.

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

Council of Science Editors:

LOPES ADR. [en] SPACES OF SEQUENCE. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9827

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

26. Πάλλα, Νίκη. (0,1) πίνακες - γραφήματα πληροφορική.

Degree: 2003, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

Subjects/Keywords: (0,1) πίνακες; Πίνακας γειτνίασης; Πίνακας πρόσπτωσης; Γραφήματα; Χαρακτηριστική εξίσωση; Συμπεράσματα; Αλγόριθμοι γραφημάτων; Πεπερασμένες γεωμετρίες; BIB σχεδιασμοί; Κωδικός γραφήματος - υπογραφήματος; Boolean matrices; Adjacency matrix; Incidence matrix; Graphs; Characteristic equation; Conclusions; Graph algorithms; Finite geometries; BIB designs; Graph - subgraph code

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Πάλλα, . . (2003). (0,1) πίνακες - γραφήματα πληροφορική. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/19704

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):

Πάλλα, Νίκη. “(0,1) πίνακες - γραφήματα πληροφορική.” 2003. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed March 03, 2021. http://hdl.handle.net/10442/hedi/19704.

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

MLA Handbook (7th Edition):

Πάλλα, Νίκη. “(0,1) πίνακες - γραφήματα πληροφορική.” 2003. Web. 03 Mar 2021.

Vancouver:

Πάλλα . (0,1) πίνακες - γραφήματα πληροφορική. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2003. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10442/hedi/19704.

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

Council of Science Editors:

Πάλλα . (0,1) πίνακες - γραφήματα πληροφορική. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2003. Available from: http://hdl.handle.net/10442/hedi/19704

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

.