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:(Euclidean minimum spanning tree). Showing records 1 – 30 of 5293 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Adelaide

1. Sorokin, Jennifer. Large-scale-structure in the Pierre Auger Observatory data directions.

Degree: 2016, University of Adelaide

 This thesis presents a method of analysis of Pierre Auger Observatory Cosmic Ray (CR) directions. I look for evidence of large-scale-structure within these CR directions.… (more)

Subjects/Keywords: Yggdrasil; minimum spanning tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sorokin, J. (2016). Large-scale-structure in the Pierre Auger Observatory data directions. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/99908

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

Sorokin, Jennifer. “Large-scale-structure in the Pierre Auger Observatory data directions.” 2016. Thesis, University of Adelaide. Accessed April 07, 2020. http://hdl.handle.net/2440/99908.

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

MLA Handbook (7th Edition):

Sorokin, Jennifer. “Large-scale-structure in the Pierre Auger Observatory data directions.” 2016. Web. 07 Apr 2020.

Vancouver:

Sorokin J. Large-scale-structure in the Pierre Auger Observatory data directions. [Internet] [Thesis]. University of Adelaide; 2016. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/2440/99908.

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

Council of Science Editors:

Sorokin J. Large-scale-structure in the Pierre Auger Observatory data directions. [Thesis]. University of Adelaide; 2016. Available from: http://hdl.handle.net/2440/99908

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


Université Montpellier II

2. Tournier, Nicolas. Synchronisation pour l'insertion de données dans des maillages 3D : Synchonization for 3D mesh watermarking.

Degree: Docteur es, Informatique, 2014, Université Montpellier II

De nos jours la protection des données numériques est un problème très important. Que ce soit pour des applications de confidentialité, de communication, de traçabilité… (more)

Subjects/Keywords: Maillage surfacique; Tatouage numérique; Synchronisation; Théorie des graphes; Arbre couvrant de poids minimum euclidien; 3D mesh; Watermarking; Synchronization; Graph theory; Euclidean minimum spanning tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tournier, N. (2014). Synchronisation pour l'insertion de données dans des maillages 3D : Synchonization for 3D mesh watermarking. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2014MON20221

Chicago Manual of Style (16th Edition):

Tournier, Nicolas. “Synchronisation pour l'insertion de données dans des maillages 3D : Synchonization for 3D mesh watermarking.” 2014. Doctoral Dissertation, Université Montpellier II. Accessed April 07, 2020. http://www.theses.fr/2014MON20221.

MLA Handbook (7th Edition):

Tournier, Nicolas. “Synchronisation pour l'insertion de données dans des maillages 3D : Synchonization for 3D mesh watermarking.” 2014. Web. 07 Apr 2020.

Vancouver:

Tournier N. Synchronisation pour l'insertion de données dans des maillages 3D : Synchonization for 3D mesh watermarking. [Internet] [Doctoral dissertation]. Université Montpellier II; 2014. [cited 2020 Apr 07]. Available from: http://www.theses.fr/2014MON20221.

Council of Science Editors:

Tournier N. Synchronisation pour l'insertion de données dans des maillages 3D : Synchonization for 3D mesh watermarking. [Doctoral Dissertation]. Université Montpellier II; 2014. Available from: http://www.theses.fr/2014MON20221


Miami University

3. Zhang, Yuan. MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags.

Degree: Master of Computer Science, Computer Science and Systems Analysis, 2010, Miami University

 In the thesis we present a new algorithm for the assembly of ESTs based on a minimum spanning tree construction. By representing the EST input… (more)

Subjects/Keywords: Bioinformatics; EST assembly; assembler; minimum spanning tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2010). MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags. (Masters Thesis). Miami University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=miami1273245641

Chicago Manual of Style (16th Edition):

Zhang, Yuan. “MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags.” 2010. Masters Thesis, Miami University. Accessed April 07, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=miami1273245641.

MLA Handbook (7th Edition):

Zhang, Yuan. “MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags.” 2010. Web. 07 Apr 2020.

Vancouver:

