Advanced search options

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

You searched for `subject:(graph)`

.
Showing records 1 – 30 of
4490 total matches.

◁ [1] [2] [3] [4] [5] … [150] ▶

Search Limiters

Dates

- 2016 – 2020 (1690)
- 2011 – 2015 (1706)
- 2006 – 2010 (776)
- 2001 – 2005 (232)
- 1996 – 2000 (85)
- 1991 – 1995 (74)
- 1986 – 1990 (55)
- 1981 – 1985 (42)
- 1976 – 1980 (19)
- 1971 – 1975 (18)

Universities

- Brno University of Technology (258)
- University of Waterloo (150)
- Georgia Tech (109)
- ETH Zürich (99)
- University of Illinois – Urbana-Champaign (89)
- Delft University of Technology (74)
- The Ohio State University (68)
- University of Victoria (67)
- Simon Fraser University (60)
- Virginia Tech (58)
- National University of Singapore (57)
- East Tennessee State University (48)
- Iowa State University (47)
- Texas A&M University (46)
- KTH (45)

Department

- Computer Science (257)
- Mathematics (244)
- Informatique (236)
- Mathematical Sciences (80)
- Electrical and Computer Engineering (72)
- Computer Science and Engineering (61)
- Electrical Engineering (43)
- Applied Mathematics (34)
- Department of Computer Science (31)
- Mathématiques (26)
- Department of Mathematics (24)
- Mechanical Engineering (24)
- Engineering (21)
- Mathematics and Statistics (21)
- Computer Science & Engineering (16)

Degrees

- PhD (967)
- Docteur es (455)
- MS (449)
- Master (45)
- Mestrado (22)
- MA (20)
- MAin Mathematics (15)

Levels

- doctoral (1755)
- masters (734)
- thesis (93)
- doctor of philosophy ph.d. (25)

Languages

Country

- US (1690)
- Canada (511)
- France (455)
- Czech Republic (258)
- Sweden (151)
- Australia (143)
- Netherlands (141)
- UK (138)
- Brazil (122)
- India (111)
- Switzerland (99)
- Greece (90)
- South Africa (78)
- Singapore (59)
- Hong Kong (51)

▼ Search Limiters

University of Johannesburg

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

Degree: PhD, 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/6158

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Waterloo

2. Sullivan, Matthew. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.

Degree: 2016, University of Waterloo

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

► A *graph* G is said to be L-colourable if for a given list assignment L = {L(v)|v ∈ V (G)} there is a proper colouring…
(more)

Subjects/Keywords: Graph Theory; Graph Colouring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sullivan, M. (2016). Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10859

Not specified: Masters Thesis or Doctoral Dissertation

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

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Thesis, University of Waterloo. Accessed July 10, 2020. http://hdl.handle.net/10012/10859.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Web. 10 Jul 2020.

Vancouver:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10012/10859.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10859

Not specified: Masters Thesis or Doctoral Dissertation

Vanderbilt University

3. Solava, Ryan William. On the fine structure of graphs avoiding certain complete bipartite minors.

Degree: PhD, Mathematics, 2019, Vanderbilt University

URL: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

► Avoiding complete bipartite graphs as minors, and in particular K_{2,t} as a minor, has been used to give sufficient conditions for Hamiltonicity. For this reason…
(more)

Subjects/Keywords: Graph theory; Graph minors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Solava, R. W. (2019). On the fine structure of graphs avoiding certain complete bipartite minors. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

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

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed July 10, 2020. http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

MLA Handbook (7^{th} Edition):

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Web. 10 Jul 2020.

Vancouver:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2020 Jul 10]. Available from: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

Council of Science Editors:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Doctoral Dissertation]. Vanderbilt University; 2019. Available from: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

4.
Xiao, Dongqing.
Towards *Graph* Analytic and Privacy Protection.

Degree: PhD, 2017, Worcester Polytechnic Institute

URL: etd-050317-134652 ; https://digitalcommons.wpi.edu/etd-dissertations/545

► In many prevalent application domains, such as business to business network, social networks, and sensor networks, graphs serve as a powerful model to capture the…
(more)

