Advanced search options

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

You searched for `subject:(graph algorithm)`

.
Showing records 1 – 30 of
220 total matches.

◁ [1] [2] [3] [4] [5] [6] [7] [8] ▶

Search Limiters

Dates

- 2015 – 2019 (77)
- 2010 – 2014 (89)
- 2005 – 2009 (56)

Universities

Department

- Informatique (18)
- Computer Science (15)

Degrees

- Docteur es (31)
- PhD (27)
- MS (10)

Country

- US (47)
- Czech Republic (33)
- Canada (31)
- France (31)
- India (13)

▼ Search Limiters

University of Victoria

1. Gorzny, Jan. On End Vertices of Search Algorithms.

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

URL: http://hdl.handle.net/1828/6506

► Given a *graph* G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A *graph* search *algorithm* is a systematic method for…
(more)

Subjects/Keywords: graph theory; search algorithm; end vertex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gorzny, J. (2015). On End Vertices of Search Algorithms. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6506

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

Gorzny, Jan. “On End Vertices of Search Algorithms.” 2015. Masters Thesis, University of Victoria. Accessed December 16, 2019. http://hdl.handle.net/1828/6506.

MLA Handbook (7^{th} Edition):

Gorzny, Jan. “On End Vertices of Search Algorithms.” 2015. Web. 16 Dec 2019.

Vancouver:

Gorzny J. On End Vertices of Search Algorithms. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/1828/6506.

Council of Science Editors:

Gorzny J. On End Vertices of Search Algorithms. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6506

Virginia Tech

2. Aji, Sudarshan Mandayam. Estimating Reachability Set Sizes in Dynamic Graphs.

Degree: MS, Computer Science, 2014, Virginia Tech

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

► Graphs are a commonly used abstraction for diverse kinds of interactions, e.g., on Twitter and Facebook. Different kinds of topological properties of such graphs are…
(more)

Subjects/Keywords: Algorithm; Dynamic graphs; Giraph; Graph framework

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aji, S. M. (2014). Estimating Reachability Set Sizes in Dynamic Graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/49262

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

Aji, Sudarshan Mandayam. “Estimating Reachability Set Sizes in Dynamic Graphs.” 2014. Masters Thesis, Virginia Tech. Accessed December 16, 2019. http://hdl.handle.net/10919/49262.

MLA Handbook (7^{th} Edition):

Aji, Sudarshan Mandayam. “Estimating Reachability Set Sizes in Dynamic Graphs.” 2014. Web. 16 Dec 2019.

Vancouver:

Aji SM. Estimating Reachability Set Sizes in Dynamic Graphs. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10919/49262.

Council of Science Editors:

Aji SM. Estimating Reachability Set Sizes in Dynamic Graphs. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/49262

University of Ottawa

3. Doan, William. Temporal Closeness in Knowledge Mobilization Networks .

Degree: 2016, University of Ottawa

URL: http://hdl.handle.net/10393/34756

► In this thesis we study the impact of time in the analysis of social networks. To do that we represent a knowledge mobilization network, Knowledge-Net,…
(more)

Subjects/Keywords: algorithm; time-varying graph; closeness; knowledge mobilization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Doan, W. (2016). Temporal Closeness in Knowledge Mobilization Networks . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/34756

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Doan, William. “Temporal Closeness in Knowledge Mobilization Networks .” 2016. Thesis, University of Ottawa. Accessed December 16, 2019. http://hdl.handle.net/10393/34756.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Doan, William. “Temporal Closeness in Knowledge Mobilization Networks .” 2016. Web. 16 Dec 2019.

Vancouver:

Doan W. Temporal Closeness in Knowledge Mobilization Networks . [Internet] [Thesis]. University of Ottawa; 2016. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10393/34756.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Doan W. Temporal Closeness in Knowledge Mobilization Networks . [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/34756

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

4.
Rajarathinam, Pavithra.
* Graph* compression using heuristic-based reordering.

Degree: 2018, Iowa State University

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

► Inverted index has been extensively used in Information retrieval systems for document relatedqueries. We consider the generic case of *graph* storage using Inverted Index and…
(more)

Subjects/Keywords: Algorithm; Graph compression; OLA; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rajarathinam, P. (2018). Graph compression using heuristic-based reordering. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16659

Not specified: Masters Thesis or Doctoral Dissertation

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

Rajarathinam, Pavithra. “Graph compression using heuristic-based reordering.” 2018. Thesis, Iowa State University. Accessed December 16, 2019. https://lib.dr.iastate.edu/etd/16659.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rajarathinam, Pavithra. “Graph compression using heuristic-based reordering.” 2018. Web. 16 Dec 2019.

Vancouver:

Rajarathinam P. Graph compression using heuristic-based reordering. [Internet] [Thesis]. Iowa State University; 2018. [cited 2019 Dec 16]. Available from: https://lib.dr.iastate.edu/etd/16659.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajarathinam P. Graph compression using heuristic-based reordering. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16659

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

5. Shi, Yongsheng. Resource Allocation in Cellular Networks with Coexisting Femtocells and Macrocells.

Degree: PhD, Electrical and Computer Engineering, 2010, Virginia Tech

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

► Over the last decade, cellular networks have grown rapidly from circuit-switch-based voice-only networks to IP-based data-dominant networks, embracing not only traditional mobile phones, but also…
(more)

Subjects/Keywords: femtocells; cellular networks; graph theory; random graph; genetic algorithm; Resource allocation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shi, Y. (2010). Resource Allocation in Cellular Networks with Coexisting Femtocells and Macrocells. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/37180

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

Shi, Yongsheng. “Resource Allocation in Cellular Networks with Coexisting Femtocells and Macrocells.” 2010. Doctoral Dissertation, Virginia Tech. Accessed December 16, 2019. http://hdl.handle.net/10919/37180.

MLA Handbook (7^{th} Edition):

Shi, Yongsheng. “Resource Allocation in Cellular Networks with Coexisting Femtocells and Macrocells.” 2010. Web. 16 Dec 2019.

Vancouver:

Shi Y. Resource Allocation in Cellular Networks with Coexisting Femtocells and Macrocells. [Internet] [Doctoral dissertation]. Virginia Tech; 2010. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10919/37180.

Council of Science Editors:

Shi Y. Resource Allocation in Cellular Networks with Coexisting Femtocells and Macrocells. [Doctoral Dissertation]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/37180

Penn State University

6.
Kasiviswanathan, Shiva Prasad.
Approximation Algorithms For *Graph* Problems.

Degree: PhD, Computer Science, 2008, Penn State University

URL: https://etda.libraries.psu.edu/catalog/8897

► This thesis studies approximation algorithms for two fundamental problems arising in *graph* theory: counting copies of one *graph* in another *graph* and estimating distances in…
(more)

Subjects/Keywords: Geometric Disk Graph; Perfect Matching; Subgraph Isomorphism; Approximation Algorithm; Graph theory; Graph Spanner

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kasiviswanathan, S. P. (2008). Approximation Algorithms For Graph Problems. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8897

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

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Doctoral Dissertation, Penn State University. Accessed December 16, 2019. https://etda.libraries.psu.edu/catalog/8897.

MLA Handbook (7^{th} Edition):

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Web. 16 Dec 2019.

Vancouver:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2019 Dec 16]. Available from: https://etda.libraries.psu.edu/catalog/8897.

Council of Science Editors:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Doctoral Dissertation]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8897

Iowa State University

7. Das, Apurba. Incremental and parallel algorithms for dense subgraph mining.

Degree: 2019, Iowa State University

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

► The task of maintaining densely connected subgraphs from a continuously evolving *graph* is important because it solves many practical problems that require constant monitoring over…
(more)

Subjects/Keywords: Graph Mining; Incremental Algorithm; Parallel Algorithm; Computer Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Das, A. (2019). Incremental and parallel algorithms for dense subgraph mining. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16997

Not specified: Masters Thesis or Doctoral Dissertation

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

Das, Apurba. “Incremental and parallel algorithms for dense subgraph mining.” 2019. Thesis, Iowa State University. Accessed December 16, 2019. https://lib.dr.iastate.edu/etd/16997.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Das, Apurba. “Incremental and parallel algorithms for dense subgraph mining.” 2019. Web. 16 Dec 2019.

Vancouver:

Das A. Incremental and parallel algorithms for dense subgraph mining. [Internet] [Thesis]. Iowa State University; 2019. [cited 2019 Dec 16]. Available from: https://lib.dr.iastate.edu/etd/16997.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Das A. Incremental and parallel algorithms for dense subgraph mining. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/16997

Not specified: Masters Thesis or Doctoral Dissertation

University of Manitoba

8.
Jegede, Olawale.
A Study of the Application of Chaos to the Genetic * Algorithm*.