Zhang Y. MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags. [Internet] [Masters thesis]. Miami University; 2010. [cited 2020 Apr 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1273245641.

Council of Science Editors:

Zhang Y. MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags. [Masters Thesis]. Miami University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1273245641


University of Victoria

4. Rahmati, Zahed. Simple, Faster Kinetic Data Structures.

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

 Proximity problems and point set embeddability problems are fundamental and well-studied in computational geometry and graph drawing. Examples of such problems that are of particular… (more)

Subjects/Keywords: Kinetic Data Structures; Proximity Problems; Point Set Embedding Problem; Euclidean Minimum Spanning Tree; Closest Pair; All Nearest Neighbors; Reverse k-Nearest Neighbor Queries; Yao Graph; Semi-Yao graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahmati, Z. (2014). Simple, Faster Kinetic Data Structures. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5627

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

Rahmati, Zahed. “Simple, Faster Kinetic Data Structures.” 2014. Thesis, University of Victoria. Accessed April 07, 2020. http://hdl.handle.net/1828/5627.

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

MLA Handbook (7th Edition):

Rahmati, Zahed. “Simple, Faster Kinetic Data Structures.” 2014. Web. 07 Apr 2020.

Vancouver:

Rahmati Z. Simple, Faster Kinetic Data Structures. [Internet] [Thesis]. University of Victoria; 2014. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1828/5627.

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

Council of Science Editors:

Rahmati Z. Simple, Faster Kinetic Data Structures. [Thesis]. University of Victoria; 2014. Available from: http://hdl.handle.net/1828/5627

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


California State University – Northridge

5. Khachatryan, Armine. Algorithm Visualization.

Degree: MS, Department of Computer Science, 2020, California State University – Northridge

 Algorithms are an important topic in both computer science and software engineering because they form the foundation of creating efficient programs and applications. I created… (more)

Subjects/Keywords: Kruskal's Minimum Spanning Tree; Dissertations, Academic  – CSUN  – Computer Science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khachatryan, A. (2020). Algorithm Visualization. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.3/214746

Chicago Manual of Style (16th Edition):

Khachatryan, Armine. “Algorithm Visualization.” 2020. Masters Thesis, California State University – Northridge. Accessed April 07, 2020. http://hdl.handle.net/10211.3/214746.

MLA Handbook (7th Edition):

Khachatryan, Armine. “Algorithm Visualization.” 2020. Web. 07 Apr 2020.

Vancouver:

Khachatryan A. Algorithm Visualization. [Internet] [Masters thesis]. California State University – Northridge; 2020. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10211.3/214746.

Council of Science Editors:

Khachatryan A. Algorithm Visualization. [Masters Thesis]. California State University – Northridge; 2020. Available from: http://hdl.handle.net/10211.3/214746


California State University – Northridge

6. Khachatryan, Armine. Algorithm Visualization.

Degree: MS, Department of Computer Science, 2020, California State University – Northridge

 Algorithms are an important topic in both computer science and software engineering because they form the foundation of creating efficient programs and applications. I created… (more)

Subjects/Keywords: Kruskal's Minimum Spanning Tree; Dissertations, Academic  – CSUN  – Computer Science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khachatryan, A. (2020). Algorithm Visualization. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.3/214747

Chicago Manual of Style (16th Edition):

Khachatryan, Armine. “Algorithm Visualization.” 2020. Masters Thesis, California State University – Northridge. Accessed April 07, 2020. http://hdl.handle.net/10211.3/214747.

MLA Handbook (7th Edition):

Khachatryan, Armine. “Algorithm Visualization.” 2020. Web. 07 Apr 2020.

Vancouver:

Khachatryan A. Algorithm Visualization. [Internet] [Masters thesis]. California State University – Northridge; 2020. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10211.3/214747.

Council of Science Editors:

Khachatryan A. Algorithm Visualization. [Masters Thesis]. California State University – Northridge; 2020. Available from: http://hdl.handle.net/10211.3/214747

7. Qiao, Wenbao. GPU component-based neighborhood search for Euclidean graph minimization problems : Méthodes GPU de recherche par voisinage pour les problèmes de minimisation de graphes Euclidiens.

Degree: Docteur es, Informatique, 2018, Bourgogne Franche-Comté

Dans cette thèse, nous proposons des solutions parrallèles basées sur le systèmes actuel GPU (graphics processing unit) pour deux problèmes de minimisation de graphe Euclidien,… (more)

Subjects/Keywords: Recherche en spirale Bentley; Gpu; Problème du voyageur de commerce; Massifs 2-/3-Opt mouvements; Recherche K-D; Parallèles 2-Opt; Bentley sprial search; Gpu; GPU parallel 2-Opt; Multiple 2-Opt moves; Euclidean minimum spanning tree; K-D search; 006

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiao, W. (2018). GPU component-based neighborhood search for Euclidean graph minimization problems : Méthodes GPU de recherche par voisinage pour les problèmes de minimisation de graphes Euclidiens. (Doctoral Dissertation). Bourgogne Franche-Comté. Retrieved from http://www.theses.fr/2018UBFCA020

Chicago Manual of Style (16th Edition):

Qiao, Wenbao. “GPU component-based neighborhood search for Euclidean graph minimization problems : Méthodes GPU de recherche par voisinage pour les problèmes de minimisation de graphes Euclidiens.” 2018. Doctoral Dissertation, Bourgogne Franche-Comté. Accessed April 07, 2020. http://www.theses.fr/2018UBFCA020.

MLA Handbook (7th Edition):

Qiao, Wenbao. “GPU component-based neighborhood search for Euclidean graph minimization problems : Méthodes GPU de recherche par voisinage pour les problèmes de minimisation de graphes Euclidiens.” 2018. Web. 07 Apr 2020.

Vancouver:

Qiao W. GPU component-based neighborhood search for Euclidean graph minimization problems : Méthodes GPU de recherche par voisinage pour les problèmes de minimisation de graphes Euclidiens. [Internet] [Doctoral dissertation]. Bourgogne Franche-Comté; 2018. [cited 2020 Apr 07]. Available from: http://www.theses.fr/2018UBFCA020.

Council of Science Editors:

Qiao W. GPU component-based neighborhood search for Euclidean graph minimization problems : Méthodes GPU de recherche par voisinage pour les problèmes de minimisation de graphes Euclidiens. [Doctoral Dissertation]. Bourgogne Franche-Comté; 2018. Available from: http://www.theses.fr/2018UBFCA020


Tokyo Institute of Technology / 東京工業大学

8. Fu, Jing. Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用.

Degree: 博士(工学), 2015, Tokyo Institute of Technology / 東京工業大学

 In this dissertation, we pay a particular attention to the application of game theory in three multi-agent negotiation problems: minimum cost spanning tree, data envelopment… (more)

Subjects/Keywords: game theory; negotiation problem; minimum cost spanning tree; data envelopment analysis; airline alliance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fu, J. (2015). Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用. (Thesis). Tokyo Institute of Technology / 東京工業大学. Retrieved from http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100687143

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

Fu, Jing. “Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用.” 2015. Thesis, Tokyo Institute of Technology / 東京工業大学. Accessed April 07, 2020. http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100687143.

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

MLA Handbook (7th Edition):

Fu, Jing. “Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用.” 2015. Web. 07 Apr 2020.

Vancouver:

Fu J. Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用. [Internet] [Thesis]. Tokyo Institute of Technology / 東京工業大学; 2015. [cited 2020 Apr 07]. Available from: http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100687143.

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

Council of Science Editors:

Fu J. Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用. [Thesis]. Tokyo Institute of Technology / 東京工業大学; 2015. Available from: http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100687143

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


Tokyo Institute of Technology / 東京工業大学

9. Fu, Jing. Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用.

Degree: 博士(工学), 2014, Tokyo Institute of Technology / 東京工業大学

 In this dissertation, we pay a particular attention to the application of game theory in three multi-agent negotiation problems: minimum cost spanning tree, data envelopment… (more)

Subjects/Keywords: game theory; negotiation problem; minimum cost spanning tree; data envelopment analysis; airline alliance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fu, J. (2014). Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用. (Thesis). Tokyo Institute of Technology / 東京工業大学. Retrieved from http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100666709

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

Fu, Jing. “Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用.” 2014. Thesis, Tokyo Institute of Technology / 東京工業大学. Accessed April 07, 2020. http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100666709.

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

MLA Handbook (7th Edition):

Fu, Jing. “Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用.” 2014. Web. 07 Apr 2020.

Vancouver:

Fu J. Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用. [Internet] [Thesis]. Tokyo Institute of Technology / 東京工業大学; 2014. [cited 2020 Apr 07]. Available from: http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100666709.

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

Council of Science Editors:

Fu J. Application of Game Theory to Negotiation Problems : Application of Game Theory to Negotiation Problems; 交渉問題へのゲーム理論の応用. [Thesis]. Tokyo Institute of Technology / 東京工業大学; 2014. Available from: http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100666709

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


Bowling Green State University

10. Zhang, Yinghua. Stock Market Network Topology Analysis Based on a Minimum Spanning Tree Approach.

Degree: MS, Physics, 2009, Bowling Green State University

 In essence, the stock market is a complex network. The price fluctuations among variousstocks have complicated relationships. In my research, I analyze the dynamics of… (more)

Subjects/Keywords: Physics; Minimum Spanning Tree; Visualization; Correlation Matrices; Correlation Networks; Random Matrix Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2009). Stock Market Network Topology Analysis Based on a Minimum Spanning Tree Approach. (Masters Thesis). Bowling Green State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1245347181