Subjects/Keywords: Graph Analytic; Graph Privacy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xiao, D. (2017). Towards Graph Analytic and Privacy Protection. (Doctoral Dissertation). Worcester Polytechnic Institute. Retrieved from etd-050317-134652 ; https://digitalcommons.wpi.edu/etd-dissertations/545

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

Xiao, Dongqing. “Towards Graph Analytic and Privacy Protection.” 2017. Doctoral Dissertation, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-050317-134652 ; https://digitalcommons.wpi.edu/etd-dissertations/545.

MLA Handbook (7^{th} Edition):

Xiao, Dongqing. “Towards Graph Analytic and Privacy Protection.” 2017. Web. 10 Jul 2020.

Vancouver:

Xiao D. Towards Graph Analytic and Privacy Protection. [Internet] [Doctoral dissertation]. Worcester Polytechnic Institute; 2017. [cited 2020 Jul 10]. Available from: etd-050317-134652 ; https://digitalcommons.wpi.edu/etd-dissertations/545.

Council of Science Editors:

Xiao D. Towards Graph Analytic and Privacy Protection. [Doctoral Dissertation]. Worcester Polytechnic Institute; 2017. Available from: etd-050317-134652 ; https://digitalcommons.wpi.edu/etd-dissertations/545

University of Georgia

5. Muskovin, Jennifer Anne. On (0,2)-graphs and semibiplanes.

Degree: MA, Mathematics, 2009, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/muskovin_jennifer_a_200905_ma

► A semibiplane is a connected point-block incidence structure such that any two points are in either 0 or 2 common blocks and any two blocks…
(more)

Subjects/Keywords: (0; 2)-graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Muskovin, J. A. (2009). On (0,2)-graphs and semibiplanes. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/muskovin_jennifer_a_200905_ma

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

Muskovin, Jennifer Anne. “On (0,2)-graphs and semibiplanes.” 2009. Masters Thesis, University of Georgia. Accessed July 10, 2020. http://purl.galileo.usg.edu/uga_etd/muskovin_jennifer_a_200905_ma.

MLA Handbook (7^{th} Edition):

Muskovin, Jennifer Anne. “On (0,2)-graphs and semibiplanes.” 2009. Web. 10 Jul 2020.

Vancouver:

Muskovin JA. On (0,2)-graphs and semibiplanes. [Internet] [Masters thesis]. University of Georgia; 2009. [cited 2020 Jul 10]. Available from: http://purl.galileo.usg.edu/uga_etd/muskovin_jennifer_a_200905_ma.

Council of Science Editors:

Muskovin JA. On (0,2)-graphs and semibiplanes. [Masters Thesis]. University of Georgia; 2009. Available from: http://purl.galileo.usg.edu/uga_etd/muskovin_jennifer_a_200905_ma

University of Georgia

6.
Venkatesh, Sumana.
Subgraph pattern matching for *graph* databases.

Degree: MS, Computer Science, 2014, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/venkatesh_sumana_201412_ms

► With the rapid increase of data in social and biological networks, ranging from a few dozen terabytes to many petabytes, managing the data with traditional…
(more)

Subjects/Keywords: Graph Database

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Venkatesh, S. (2014). Subgraph pattern matching for graph databases. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/venkatesh_sumana_201412_ms

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

Venkatesh, Sumana. “Subgraph pattern matching for graph databases.” 2014. Masters Thesis, University of Georgia. Accessed July 10, 2020. http://purl.galileo.usg.edu/uga_etd/venkatesh_sumana_201412_ms.

MLA Handbook (7^{th} Edition):

Venkatesh, Sumana. “Subgraph pattern matching for graph databases.” 2014. Web. 10 Jul 2020.

Vancouver:

Venkatesh S. Subgraph pattern matching for graph databases. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2020 Jul 10]. Available from: http://purl.galileo.usg.edu/uga_etd/venkatesh_sumana_201412_ms.

Council of Science Editors:

Venkatesh S. Subgraph pattern matching for graph databases. [Masters Thesis]. University of Georgia; 2014. Available from: http://purl.galileo.usg.edu/uga_etd/venkatesh_sumana_201412_ms

Louisiana State University

7. D'souza, Kimberly Sevin. Excluding a Weakly 4-connected Minor.

Degree: PhD, Applied Mathematics, 2016, Louisiana State University