Degree: Electrical and Computer Engineering, 2014, University of Manitoba

URL: http://hdl.handle.net/1993/23428

► This work focuses on the use of a genetic *algorithm* for optimization in a search-based problem. The Genetic *Algorithm* (GA) is a subset of evolutionary…
(more)

Subjects/Keywords: Genetic Algorithm; Chaotic Genetic Algorithm; Minimum EST; Maximum EST; Directed Acyclic Graph; Standard Genetic Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jegede, O. (2014). A Study of the Application of Chaos to the Genetic Algorithm. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/23428

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

Jegede, Olawale. “A Study of the Application of Chaos to the Genetic Algorithm.” 2014. Masters Thesis, University of Manitoba. Accessed December 16, 2019. http://hdl.handle.net/1993/23428.

MLA Handbook (7^{th} Edition):

Jegede, Olawale. “A Study of the Application of Chaos to the Genetic Algorithm.” 2014. Web. 16 Dec 2019.

Vancouver:

Jegede O. A Study of the Application of Chaos to the Genetic Algorithm. [Internet] [Masters thesis]. University of Manitoba; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/1993/23428.

Council of Science Editors:

Jegede O. A Study of the Application of Chaos to the Genetic Algorithm. [Masters Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/23428

Kent State University

9.
Liu, Yufan.
A Survey Of Persistent *Graph* Databases.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2014, Kent State University

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

► *Graph* database has attracted increasing attention from both of the database and data mining/machine learning communities. Enormous kinds of data with complex and dynamic relationships…
(more)

Subjects/Keywords: Computer Engineering; Computer Science; graph database; graph mining; transactional database; benchmark; graph algorithm; GDB; distribute graph processing framework; NOSQL

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Y. (2014). A Survey Of Persistent Graph Databases. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1395166105

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

Liu, Yufan. “A Survey Of Persistent Graph Databases.” 2014. Masters Thesis, Kent State University. Accessed December 16, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1395166105.

MLA Handbook (7^{th} Edition):

Liu, Yufan. “A Survey Of Persistent Graph Databases.” 2014. Web. 16 Dec 2019.

Vancouver:

Liu Y. A Survey Of Persistent Graph Databases. [Internet] [Masters thesis]. Kent State University; 2014. [cited 2019 Dec 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1395166105.

Council of Science Editors:

Liu Y. A Survey Of Persistent Graph Databases. [Masters Thesis]. Kent State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1395166105

University of Technology, Sydney

10.
Pan, S.
Complex *graph* stream mining.

Degree: 2015, University of Technology, Sydney

URL: http://hdl.handle.net/10453/38989

► Recent years have witnessed a dramatic increase of information due to the ever development of modern technologies. The large scale of information makes data analysis,…
(more)

Subjects/Keywords: Data mining.; Knowledge discovery tasks.; Social networks.; Correlated Graph Stream Mining.; Graph Stream Classifications.; Complex Task Graph Classification.; CGStream algorithm.; gLSU algorithm.; CogBoost algorithm.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pan, S. (2015). Complex graph stream mining. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/38989

Not specified: Masters Thesis or Doctoral Dissertation

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

Pan, S. “Complex graph stream mining.” 2015. Thesis, University of Technology, Sydney. Accessed December 16, 2019. http://hdl.handle.net/10453/38989.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pan, S. “Complex graph stream mining.” 2015. Web. 16 Dec 2019.

Vancouver:

Pan S. Complex graph stream mining. [Internet] [Thesis]. University of Technology, Sydney; 2015. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10453/38989.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pan S. Complex graph stream mining. [Thesis]. University of Technology, Sydney; 2015. Available from: http://hdl.handle.net/10453/38989

Not specified: Masters Thesis or Doctoral Dissertation

11. Eto, Hiroshi. Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ.

Degree: 博士（情報工学）, 2017, Kyushu Institute of Technology / 九州工業大学

URL: http://hdl.handle.net/10228/5721

九州工業大学博士学位論文 学位記番号:情工博甲第308号 学位授与年月日:平成28年3月25日

1 Introduction|2 Preliminaries|3 Regular Induced Subgraphs|4 Distance d independent set|5 Conclusion

平成27年度

Subjects/Keywords: Graph algorithm; Inapproximability; Regular induced subgraph; Distance-d independent set; Graph class

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Eto, H. (2017). Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ. (Thesis). Kyushu Institute of Technology / 九州工業大学. Retrieved from http://hdl.handle.net/10228/5721

Not specified: Masters Thesis or Doctoral Dissertation

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

Eto, Hiroshi. “Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ.” 2017. Thesis, Kyushu Institute of Technology / 九州工業大学. Accessed December 16, 2019. http://hdl.handle.net/10228/5721.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Eto, Hiroshi. “Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ.” 2017. Web. 16 Dec 2019.

Vancouver:

Eto H. Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ. [Internet] [Thesis]. Kyushu Institute of Technology / 九州工業大学; 2017. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10228/5721.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Eto H. Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ. [Thesis]. Kyushu Institute of Technology / 九州工業大学; 2017. Available from: http://hdl.handle.net/10228/5721

Not specified: Masters Thesis or Doctoral Dissertation

University of Technology, Sydney

12.
Wu, Jia.
Multi-*graph* learning.

Degree: 2015, University of Technology, Sydney

URL: http://hdl.handle.net/10453/43409

► Multi-instance learning (MIL) is a special learning task where labels are only available for a bag of instances. Although MIL has been used for many…
(more)

Subjects/Keywords: Multi-instance learning (MIL).; MIL algorithms.; Multi-Graph Feature based Learning (gMGL) algorithm.; Multi-Graph-View bag Learning (MGVBL) algorithm.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, J. (2015). Multi-graph learning. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/43409

Not specified: Masters Thesis or Doctoral Dissertation

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

Wu, Jia. “Multi-graph learning.” 2015. Thesis, University of Technology, Sydney. Accessed December 16, 2019. http://hdl.handle.net/10453/43409.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wu, Jia. “Multi-graph learning.” 2015. Web. 16 Dec 2019.

Vancouver:

Wu J. Multi-graph learning. [Internet] [Thesis]. University of Technology, Sydney; 2015. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10453/43409.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu J. Multi-graph learning. [Thesis]. University of Technology, Sydney; 2015. Available from: http://hdl.handle.net/10453/43409

Not specified: Masters Thesis or Doctoral Dissertation

13.
Althoby, Haeder Younis Ghawi.
Theoritical and numerical studies on the *graph* partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe.

Degree: Docteur es, Mathematiques, 2017, Normandie

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

►

Étant donné G = (V, E) un graphe non orienté connexe et un entier positif β (n), où n est le nombrede sommets de G,… (more)

Subjects/Keywords: Partitionnement; Séparation et évaluation; Combinatorial optimization; Partitioning graph; Heuristics; Greedy algorithm; Branch and bound algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Althoby, H. Y. G. (2017). Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe. (Doctoral Dissertation). Normandie. Retrieved from http://www.theses.fr/2017NORMC233

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

Althoby, Haeder Younis Ghawi. “Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe.” 2017. Doctoral Dissertation, Normandie. Accessed December 16, 2019. http://www.theses.fr/2017NORMC233.

MLA Handbook (7^{th} Edition):

Althoby, Haeder Younis Ghawi. “Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe.” 2017. Web. 16 Dec 2019.

Vancouver:

Althoby HYG. Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe. [Internet] [Doctoral dissertation]. Normandie; 2017. [cited 2019 Dec 16]. Available from: http://www.theses.fr/2017NORMC233.

Council of Science Editors:

Althoby HYG. Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe. [Doctoral Dissertation]. Normandie; 2017. Available from: http://www.theses.fr/2017NORMC233

University of Newcastle

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

Degree: PhD, 2017, University of Newcastle

URL: http://hdl.handle.net/1959.13/1349840

►

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 Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Abu Zaher, Amer. “A new feature selection approach based on proximity graphs and evolutionary computation.” 2017. Web. 16 Dec 2019.

Vancouver:

Abu Zaher A. A new feature selection approach based on proximity graphs and evolutionary computation. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2019 Dec 16]. 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

Dalhousie University

15.
Cosgaya Lozano, Adan Jose.
Engineering Algorithms for Solving Geometric and *Graph*
Problems on Large Data Sets.

Degree: PhD, Faculty of Computer Science, 2011, Dalhousie University

URL: http://hdl.handle.net/10222/13324

► This thesis focuses on the engineering of algorithms for massive data sets. In recent years, massive data sets have become ubiquitous and existing computing applications,…
(more)

Subjects/Keywords: Algorithm Engineering; I/O-efficiency; Parallel skyline; Graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cosgaya Lozano, A. J. (2011). Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13324

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

Cosgaya Lozano, Adan Jose. “Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets.” 2011. Doctoral Dissertation, Dalhousie University. Accessed December 16, 2019. http://hdl.handle.net/10222/13324.

MLA Handbook (7^{th} Edition):

Cosgaya Lozano, Adan Jose. “Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets.” 2011. Web. 16 Dec 2019.

Vancouver:

Cosgaya Lozano AJ. Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets. [Internet] [Doctoral dissertation]. Dalhousie University; 2011. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10222/13324.

Council of Science Editors:

Cosgaya Lozano AJ. Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets. [Doctoral Dissertation]. Dalhousie University; 2011. Available from: http://hdl.handle.net/10222/13324

Texas A&M University

16. Huang, Bolun. Sentiment-based Classification of Tweeters and University Programs.

Degree: 2014, Texas A&M University

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

► The rapidly growing World WideWeb (WWW) is no longer a passive information provider. Nowadays, Internet users themselves have become contributors to the WWW. A lot…
(more)

Subjects/Keywords: Sentiment; Classification; Twitter; University Ranking; Algorithm; hiring graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, B. (2014). Sentiment-based Classification of Tweeters and University Programs. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153569

Not specified: Masters Thesis or Doctoral Dissertation

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

Huang, Bolun. “Sentiment-based Classification of Tweeters and University Programs.” 2014. Thesis, Texas A&M University. Accessed December 16, 2019. http://hdl.handle.net/1969.1/153569.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Bolun. “Sentiment-based Classification of Tweeters and University Programs.” 2014. Web. 16 Dec 2019.

Vancouver:

Huang B. Sentiment-based Classification of Tweeters and University Programs. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/1969.1/153569.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang B. Sentiment-based Classification of Tweeters and University Programs. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153569

Not specified: Masters Thesis or Doctoral Dissertation

Anna University

17. Chitra P. Application of heuristic and metaheuristics to the bi-objective task scheduling problem on heterogeneous distributed computing systems.

Degree: Information and Communication, 2011, Anna University

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

►

Heterogeneous distributed systems are widely deployed for executing computationally intensive parallel applications with diverse computing needs. The efficient execution of applications in such environments requires… (more)

Subjects/Keywords: Directed Acyclic Graph; Metaheuristics; Genetic algorithm; Makespan; Computing systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

P, C. (2011). Application of heuristic and metaheuristics to the bi-objective task scheduling problem on heterogeneous distributed computing systems. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9852

Not specified: Masters Thesis or Doctoral Dissertation

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

P, Chitra. “Application of heuristic and metaheuristics to the bi-objective task scheduling problem on heterogeneous distributed computing systems.” 2011. Thesis, Anna University. Accessed December 16, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/9852.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

P, Chitra. “Application of heuristic and metaheuristics to the bi-objective task scheduling problem on heterogeneous distributed computing systems.” 2011. Web. 16 Dec 2019.

Vancouver:

P C. Application of heuristic and metaheuristics to the bi-objective task scheduling problem on heterogeneous distributed computing systems. [Internet] [Thesis]. Anna University; 2011. [cited 2019 Dec 16]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9852.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

P C. Application of heuristic and metaheuristics to the bi-objective task scheduling problem on heterogeneous distributed computing systems. [Thesis]. Anna University; 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9852

Not specified: Masters Thesis or Doctoral Dissertation

Vilnius University

18. Devėnaitė, Vaiva. Genetinės paieškos strategijų tyrimas.

Degree: Master, 2009, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20081203_193031-18459 ;

►

Genetinių algoritmų panaudojimo galimybės ir paplitimas nuolat didėja. Daugelyje nagrinėtų mokslinių darbų, genetiniai algoritmai yra naudojami uždavinių optimizavimui. Optimizavimui naudojama daug skirtingų metodų. Sprendžiant konkretų… (more)

Subjects/Keywords: Genetiniai algoritmai; Mokymo strategijos; Grafai; Genetic algorithm; Learning strategies; Graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Devėnaitė, Vaiva. (2009). Genetinės paieškos strategijų tyrimas. (Masters Thesis). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20081203_193031-18459 ;

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

Author name may be incomplete

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

Devėnaitė, Vaiva. “Genetinės paieškos strategijų tyrimas.” 2009. Masters Thesis, Vilnius University. Accessed December 16, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20081203_193031-18459 ;.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Devėnaitė, Vaiva. “Genetinės paieškos strategijų tyrimas.” 2009. Web. 16 Dec 2019.

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

Author name may be incomplete

Vancouver:

Devėnaitė, Vaiva. Genetinės paieškos strategijų tyrimas. [Internet] [Masters thesis]. Vilnius University; 2009. [cited 2019 Dec 16]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20081203_193031-18459 ;.

Author name may be incomplete

Council of Science Editors:

Devėnaitė, Vaiva. Genetinės paieškos strategijų tyrimas. [Masters Thesis]. Vilnius University; 2009. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20081203_193031-18459 ;

Author name may be incomplete

NSYSU

19.
Chiu, Chiao-Wei.
A Fault-Tolerant Routing *Algorithm* with Probabilistic Safety Vectors on the (n, k)-star * Graph*.

Degree: Master, Computer Science and Engineering, 2008, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

► In this thesis, we focus on the design of the fault-tolerant routing *algorithm* for the (n, k)-star *graph*. We apply the idea of collecting the…
(more)

Subjects/Keywords: Fault-Tolerant Routing Algorithm; (n k)-star Graph; Probabilistic Safety Vector

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chiu, C. (2008). A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

Not specified: Masters Thesis or Doctoral Dissertation

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

Chiu, Chiao-Wei. “A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.” 2008. Thesis, NSYSU. Accessed December 16, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chiu, Chiao-Wei. “A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.” 2008. Web. 16 Dec 2019.

Vancouver:

Chiu C. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Dec 16]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiu C. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