Chicago Manual of Style (16th Edition):

Zhang, Yinghua. “Stock Market Network Topology Analysis Based on a Minimum Spanning Tree Approach.” 2009. Masters Thesis, Bowling Green State University. Accessed April 07, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1245347181.

MLA Handbook (7th Edition):

Zhang, Yinghua. “Stock Market Network Topology Analysis Based on a Minimum Spanning Tree Approach.” 2009. Web. 07 Apr 2020.

Vancouver:

Zhang Y. Stock Market Network Topology Analysis Based on a Minimum Spanning Tree Approach. [Internet] [Masters thesis]. Bowling Green State University; 2009. [cited 2020 Apr 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1245347181.

Council of Science Editors:

Zhang Y. Stock Market Network Topology Analysis Based on a Minimum Spanning Tree Approach. [Masters Thesis]. Bowling Green State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1245347181

11. Do, Hiep-Thuan. Extensibilité des moyens de traitements pour les données issues des vastes systèmes d'informations géographiques : Extending tools for geographic information systems data.

Degree: Docteur es, Informatique, 2011, Université d'Orléans

Cette thèse s’inscrit dans le cadre de l’évolution des Systèmes d’Informations Géographiques (SIG) et de leur capacité à répondre à des problématiques environnementales qui s’expriment… (more)

Subjects/Keywords: Modèle numérique de terrain; Arbre couvrant de poids minimum; Ligne de partage des eaux; Digital elevation model; Minimum Spanning Tree; Watershed

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Do, H. (2011). Extensibilité des moyens de traitements pour les données issues des vastes systèmes d'informations géographiques : Extending tools for geographic information systems data. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2011ORLE2068

Chicago Manual of Style (16th Edition):

Do, Hiep-Thuan. “Extensibilité des moyens de traitements pour les données issues des vastes systèmes d'informations géographiques : Extending tools for geographic information systems data.” 2011. Doctoral Dissertation, Université d'Orléans. Accessed April 07, 2020. http://www.theses.fr/2011ORLE2068.

MLA Handbook (7th Edition):

Do, Hiep-Thuan. “Extensibilité des moyens de traitements pour les données issues des vastes systèmes d'informations géographiques : Extending tools for geographic information systems data.” 2011. Web. 07 Apr 2020.

Vancouver:

Do H. Extensibilité des moyens de traitements pour les données issues des vastes systèmes d'informations géographiques : Extending tools for geographic information systems data. [Internet] [Doctoral dissertation]. Université d'Orléans; 2011. [cited 2020 Apr 07]. Available from: http://www.theses.fr/2011ORLE2068.

Council of Science Editors:

Do H. Extensibilité des moyens de traitements pour les données issues des vastes systèmes d'informations géographiques : Extending tools for geographic information systems data. [Doctoral Dissertation]. Université d'Orléans; 2011. Available from: http://www.theses.fr/2011ORLE2068


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

12. Γκάρας, Αντώνιος. Στατιστική μηχανική περίπλοκων συστημάτων και δικτύων.

Degree: 2009, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

 Στην παρούσα διδακτορική διατριβή μελετάμε την περιπλοκότητα δικτύων επικοινωνίας, δικτύων συνεργασίας και οικονομικών συστημάτων. Χρησιμοποιούμε πολύ γενικές μεθόδους που στηρίζονται κυρίως στη θεωρία γράφων. Κάθε… (more)

Subjects/Keywords: Περίπλοκα συστήματα; Δίκτυα; Δίκτυα συνεργασίας; Οικονοφυσική; Minimum spanning tree; Overlapping tree network; Complex systems; Networks; Collaboration networks; Econophysics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Γκάρας, . . (2009). Στατιστική μηχανική περίπλοκων συστημάτων και δικτύων. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/20539

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

Γκάρας, Αντώνιος. “Στατιστική μηχανική περίπλοκων συστημάτων και δικτύων.” 2009. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed April 07, 2020. http://hdl.handle.net/10442/hedi/20539.

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

MLA Handbook (7th Edition):

Γκάρας, Αντώνιος. “Στατιστική μηχανική περίπλοκων συστημάτων και δικτύων.” 2009. Web. 07 Apr 2020.

Vancouver:

Γκάρας . Στατιστική μηχανική περίπλοκων συστημάτων και δικτύων. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2009. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10442/hedi/20539.

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

Council of Science Editors:

Γκάρας . Στατιστική μηχανική περίπλοκων συστημάτων και δικτύων. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2009. Available from: http://hdl.handle.net/10442/hedi/20539

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

13. Mashreghi, Ali. Distributed broadcast and minimum spanning tree algorithms with low communication complexity.

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

 In distributed computing, a set of processors that have their own input collaborate to compute a function. Processors can communicate by exchanging messages of limited… (more)

Subjects/Keywords: distributed computing; minimum spanning tree; broadcast tree

…problems. 5 Chapter 2 Distributed Broadcast and Minimum Spanning Tree We start by describing… …x29; messages. A spanning tree is also known as a broadcast tree. 2. Minimum Spanning Tree… …spanning tree with the minimum weight among all spanning trees. If the input graph is… …that the minimum spanning tree (or forest) is unique. 3. Breadth First Search Tree… …is executed by every node x and constructs the minimum spanning tree or forest: 1. time ← 0… 

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

Mashreghi, A. (2020). Distributed broadcast and minimum spanning tree algorithms with low communication complexity. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11532

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

Mashreghi, Ali. “Distributed broadcast and minimum spanning tree algorithms with low communication complexity.” 2020. Thesis, University of Victoria. Accessed April 07, 2020. http://hdl.handle.net/1828/11532.

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

MLA Handbook (7th Edition):

Mashreghi, Ali. “Distributed broadcast and minimum spanning tree algorithms with low communication complexity.” 2020. Web. 07 Apr 2020.

Vancouver:

Mashreghi A. Distributed broadcast and minimum spanning tree algorithms with low communication complexity. [Internet] [Thesis]. University of Victoria; 2020. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1828/11532.

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

Council of Science Editors:

Mashreghi A. Distributed broadcast and minimum spanning tree algorithms with low communication complexity. [Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/11532

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


University of South Africa

14. De Wet, Pieter Oloff. Geometric Steiner minimal trees .

Degree: 2009, University of South Africa

 In 1992 Du and Hwang published a paper confirming the correctness of a well known 1968 conjecture of Gilbert and Pollak suggesting that the Euclidean(more)

Subjects/Keywords: Minkowski space; Spanning tree; Minimum spanning tree; Steiner tree; Steiner minimal tree; Steiner ratio; Rectilinear tree; Hexagonal tree; Surface; Inner spanning tree; Inner Steiner tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Wet, P. O. (2009). Geometric Steiner minimal trees . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/1981

Chicago Manual of Style (16th Edition):

De Wet, Pieter Oloff. “Geometric Steiner minimal trees .” 2009. Doctoral Dissertation, University of South Africa. Accessed April 07, 2020. http://hdl.handle.net/10500/1981.

MLA Handbook (7th Edition):

De Wet, Pieter Oloff. “Geometric Steiner minimal trees .” 2009. Web. 07 Apr 2020.

Vancouver:

De Wet PO. Geometric Steiner minimal trees . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10500/1981.

Council of Science Editors:

De Wet PO. Geometric Steiner minimal trees . [Doctoral Dissertation]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/1981

15. Oshiro, Marcio Takashi Iura. k-árvores de custo mínimo.

Degree: Mestrado, Ciência da Computação, 2010, University of São Paulo

Esta dissertação trata do problema da k-árvore de custo mínimo (kMST): dados um grafo conexo G, um custo não-negativo c_e para cada aresta e e… (more)

Subjects/Keywords: Algoritmos de Aproximacao; Approximation Algorithms; Árvore Geradora Mínima; Combinatorial Optimization; k-MST; k-MST; Minimum Cost Spanning Tree; Otimização Combinatória

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oshiro, M. T. I. (2010). k-árvores de custo mínimo. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-28052012-091652/ ;

Chicago Manual of Style (16th Edition):

Oshiro, Marcio Takashi Iura. “k-árvores de custo mínimo.” 2010. Masters Thesis, University of São Paulo. Accessed April 07, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-28052012-091652/ ;.

MLA Handbook (7th Edition):

Oshiro, Marcio Takashi Iura. “k-árvores de custo mínimo.” 2010. Web. 07 Apr 2020.

Vancouver:

Oshiro MTI. k-árvores de custo mínimo. [Internet] [Masters thesis]. University of São Paulo; 2010. [cited 2020 Apr 07]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-28052012-091652/ ;.

Council of Science Editors:

Oshiro MTI. k-árvores de custo mínimo. [Masters Thesis]. University of São Paulo; 2010. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-28052012-091652/ ;


University of Newcastle

16. Abu Zaher, Amer. A new feature selection approach based on proximity graphs and evolutionary computation.

Degree: PhD, 2017, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

Feature selection is an important step for generating new knowledge from datasets that originate from high-throughput biotechnologies. The… (more)

Subjects/Keywords: feature selection; evolutionary algorithm; proximity graph; minimum spanning tree; k-nearest neighbours graph; relative neighbourhood graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abu Zaher, A. (2017). A new feature selection approach based on proximity graphs and evolutionary computation. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1349840

Chicago Manual of Style (16th Edition):

Abu Zaher, Amer. “A new feature selection approach based on proximity graphs and evolutionary computation.” 2017. Doctoral Dissertation, University of Newcastle. Accessed April 07, 2020. http://hdl.handle.net/1959.13/1349840.

MLA Handbook (7th Edition):

Abu Zaher, Amer. “A new feature selection approach based on proximity graphs and evolutionary computation.” 2017. Web. 07 Apr 2020.

Vancouver:

Abu Zaher A. A new feature selection approach based on proximity graphs and evolutionary computation. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1959.13/1349840.

Council of Science Editors:

Abu Zaher A. A new feature selection approach based on proximity graphs and evolutionary computation. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1349840


Brno University of Technology

17. Ott, Lukáš. Grafy, grafové algoritmy a jejich využití při hledání nejkratší cesty .

Degree: 2010, Brno University of Technology

 Bakalářská práce je zaměřena na seznámení se s teorií grafů a grafových algoritmů pro hledání nejkratší cesty a následnou implementací získaných poznatků do programu MS… (more)

Subjects/Keywords: Graf; grafový algoritmus; cesta; minimální kostra grafu; VBA; praktické využití.; Graph; graph algorithm; path; minimum spanning tree; VBA; practical use.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ott, L. (2010). Grafy, grafové algoritmy a jejich využití při hledání nejkratší cesty . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/1551

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

Ott, Lukáš. “Grafy, grafové algoritmy a jejich využití při hledání nejkratší cesty .” 2010. Thesis, Brno University of Technology. Accessed April 07, 2020. http://hdl.handle.net/11012/1551.

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

MLA Handbook (7th Edition):

Ott, Lukáš. “Grafy, grafové algoritmy a jejich využití při hledání nejkratší cesty .” 2010. Web. 07 Apr 2020.

Vancouver:

Ott L. Grafy, grafové algoritmy a jejich využití při hledání nejkratší cesty . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/11012/1551.

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

Council of Science Editors:

Ott L. Grafy, grafové algoritmy a jejich využití při hledání nejkratší cesty . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/1551

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


Brno University of Technology

18. Římský, Adam. Využití teorie grafů pro návrh a optimalizaci architektur datových sítí .

Degree: 2010, Brno University of Technology

 Tato diplomová práce se zabývá využitím teorie grafů v oblasti datových sítí a to konkrétně v jejich návrhu a optimalizaci. Úvod práce tvoří obecný popis… (more)

Subjects/Keywords: Teorie grafů; graf; orientovaný; neorientovaný; OSPF; Dijkstra; minimální kostra; tok; Graph theory; graph; directed; undirected; OSPF; Dijkstra; minimum spanning tree; flow

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Římský, A. (2010). Využití teorie grafů pro návrh a optimalizaci architektur datových sítí . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4656

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

Římský, Adam. “Využití teorie grafů pro návrh a optimalizaci architektur datových sítí .” 2010. Thesis, Brno University of Technology. Accessed April 07, 2020. http://hdl.handle.net/11012/4656.

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

MLA Handbook (7th Edition):

Římský, Adam. “Využití teorie grafů pro návrh a optimalizaci architektur datových sítí .” 2010. Web. 07 Apr 2020.

Vancouver:

Římský A. Využití teorie grafů pro návrh a optimalizaci architektur datových sítí . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/11012/4656.

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

Council of Science Editors:

Římský A. Využití teorie grafů pro návrh a optimalizaci architektur datových sítí . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/4656

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

19. Clemens, Jason. Spanning tree modulus: deflation and a hierarchical graph structure.

Degree: PhD, Department of Mathematics, 2018, Kansas State University

 The concept of discrete p-modulus provides a general framework for understanding arbitrary families of objects on a graph. The p-modulus provides a sense of ``structure''… (more)

Subjects/Keywords: Modulus; Spanning tree; Minimum spanning trees; Graph structure; Greedy algorithm

…computing it. The approach for the algorithm is greedy, which uses the minimum spanning tree at… …problems. Most of these fall into the category of minimum spanning tree (MST) problems… …The first, and most notable problem is that of simply finding a minimum spanning tree of a… …algorithm removes edges that cannot belong to the minimum spanning tree. This algorithm has linear… …x29;, is that of finding a minimum spanning tree on each step. Thus it relies heavily on the… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clemens, J. (2018). Spanning tree modulus: deflation and a hierarchical graph structure. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39115

Chicago Manual of Style (16th Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Doctoral Dissertation, Kansas State University. Accessed April 07, 2020. http://hdl.handle.net/2097/39115.

MLA Handbook (7th Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Web. 07 Apr 2020.

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/2097/39115.

Council of Science Editors:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Doctoral Dissertation]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/39115

20. Givanaldo Rocha de Souza. Uma abordagem por nuvem de partículas para problemas de otimização combinatória.

Degree: 2006, Universidade Federal do Rio Grande do Norte

Os problemas de otimização combinatória têm como objetivo maximizar ou minimizar uma função definida sobre um certo domínio finito. Já as metaheurísticas são procedimentos destinados… (more)

Subjects/Keywords: Caixeiro viajante; Otimização combinatória; Nuvem de partículas; Árvore geradora mínima - Restrita em grau multiobjetivo; SISTEMAS DE COMPUTACAO; Combinatorial optimization; Traveling salesman; Particle swarm; Minimum spanning tree; Multicriteria degree constrained

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Souza, G. R. d. (2006). Uma abordagem por nuvem de partículas para problemas de otimização combinatória. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1547

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

Souza, Givanaldo Rocha de. “Uma abordagem por nuvem de partículas para problemas de otimização combinatória.” 2006. Thesis, Universidade Federal do Rio Grande do Norte. Accessed April 07, 2020. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1547.

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

MLA Handbook (7th Edition):

Souza, Givanaldo Rocha de. “Uma abordagem por nuvem de partículas para problemas de otimização combinatória.” 2006. Web. 07 Apr 2020.

Vancouver:

Souza GRd. Uma abordagem por nuvem de partículas para problemas de otimização combinatória. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2006. [cited 2020 Apr 07]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1547.

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

Council of Science Editors:

Souza GRd. Uma abordagem por nuvem de partículas para problemas de otimização combinatória. [Thesis]. Universidade Federal do Rio Grande do Norte; 2006. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1547

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


Universidade Federal de Santa Maria

21. Fernando de Cristo. DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO.

Degree: 2008, Universidade Federal de Santa Maria

O problema da árvore geradora mínima generalizado está presente em várias situações do mundo real, tais como no contexto das telecomunicações, transportes e agrupamento de… (more)

Subjects/Keywords: problema da árvore de geradora mínima generalizado; otimização em grafos; metaheurísticas; ENGENHARIA DE PRODUCAO; generalized minimum spanning tree problem; graph optimization; metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cristo, F. d. (2008). DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO. (Thesis). Universidade Federal de Santa Maria. Retrieved from http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=1984

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

Cristo, Fernando de. “DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO.” 2008. Thesis, Universidade Federal de Santa Maria. Accessed April 07, 2020. http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=1984.

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

MLA Handbook (7th Edition):

Cristo, Fernando de. “DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO.” 2008. Web. 07 Apr 2020.

Vancouver:

Cristo Fd. DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO. [Internet] [Thesis]. Universidade Federal de Santa Maria; 2008. [cited 2020 Apr 07]. Available from: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=1984.

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

Council of Science Editors:

Cristo Fd. DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO. [Thesis]. Universidade Federal de Santa Maria; 2008. Available from: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=1984

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

22. LI YUAN. Distributed construction of resource-efficient overlay tree by approximating MST.

Degree: 2004, National University of Singapore

Subjects/Keywords: application-layer multicast; overlay; resource-efficient; minimum spanning tree; scalability; distributed

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

YUAN, L. (2004). Distributed construction of resource-efficient overlay tree by approximating MST. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/14075

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

YUAN, LI. “Distributed construction of resource-efficient overlay tree by approximating MST.” 2004. Thesis, National University of Singapore. Accessed April 07, 2020. http://scholarbank.nus.edu.sg/handle/10635/14075.

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

MLA Handbook (7th Edition):

YUAN, LI. “Distributed construction of resource-efficient overlay tree by approximating MST.” 2004. Web. 07 Apr 2020.

Vancouver:

YUAN L. Distributed construction of resource-efficient overlay tree by approximating MST. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2020 Apr 07]. Available from: http://scholarbank.nus.edu.sg/handle/10635/14075.

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

Council of Science Editors:

YUAN L. Distributed construction of resource-efficient overlay tree by approximating MST. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/14075

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

23. Hossain, Mohammad Forhad. Spanning Tree Approach On The Snow Cleaning Problem.

Degree: Computer Engineering, 2010, Dalarna University

  Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning… (more)

Subjects/Keywords: Snow Cleaning; Minimum Spanning Tree; Heuristic; prim’s algorithm; Greedy Algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. F. (2010). Spanning Tree Approach On The Snow Cleaning Problem. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Thesis, Dalarna University. Accessed April 07, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

MLA Handbook (7th Edition):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Web. 07 Apr 2020.

Vancouver:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Internet] [Thesis]. Dalarna University; 2010. [cited 2020 Apr 07]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

Council of Science Editors:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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


Georgia Southern University

24. Yalman, Demet. Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2015, Georgia Southern University

  In this thesis, we examine two topics. In the first part, we consider Leech tree which is a tree of order n with positive… (more)

Subjects/Keywords: ETD; Edge-swap heuristic; Dense tree; Minimum spanning tree; Leech tree; Modular Leech tree; Distances between leaves; Discrete Mathematics and Combinatorics; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yalman, D. (2015). Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/1297

Chicago Manual of Style (16th Edition):

Yalman, Demet. “Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications.” 2015. Masters Thesis, Georgia Southern University. Accessed April 07, 2020. https://digitalcommons.georgiasouthern.edu/etd/1297.

MLA Handbook (7th Edition):

Yalman, Demet. “Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications.” 2015. Web. 07 Apr 2020.

Vancouver:

Yalman D. Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications. [Internet] [Masters thesis]. Georgia Southern University; 2015. [cited 2020 Apr 07]. Available from: https://digitalcommons.georgiasouthern.edu/etd/1297.

Council of Science Editors:

Yalman D. Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications. [Masters Thesis]. Georgia Southern University; 2015. Available from: https://digitalcommons.georgiasouthern.edu/etd/1297


Université Catholique de Louvain

25. Montoisy, Clément. Comparison of alternative methods to infer the financial network: How companies are influential in a financial market?.

Degree: 2016, Université Catholique de Louvain

Along this thesis the analysis is based on a sample of daily closing prices of 40 different companies representing the Belgian financial market. To do… (more)

Subjects/Keywords: Minimal Spanning Tree; Granger causality network; Hierarchical Tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Montoisy, C. (2016). Comparison of alternative methods to infer the financial network: How companies are influential in a financial market?. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:7081

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

Montoisy, Clément. “Comparison of alternative methods to infer the financial network: How companies are influential in a financial market?.” 2016. Thesis, Université Catholique de Louvain. Accessed April 07, 2020. http://hdl.handle.net/2078.1/thesis:7081.

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

MLA Handbook (7th Edition):

Montoisy, Clément. “Comparison of alternative methods to infer the financial network: How companies are influential in a financial market?.” 2016. Web. 07 Apr 2020.

Vancouver:

Montoisy C. Comparison of alternative methods to infer the financial network: How companies are influential in a financial market?. [Internet] [Thesis]. Université Catholique de Louvain; 2016. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/2078.1/thesis:7081.

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

Council of Science Editors:

Montoisy C. Comparison of alternative methods to infer the financial network: How companies are influential in a financial market?. [Thesis]. Université Catholique de Louvain; 2016. Available from: http://hdl.handle.net/2078.1/thesis:7081

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


University of Melbourne

26. KIRSZENBLAT, DAVID. The Steiner ratio conjecture for eight points.

Degree: 2014, University of Melbourne

 Given a set X of n points in the euclidean plane R2, a Steiner minimal tree is a shortest network interconnecting X. Note that a… (more)

Subjects/Keywords: Steiner tree; spanning tree; Steiner ratio; variational approach; convexity; rigidity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KIRSZENBLAT, D. (2014). The Steiner ratio conjecture for eight points. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/44115

Chicago Manual of Style (16th Edition):

KIRSZENBLAT, DAVID. “The Steiner ratio conjecture for eight points.” 2014. Masters Thesis, University of Melbourne. Accessed April 07, 2020. http://hdl.handle.net/11343/44115.

MLA Handbook (7th Edition):

KIRSZENBLAT, DAVID. “The Steiner ratio conjecture for eight points.” 2014. Web. 07 Apr 2020.

Vancouver:

KIRSZENBLAT D. The Steiner ratio conjecture for eight points. [Internet] [Masters thesis]. University of Melbourne; 2014. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/11343/44115.

Council of Science Editors:

KIRSZENBLAT D. The Steiner ratio conjecture for eight points. [Masters Thesis]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/44115


University of Alberta

27. Smith, Jacqueline. Minimum Degree Spanning Trees on Bipartite Permutation Graphs.

Degree: MS, Department of Computing Science, 2011, University of Alberta

 The minimum degree spanning tree problem is a widely studied NP-hard variation of the minimum spanning tree problem, and a generalization of the Hamiltonian path… (more)

Subjects/Keywords: chain graphs; minimum degree spanning trees; bipartite permutation graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smith, J. (2011). Minimum Degree Spanning Trees on Bipartite Permutation Graphs. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/zg64tk93r

Chicago Manual of Style (16th Edition):

Smith, Jacqueline. “Minimum Degree Spanning Trees on Bipartite Permutation Graphs.” 2011. Masters Thesis, University of Alberta. Accessed April 07, 2020. https://era.library.ualberta.ca/files/zg64tk93r.

MLA Handbook (7th Edition):

Smith, Jacqueline. “Minimum Degree Spanning Trees on Bipartite Permutation Graphs.” 2011. Web. 07 Apr 2020.

Vancouver:

Smith J. Minimum Degree Spanning Trees on Bipartite Permutation Graphs. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Apr 07]. Available from: https://era.library.ualberta.ca/files/zg64tk93r.