URL: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

► A 3-connected *graph* G is called weakly 4-connected if min (|E(G_{1})|, |E(G_{2})|) ≤ 4 holds for all 3-separations (G_{1},G_{2}) of G. A 3-connected *graph* G…
(more)

Subjects/Keywords: graph theory; graph minors; graph decomposition; Pyramid graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

D'souza, K. S. (2016). Excluding a Weakly 4-connected Minor. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

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

D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Doctoral Dissertation, Louisiana State University. Accessed July 10, 2020. etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.

MLA Handbook (7^{th} Edition):

D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Web. 10 Jul 2020.

Vancouver:

D'souza KS. Excluding a Weakly 4-connected Minor. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2020 Jul 10]. Available from: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.

Council of Science Editors:

D'souza KS. Excluding a Weakly 4-connected Minor. [Doctoral Dissertation]. Louisiana State University; 2016. Available from: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

8. Souza, Renato Ferreira de. Resolução de problemas via teoria de grafos.

Degree: Mestrado, Mestrado Profissional em Matemática em Rede Nacional, 2015, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;

►

O objetivo deste trabalho é introduzir a noção de grafos familiarizando os alunos com um conceito pouco estudado no ensino fundamental e médio. Para isso,… (more)

Subjects/Keywords: Grafos; Graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Souza, R. F. d. (2015). Resolução de problemas via teoria de grafos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;

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

Souza, Renato Ferreira de. “Resolução de problemas via teoria de grafos.” 2015. Masters Thesis, University of São Paulo. Accessed July 10, 2020. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;.

MLA Handbook (7^{th} Edition):

Souza, Renato Ferreira de. “Resolução de problemas via teoria de grafos.” 2015. Web. 10 Jul 2020.

Vancouver:

Souza RFd. Resolução de problemas via teoria de grafos. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2020 Jul 10]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;.

Council of Science Editors:

Souza RFd. Resolução de problemas via teoria de grafos. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;

University of Johannesburg

9.
Immelman, Yolande.
On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a * graph*.

Degree: 2009, University of Johannesburg

URL: http://hdl.handle.net/10210/2359

►

M.Sc.

In this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a *graph* G is a…
(more)

Subjects/Keywords: Graph coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Immelman, Y. (2009). On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/2359

Not specified: Masters Thesis or Doctoral Dissertation

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

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Thesis, University of Johannesburg. Accessed July 10, 2020. http://hdl.handle.net/10210/2359.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Web. 10 Jul 2020.

Vancouver:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Internet] [Thesis]. University of Johannesburg; 2009. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10210/2359.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Thesis]. University of Johannesburg; 2009. Available from: http://hdl.handle.net/10210/2359

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

10. Xia, Xiangzhou. Efficient and Scalable Listing of Four-Vertex Subgraph.

Degree: MS, Computer Science, 2016, Texas A&M University

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

► Identifying four-vertex subgraphs has long been recognized as a fundamental technique in bioinformatics and social networks. However, listing these structures is a challenging task, especially…
(more)

Subjects/Keywords: graph; motif

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xia, X. (2016). Efficient and Scalable Listing of Four-Vertex Subgraph. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/174219

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

Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Masters Thesis, Texas A&M University. Accessed July 10, 2020. http://hdl.handle.net/1969.1/174219.

MLA Handbook (7^{th} Edition):

Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Web. 10 Jul 2020.

Vancouver:

Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1969.1/174219.

Council of Science Editors:

Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/174219

Wake Forest University

11.
Barnett, Joel Andrew.
Generalizations and Variations on *Graph* Pebbling.

Degree: 2014, Wake Forest University

URL: http://hdl.handle.net/10339/39310

► *Graph* pebbling involves determining the minimum number of pebbles needed so that regardless of the initial arrangement of pebbles on a *graph*, a pebble can…
(more)

Subjects/Keywords: graph pebbling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Barnett, J. A. (2014). Generalizations and Variations on Graph Pebbling. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/39310

Not specified: Masters Thesis or Doctoral Dissertation

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

Barnett, Joel Andrew. “Generalizations and Variations on Graph Pebbling.” 2014. Thesis, Wake Forest University. Accessed July 10, 2020. http://hdl.handle.net/10339/39310.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Barnett, Joel Andrew. “Generalizations and Variations on Graph Pebbling.” 2014. Web. 10 Jul 2020.