20.
Chen, Shiuan-wen.
Algorithms for the Traffic Light Setting Problem on the *Graph* Model.

Degree: Master, Computer Science and Engineering, 2007, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809

► As the number of vehicles increases rapidly, traffic congestion has become a serious problem in a city. Over the past years, a considerable number of…
(more)

Subjects/Keywords: graph model; algorithm; traffic light

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, S. (2007). Algorithms for the Traffic Light Setting Problem on the Graph Model. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809

Not specified: Masters Thesis or Doctoral Dissertation

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

Chen, Shiuan-wen. “Algorithms for the Traffic Light Setting Problem on the Graph Model.” 2007. Thesis, NSYSU. Accessed December 16, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Shiuan-wen. “Algorithms for the Traffic Light Setting Problem on the Graph Model.” 2007. Web. 16 Dec 2019.

Vancouver:

Chen S. Algorithms for the Traffic Light Setting Problem on the Graph Model. [Internet] [Thesis]. NSYSU; 2007. [cited 2019 Dec 16]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen S. Algorithms for the Traffic Light Setting Problem on the Graph Model. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

21. Liao, Chih-lun. Efficiency Improvement for Collaborative Filtering Recommender System.

Degree: Master, Electrical Engineering, 2015, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151

► In collaborative ï¬ltering based recommender systems, products are regarded as features and users are required to provide rating scores to the products they have purchased.…
(more)