Council of Science Editors:

Smith J. Minimum Degree Spanning Trees on Bipartite Permutation Graphs. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/zg64tk93r

28. Schaeffer, Satu Elisa. Algorithms for Nonuniform Networks.

Degree: 2006, Helsinki University of Technology

In this thesis, observations on structural properties of natural networks are taken as a starting point for developing efficient algorithms for natural instances of different… (more)

Subjects/Keywords: community structure; graph algorithm; graph clustering; graph data mining; graph similarity; local search; minimum spanning tree; network model; nonuniform network; random graph; random sampling; routing; scale-free network; shortest path algorithm; small-world network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schaeffer, S. E. (2006). Algorithms for Nonuniform Networks. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512281198/

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

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Thesis, Helsinki University of Technology. Accessed April 07, 2020. http://lib.tkk.fi/Diss/2006/isbn9512281198/.

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

MLA Handbook (7th Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 07 Apr 2020.

Vancouver:

Schaeffer SE. Algorithms for Nonuniform Networks. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2020 Apr 07]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/.

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

Council of Science Editors:

Schaeffer SE. Algorithms for Nonuniform Networks. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/

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

29. Σταθοπούλου, Ευθυμία. Ελάχιστα γεννητικά δένδρα με πολλαπλά κριτήρια.

Degree: 2005, University of Patras