Vancouver:

Barnett JA. Generalizations and Variations on Graph Pebbling. [Internet] [Thesis]. Wake Forest University; 2014. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10339/39310.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Barnett JA. Generalizations and Variations on Graph Pebbling. [Thesis]. Wake Forest University; 2014. Available from: http://hdl.handle.net/10339/39310

Not specified: Masters Thesis or Doctoral Dissertation

University of New South Wales

12.
Shang, Haichuan.
Efficient algorithms for *graph* substructure search.

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

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

► Many recent applications strongly demand efficient and effective management of *graph* structured data such as paths, trees, and general graphs. These applications include Bioinformatics, Chemistry,…
(more)

Subjects/Keywords: Graph database

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shang, H. (2011). Efficient algorithms for graph substructure search. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true

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

Shang, Haichuan. “Efficient algorithms for graph substructure search.” 2011. Doctoral Dissertation, University of New South Wales. Accessed July 10, 2020. http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Shang, Haichuan. “Efficient algorithms for graph substructure search.” 2011. Web. 10 Jul 2020.

Vancouver:

Shang H. Efficient algorithms for graph substructure search. [Internet] [Doctoral dissertation]. University of New South Wales; 2011. [cited 2020 Jul 10]. Available from: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true.

Council of Science Editors:

Shang H. Efficient algorithms for graph substructure search. [Doctoral Dissertation]. University of New South Wales; 2011. Available from: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true

University of Newcastle

13.
Wijaya, Rachel Wulan Nirmalasari.
Advances in *graph* labelings.

Degree: MPhil, 2018, University of Newcastle

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

►

Masters Research - Master of Philosophy (MPhil)

A *graph* labeling is a mapping that assigns natural numbers to vertices and/or edges of a *graph*. In…
(more)

Subjects/Keywords: graph labelings

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wijaya, R. W. N. (2018). Advances in graph labelings. (Masters Thesis). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1384118

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

Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Masters Thesis, University of Newcastle. Accessed July 10, 2020. http://hdl.handle.net/1959.13/1384118.

MLA Handbook (7^{th} Edition):

Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Web. 10 Jul 2020.

Vancouver:

Wijaya RWN. Advances in graph labelings. [Internet] [Masters thesis]. University of Newcastle; 2018. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1959.13/1384118.

Council of Science Editors:

Wijaya RWN. Advances in graph labelings. [Masters Thesis]. University of Newcastle; 2018. Available from: http://hdl.handle.net/1959.13/1384118

Rochester Institute of Technology

14. Culak, Juraj. Separators in High-Genus Near-Planar Graphs.

Degree: MS, Computer Science (GCCIS), 2016, Rochester Institute of Technology

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

► *Graph* separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. Results have shown the existence of separators in…
(more)

Subjects/Keywords: Graph separators

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Culak, J. (2016). Separators in High-Genus Near-Planar Graphs. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9427

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

Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed July 10, 2020. https://scholarworks.rit.edu/theses/9427.

MLA Handbook (7^{th} Edition):

Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Web. 10 Jul 2020.

Vancouver:

Culak J. Separators in High-Genus Near-Planar Graphs. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2020 Jul 10]. Available from: https://scholarworks.rit.edu/theses/9427.

Council of Science Editors:

Culak J. Separators in High-Genus Near-Planar Graphs. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/9427

University of Victoria

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

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

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

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

Subjects/Keywords: graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Waterloo

16.
Clancy, Ryan.
dstlr: Scalable Knowledge *Graph* Construction from Text Collections.

Degree: 2020, University of Waterloo

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

► In recent years, the amount of data being generated for consumption by enterprises has increased exponentially. Enterprises typically work with structured data, but oftentimes the…
(more)

Subjects/Keywords: knowledge graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Clancy, R. (2020). dstlr: Scalable Knowledge Graph Construction from Text Collections. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15739

Not specified: Masters Thesis or Doctoral Dissertation

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