Subjects/Keywords: ranking algorithm; clustering; feature extraction; correlation graph; Recommender system

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liao, C. (2015). Efficiency Improvement for Collaborative Filtering Recommender System. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151

Not specified: Masters Thesis or Doctoral Dissertation

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

Liao, Chih-lun. “Efficiency Improvement for Collaborative Filtering Recommender System.” 2015. Thesis, NSYSU. Accessed December 16, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liao, Chih-lun. “Efficiency Improvement for Collaborative Filtering Recommender System.” 2015. Web. 16 Dec 2019.

Vancouver:

Liao C. Efficiency Improvement for Collaborative Filtering Recommender System. [Internet] [Thesis]. NSYSU; 2015. [cited 2019 Dec 16]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liao C. Efficiency Improvement for Collaborative Filtering Recommender System. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

22. Krishnan, Hari. Garbage Collection for General Graphs.

Degree: PhD, Computer Sciences, 2016, Louisiana State University

URL: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

► Garbage collection is moving from being a utility to a requirement of every modern programming language. With multi-core and distributed systems, most programs written recently…
(more)

Subjects/Keywords: reachability; graph; distributed algorithm; garbage collection; shared memory; concurrency

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krishnan, H. (2016). Garbage Collection for General Graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

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

Krishnan, Hari. “Garbage Collection for General Graphs.” 2016. Doctoral Dissertation, Louisiana State University. Accessed December 16, 2019. etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573.