Η εύρεση γεννητικών δέντρων ελάχιστου-κόστους αποτελεί ένα κλασικό επιστημονικό πρόβλημα με σημαντικές εφαρμογές στη σχεδίαση δικτύων. Δοθέντος ενός γραφήματος, όπου κάθε πλευρά σχετίζεται με ένα… (more)

Subjects/Keywords: Ελάχιστο γεννητικό δέντρο; Πολυκριτηριακή βελτιστοποίηση; Βελτιστοποίηση κατά Pareto; 629.831 2; Minimum spanning tree; Multi-criteria optimization; Pareto optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Σταθοπούλου, . (2005). Ελάχιστα γεννητικά δένδρα με πολλαπλά κριτήρια. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/133

Chicago Manual of Style (16th Edition):

Σταθοπούλου, Ευθυμία. “Ελάχιστα γεννητικά δένδρα με πολλαπλά κριτήρια.” 2005. Masters Thesis, University of Patras. Accessed April 07, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/133.

MLA Handbook (7th Edition):

Σταθοπούλου, Ευθυμία. “Ελάχιστα γεννητικά δένδρα με πολλαπλά κριτήρια.” 2005. Web. 07 Apr 2020.

Vancouver:

Σταθοπούλου . Ελάχιστα γεννητικά δένδρα με πολλαπλά κριτήρια. [Internet] [Masters thesis]. University of Patras; 2005. [cited 2020 Apr 07]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/133.