Clancy, Ryan. “dstlr: Scalable Knowledge Graph Construction from Text Collections.” 2020. Thesis, University of Waterloo. Accessed July 10, 2020. http://hdl.handle.net/10012/15739.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Clancy, Ryan. “dstlr: Scalable Knowledge Graph Construction from Text Collections.” 2020. Web. 10 Jul 2020.

Vancouver:

Clancy R. dstlr: Scalable Knowledge Graph Construction from Text Collections. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10012/15739.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Clancy R. dstlr: Scalable Knowledge Graph Construction from Text Collections. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15739

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

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

Degree: 2020, University of Waterloo

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

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

Subjects/Keywords: Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

Western Michigan University

18. Alhulwah, Khawlah Hamad. Structures of Derived Graphs.

Degree: PhD, Mathematics, 2017, Western Michigan University

URL: https://scholarworks.wmich.edu/dissertations/3204

► One of the most familiar derived graphs are line graphs. The line *graph* L(G) of a *graph* G is the *graph* whose vertices are…
(more)

Subjects/Keywords: Line graph; Peterson graph; complete graph; graph; derived graphs; 3-line graph; Applied Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alhulwah, K. H. (2017). Structures of Derived Graphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3204

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

Alhulwah, Khawlah Hamad. “Structures of Derived Graphs.” 2017. Doctoral Dissertation, Western Michigan University. Accessed July 10, 2020. https://scholarworks.wmich.edu/dissertations/3204.

MLA Handbook (7^{th} Edition):

Alhulwah, Khawlah Hamad. “Structures of Derived Graphs.” 2017. Web. 10 Jul 2020.

Vancouver:

Alhulwah KH. Structures of Derived Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2017. [cited 2020 Jul 10]. Available from: https://scholarworks.wmich.edu/dissertations/3204.

Council of Science Editors:

Alhulwah KH. Structures of Derived Graphs. [Doctoral Dissertation]. Western Michigan University; 2017. Available from: https://scholarworks.wmich.edu/dissertations/3204

Penn State University

19.
Viswanath, Archana.
Enhanced force directed *graph* embedding algorithms.

Degree: MS, Computer Science and Engineering, 2008, Penn State University

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

► *Graph* embedding is a pictorial representation of a *graph* G(V;E) on a surface, where V is the set of vertices and E is the set…
(more)

Subjects/Keywords: graph embedding; graph drawing; force directed method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Viswanath, A. (2008). Enhanced force directed graph embedding algorithms. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8793

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

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Masters Thesis, Penn State University. Accessed July 10, 2020. https://etda.libraries.psu.edu/catalog/8793.

MLA Handbook (7^{th} Edition):

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Web. 10 Jul 2020.

Vancouver:

Viswanath A. Enhanced force directed graph embedding algorithms. [Internet] [Masters thesis]. Penn State University; 2008. [cited 2020 Jul 10]. Available from: https://etda.libraries.psu.edu/catalog/8793.

Council of Science Editors:

Viswanath A. Enhanced force directed graph embedding algorithms. [Masters Thesis]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8793

Ryerson University

20. Patel, Sonal. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.

Degree: 2010, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

► In this thesis we address three main problems in clique detection in the area of *Graph* Theory. i) Most of current methods for clique detection…
(more)

Subjects/Keywords: Random graphs; Graph theory; Algorithms; Graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Patel, S. (2010). Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

Not specified: Masters Thesis or Doctoral Dissertation

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

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed July 10, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 10 Jul 2020.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Jul 10]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

21. Fallon, Joshua E. Two Results in Drawing Graphs on Surfaces.

Degree: PhD, Discrete Mathematics and Combinatorics, 2018, Louisiana State University

URL: https://digitalcommons.lsu.edu/gradschool_dissertations/4611

► In this work we present results on crossing-critical graphs drawn on non-planar surfaces and results on edge-hamiltonicity of graphs on the Klein bottle. We…
(more)

Subjects/Keywords: graph theory; combinatorics; topological graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fallon, J. E. (2018). Two Results in Drawing Graphs on Surfaces. (Doctoral Dissertation). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_dissertations/4611

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

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Doctoral Dissertation, Louisiana State University. Accessed July 10, 2020. https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

MLA Handbook (7^{th} Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Web. 10 Jul 2020.

Vancouver:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Internet] [Doctoral dissertation]. Louisiana State University; 2018. [cited 2020 Jul 10]. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