MLA Handbook (7^{th} Edition):

Krishnan, Hari. “Garbage Collection for General Graphs.” 2016. Web. 16 Dec 2019.

Vancouver:

Krishnan H. Garbage Collection for General Graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2019 Dec 16]. Available from: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573.

Council of Science Editors:

Krishnan H. Garbage Collection for General Graphs. [Doctoral Dissertation]. Louisiana State University; 2016. Available from: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

23. Toole, Alex. Repetition-free vertex colorings of grid graphs .

Degree: 2014, California State University – San Marcos

URL: http://hdl.handle.net/10211.3/120343

► A repetition-free coloring of a *graph* is a coloring of its vertices such that there are no paths for which the color pattern on the…
(more)

Subjects/Keywords: vertex coloring; repetition-free; Thue chromatic number; grid graph; algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Toole, A. (2014). Repetition-free vertex colorings of grid graphs . (Thesis). California State University – San Marcos. Retrieved from http://hdl.handle.net/10211.3/120343

Not specified: Masters Thesis or Doctoral Dissertation

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

Toole, Alex. “Repetition-free vertex colorings of grid graphs .” 2014. Thesis, California State University – San Marcos. Accessed December 16, 2019. http://hdl.handle.net/10211.3/120343.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Toole, Alex. “Repetition-free vertex colorings of grid graphs .” 2014. Web. 16 Dec 2019.