Council of Science Editors:

Σταθοπούλου . Ελάχιστα γεννητικά δένδρα με πολλαπλά κριτήρια. [Masters Thesis]. University of Patras; 2005. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/133


Universidade do Estado do Rio de Janeiro

30. Kleber Hochwart Cardoso. Implementação distribuída de auto-cura em redes inteligentes de distribuição de energia elétrica utilizando árvores de extensão mínima.

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

A propriedade de auto-cura, em redes inteligente de distribuição de energia elétrica, consiste em encontrar uma proposta de reconfiguração do sistema de distribuição com o… (more)

Subjects/Keywords: Engenharia Eletrônica; Auto-cura; Árvores de extensão mínima; Computação distribuída; Redes inteligentes de distribuição; Algoritmo GHS; Electronic Engineering; Self-healing; Minimum spanning tree; Distributed computing; Smart grids Distribution; GHS algorithm; ENGENHARIAS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cardoso, K. H. (2014). Implementação distribuída de auto-cura em redes inteligentes de distribuição de energia elétrica utilizando árvores de extensão mínima. (Masters Thesis). Universidade do Estado do Rio de Janeiro. Retrieved from http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=8018 ;

Chicago Manual of Style (16th Edition):

Cardoso, Kleber Hochwart. “Implementação distribuída de auto-cura em redes inteligentes de distribuição de energia elétrica utilizando árvores de extensão mínima.” 2014. Masters Thesis, Universidade do Estado do Rio de Janeiro. Accessed April 07, 2020. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=8018 ;.

MLA Handbook (7th Edition):

Cardoso, Kleber Hochwart. “Implementação distribuída de auto-cura em redes inteligentes de distribuição de energia elétrica utilizando árvores de extensão mínima.” 2014. Web. 07 Apr 2020.

Vancouver:

Cardoso KH. Implementação distribuída de auto-cura em redes inteligentes de distribuição de energia elétrica utilizando árvores de extensão mínima. [Internet] [Masters thesis]. Universidade do Estado do Rio de Janeiro; 2014. [cited 2020 Apr 07]. Available from: http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=8018 ;.

Council of Science Editors:

Cardoso KH. Implementação distribuída de auto-cura em redes inteligentes de distribuição de energia elétrica utilizando árvores de extensão mínima. [Masters Thesis]. Universidade do Estado do Rio de Janeiro; 2014. Available from: http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=8018 ;

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

.