Council of Science Editors:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Doctoral Dissertation]. Louisiana State University; 2018. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4611

University of Newcastle

22. Weaver, Natasha. A family of higher-rank graphs arising from subshifts.

Degree: PhD, 2009, University of Newcastle

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

►

Research Doctorate - Doctor of Philosophy (PhD)

There is a strong connection between directed graphs and the shifts of finite type which are an important… (more)

Subjects/Keywords: operator algebras; graph algebras; higher-rank graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Weaver, N. (2009). A family of higher-rank graphs arising from subshifts. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/38511

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

Weaver, Natasha. “A family of higher-rank graphs arising from subshifts.” 2009. Doctoral Dissertation, University of Newcastle. Accessed July 10, 2020. http://hdl.handle.net/1959.13/38511.

MLA Handbook (7^{th} Edition):

Weaver, Natasha. “A family of higher-rank graphs arising from subshifts.” 2009. Web. 10 Jul 2020.

Vancouver:

Weaver N. A family of higher-rank graphs arising from subshifts. [Internet] [Doctoral dissertation]. University of Newcastle; 2009. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1959.13/38511.

Council of Science Editors:

Weaver N. A family of higher-rank graphs arising from subshifts. [Doctoral Dissertation]. University of Newcastle; 2009. Available from: http://hdl.handle.net/1959.13/38511

University of Newcastle

23.
Tanna, Dushyant.
* Graph* labeling techniques.

Degree: PhD, 2017, University of Newcastle

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

►

Research Doctorate - Doctor of Philosophy (PhD)

We give some background to the labeling schemes like graceful, harmonious, magic, antimagic and irregular total labelings. Followed… (more)

Subjects/Keywords: graph theory; vertices; graph labeling; combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tanna, D. (2017). Graph labeling techniques. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1354312

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

Tanna, Dushyant. “Graph labeling techniques.” 2017. Doctoral Dissertation, University of Newcastle. Accessed July 10, 2020. http://hdl.handle.net/1959.13/1354312.

MLA Handbook (7^{th} Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 10 Jul 2020.

Vancouver:

Tanna D. Graph labeling techniques. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1959.13/1354312.

Council of Science Editors:

Tanna D. Graph labeling techniques. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1354312

Oklahoma State University

24. Konduri, Shyamprasad. Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs.

Degree: Mechanical & Aerospace Engineering, 2012, Oklahoma State University

URL: http://hdl.handle.net/11244/9970

► A considerable amount of research has been conducted on coordination control of vehicle formations in the last few decades due to its possible applications in…
(more)

Subjects/Keywords: coordination; directed graph; ring graph; vehicle platoon

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Konduri, S. (2012). Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/9970

Not specified: Masters Thesis or Doctoral Dissertation

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

Konduri, Shyamprasad. “Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs.” 2012. Thesis, Oklahoma State University. Accessed July 10, 2020. http://hdl.handle.net/11244/9970.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Konduri, Shyamprasad. “Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs.” 2012. Web. 10 Jul 2020.

Vancouver:

Konduri S. Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs. [Internet] [Thesis]. Oklahoma State University; 2012. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/11244/9970.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Konduri S. Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs. [Thesis]. Oklahoma State University; 2012. Available from: http://hdl.handle.net/11244/9970

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

25. Derka, Martin. Restricted String Representations.

Degree: 2017, University of Waterloo

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

► A string representation of a *graph* assigns to every vertex a curve in the plane so that two curves intersect if and only if the…
(more)

Subjects/Keywords: string representation; B2-VPG graph; string graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Derka, M. (2017). Restricted String Representations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12253

Not specified: Masters Thesis or Doctoral Dissertation

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

Derka, Martin. “Restricted String Representations.” 2017. Thesis, University of Waterloo. Accessed July 10, 2020. http://hdl.handle.net/10012/12253.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Derka, Martin. “Restricted String Representations.” 2017. Web. 10 Jul 2020.

Vancouver:

Derka M. Restricted String Representations. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10012/12253.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Derka M. Restricted String Representations. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12253

Not specified: Masters Thesis or Doctoral Dissertation

26. Zhan, Hanmeng. Discrete Quantum Walks on Graphs and Digraphs.

Degree: 2018, University of Waterloo

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

► This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph X…
(more)

Subjects/Keywords: algebraic graph theory; quantum walks; graph embeddings

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhan, H. (2018). Discrete Quantum Walks on Graphs and Digraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13952

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Thesis, University of Waterloo. Accessed July 10, 2020. http://hdl.handle.net/10012/13952.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Web. 10 Jul 2020.

Vancouver:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10012/13952.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13952

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

27. Gordon, Taylor. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.

Degree: 2010, University of Waterloo

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

► We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an…
(more)

Subjects/Keywords: Graph Drawing; Simultaneous Embeddings; Graph Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gordon, T. (2010). Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5174

Not specified: Masters Thesis or Doctoral Dissertation

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

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Thesis, University of Waterloo. Accessed July 10, 2020. http://hdl.handle.net/10012/5174.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Web. 10 Jul 2020.

Vancouver:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10012/5174.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5174

Not specified: Masters Thesis or Doctoral Dissertation

Indiana University

28.
Firoz, Jesun Sahariar.
Synchronization-avoiding *graph* algorithms and runtime aspects
.

Degree: 2018, Indiana University

URL: http://hdl.handle.net/2022/22605

► Massively parallel computers provide unprecedented computing power that is only expected to grow. General-purpose Asynchronous Many-Task (AMT) runtimes exposes significant fine-grained parallelism. However, traditional Bulk-Synchronous…
(more)

Subjects/Keywords: Distributed Graph Algorithms; Distributed Runtimes; Graph Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Firoz, J. S. (2018). Synchronization-avoiding graph algorithms and runtime aspects . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/22605

Not specified: Masters Thesis or Doctoral Dissertation

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

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Thesis, Indiana University. Accessed July 10, 2020. http://hdl.handle.net/2022/22605.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Web. 10 Jul 2020.

Vancouver:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/2022/22605.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Thesis]. Indiana University; 2018. Available from: http://hdl.handle.net/2022/22605