Vancouver:

Toole A. Repetition-free vertex colorings of grid graphs . [Internet] [Thesis]. California State University – San Marcos; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10211.3/120343.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Toole A. Repetition-free vertex colorings of grid graphs . [Thesis]. California State University – San Marcos; 2014. Available from: http://hdl.handle.net/10211.3/120343

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

24. Santoso, Yudi. Triangle counting and listing in directed and undirected graphs using single machines.

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

URL: https://dspace.library.uvic.ca//handle/1828/9902

► Triangle enumeration is an important element in *graph* analysis, and because of this it is a topic that has been studied extensively. Although the formulation…
(more)

Subjects/Keywords: Graph computation; Large networks; Triangle enumeration; Single machine algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Santoso, Y. (2018). Triangle counting and listing in directed and undirected graphs using single machines. (Masters Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9902

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

Santoso, Yudi. “Triangle counting and listing in directed and undirected graphs using single machines.” 2018. Masters Thesis, University of Victoria. Accessed December 16, 2019. https://dspace.library.uvic.ca//handle/1828/9902.

MLA Handbook (7^{th} Edition):

Santoso, Yudi. “Triangle counting and listing in directed and undirected graphs using single machines.” 2018. Web. 16 Dec 2019.

Vancouver:

Santoso Y. Triangle counting and listing in directed and undirected graphs using single machines. [Internet] [Masters thesis]. University of Victoria; 2018. [cited 2019 Dec 16]. Available from: https://dspace.library.uvic.ca//handle/1828/9902.

Council of Science Editors:

Santoso Y. Triangle counting and listing in directed and undirected graphs using single machines. [Masters Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9902

Université Catholique de Louvain

25. Dewandeleer, Thomas. Facebook Love Connector.

Degree: 2015, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/thesis:2514

►

This work focuses on the study of graphs and more precisely, a *graph* comparison method. The context of this work was to try developing a…
(more)

Subjects/Keywords: graph; graphs; node; edge; matching; neighbour; algorithm; android; facebook; love; connector

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dewandeleer, T. (2015). Facebook Love Connector. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:2514

Not specified: Masters Thesis or Doctoral Dissertation

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

Dewandeleer, Thomas. “Facebook Love Connector.” 2015. Thesis, Université Catholique de Louvain. Accessed December 16, 2019. http://hdl.handle.net/2078.1/thesis:2514.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dewandeleer, Thomas. “Facebook Love Connector.” 2015. Web. 16 Dec 2019.

Vancouver:

Dewandeleer T. Facebook Love Connector. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2078.1/thesis:2514.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dewandeleer T. Facebook Love Connector. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/thesis:2514

Not specified: Masters Thesis or Doctoral Dissertation

26.
[No author].
PARALLEL ALGORITHMS FOR LARGE-SCALE *GRAPH* CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES
.

Degree: 2014, Washington State University

URL: http://hdl.handle.net/2376/5196

► *Graph* algorithms on parallel architectures present an interesting case study for irregular applications. We address one such irregular application – one of clustering real world…
(more)

Subjects/Keywords: Computer science; graph clustering; MapReduce algorithm; Shingling heuristic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2014). PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/5196

Not specified: Masters Thesis or Doctoral Dissertation

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

author], [No. “PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES .” 2014. Thesis, Washington State University. Accessed December 16, 2019. http://hdl.handle.net/2376/5196.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES .” 2014. Web. 16 Dec 2019.

Vancouver:

author] [. PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES . [Internet] [Thesis]. Washington State University; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2376/5196.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES . [Thesis]. Washington State University; 2014. Available from: http://hdl.handle.net/2376/5196

Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

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

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

URL: http://hdl.handle.net/2097/39115

► 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

Record Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Web. 16 Dec 2019.

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Dec 16]. 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

28.
Legay, Sylvain.
Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes : A Few Problems of *Algorithm* and Complexity in *Graph* Theory.

Degree: Docteur es, Mathématiques et Informatique, 2017, Paris Saclay

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

►

Le sujet de cette thèse est la théorie des graphes. Formellement, un graphe est un ensemble de sommets et un ensemble d’arêtes, c’est à dire… (more)

Subjects/Keywords: Graphe; Algorithme; Complexité; Coloriage; Graph; Algorithm; Complexity; Coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Legay, S. (2017). Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes : A Few Problems of Algorithm and Complexity in Graph Theory. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2017SACLS030

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

Legay, Sylvain. “Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes : A Few Problems of Algorithm and Complexity in Graph Theory.” 2017. Doctoral Dissertation, Paris Saclay. Accessed December 16, 2019. http://www.theses.fr/2017SACLS030.

MLA Handbook (7^{th} Edition):

Legay, Sylvain. “Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes : A Few Problems of Algorithm and Complexity in Graph Theory.” 2017. Web. 16 Dec 2019.

Vancouver:

Legay S. Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes : A Few Problems of Algorithm and Complexity in Graph Theory. [Internet] [Doctoral dissertation]. Paris Saclay; 2017. [cited 2019 Dec 16]. Available from: http://www.theses.fr/2017SACLS030.

Council of Science Editors:

Legay S. Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes : A Few Problems of Algorithm and Complexity in Graph Theory. [Doctoral Dissertation]. Paris Saclay; 2017. Available from: http://www.theses.fr/2017SACLS030

University of New South Wales

29. Yuan, Long. I/O efficient cohesive subgraph search in large graphs.

Degree: Computer Science & Engineering, 2017, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true

► Cohesive subgraph search has been recently studied for its large number of applications in social networks, web search, collaboration networks, and biology. Most existing approaches…
(more)

Subjects/Keywords: cohesive subgraph search; graph; I/O efficient algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yuan, L. (2017). I/O efficient cohesive subgraph search in large graphs. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true

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

Yuan, Long. “I/O efficient cohesive subgraph search in large graphs.” 2017. Doctoral Dissertation, University of New South Wales. Accessed December 16, 2019. http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Yuan, Long. “I/O efficient cohesive subgraph search in large graphs.” 2017. Web. 16 Dec 2019.

Vancouver:

Yuan L. I/O efficient cohesive subgraph search in large graphs. [Internet] [Doctoral dissertation]. University of New South Wales; 2017. [cited 2019 Dec 16]. Available from: http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true.

Council of Science Editors:

Yuan L. I/O efficient cohesive subgraph search in large graphs. [Doctoral Dissertation]. University of New South Wales; 2017. Available from: http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true

University of Guelph

30. Sala, Evan. Exploring the Greedy Constructions of de Bruijn Sequences .

Degree: 2018, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012

► A k-ary de Bruijn sequence of order n is a cyclic sequence of length k^n such that each k-ary string of length n appears exactly…
(more)

Subjects/Keywords: de Bruijn Sequence; de Bruijn Graph; Greedy Algorithm; Sequence Construction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sala, E. (2018). Exploring the Greedy Constructions of de Bruijn Sequences . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012

Not specified: Masters Thesis or Doctoral Dissertation

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

Sala, Evan. “Exploring the Greedy Constructions of de Bruijn Sequences .” 2018. Thesis, University of Guelph. Accessed December 16, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sala, Evan. “Exploring the Greedy Constructions of de Bruijn Sequences .” 2018. Web. 16 Dec 2019.

Vancouver:

Sala E. Exploring the Greedy Constructions of de Bruijn Sequences . [Internet] [Thesis]. University of Guelph; 2018. [cited 2019 Dec 16]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sala E. Exploring the Greedy Constructions of de Bruijn Sequences . [Thesis]. University of Guelph; 2018. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012

Not specified: Masters Thesis or Doctoral Dissertation