Not specified: Masters Thesis or Doctoral Dissertation

Australian National University

29. Hou, Yun. Control of Formations with Non-rigid and Hybrid Graphs .

Degree: 2016, Australian National University

URL: http://hdl.handle.net/1885/110870

► This thesis studies the problem of control of multi-agent formations, of which the interaction architectures can be modeled by undirected and directed graphs or a…
(more)

Subjects/Keywords: formation control; graph rigidity; hybrid graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hou, Y. (2016). Control of Formations with Non-rigid and Hybrid Graphs . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/110870

Not specified: Masters Thesis or Doctoral Dissertation

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

Hou, Yun. “Control of Formations with Non-rigid and Hybrid Graphs .” 2016. Thesis, Australian National University. Accessed July 10, 2020. http://hdl.handle.net/1885/110870.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hou, Yun. “Control of Formations with Non-rigid and Hybrid Graphs .” 2016. Web. 10 Jul 2020.

Vancouver:

Hou Y. Control of Formations with Non-rigid and Hybrid Graphs . [Internet] [Thesis]. Australian National University; 2016. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1885/110870.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hou Y. Control of Formations with Non-rigid and Hybrid Graphs . [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/110870

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

30.
Penders, A. (author).
Accelerating *Graph* Analysis with Heterogeneous Systems.

Degree: Software and Computer Technology, 2012, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94

►

Data analysis is a rising field of interest for computer science research due to the growing amount of information that is digitally available. This increase… (more)

Subjects/Keywords: GPU; graph; Graph analysis; accelerators; OpenCL; parallel

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Penders, A. (. (2012). Accelerating Graph Analysis with Heterogeneous Systems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94

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

Penders, A (author). “Accelerating Graph Analysis with Heterogeneous Systems.” 2012. Masters Thesis, Delft University of Technology. Accessed July 10, 2020. http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.

MLA Handbook (7^{th} Edition):

Penders, A (author). “Accelerating Graph Analysis with Heterogeneous Systems.” 2012. Web. 10 Jul 2020.

Vancouver:

Penders A(. Accelerating Graph Analysis with Heterogeneous Systems. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2020 Jul 10]. Available from: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.

Council of Science Editors:

Penders A(. Accelerating Graph Analysis with Heterogeneous Systems. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94