Advanced search options

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

You searched for `subject:(graph)`

.
Showing records 1 – 30 of
4050 total matches.

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

Search Limiters

Dates

- 2015 – 2019 (1507)
- 2010 – 2014 (1584)
- 2005 – 2009 (714)
- 2000 – 2004 (198)
- 1995 – 1999 (68)
- 1990 – 1994 (66)
- 1985 – 1989 (53)
- 1980 – 1984 (27)
- 1975 – 1979 (20)
- 1970 – 1974 (21)

Universities

- Brno University of Technology (211)
- University of Waterloo (139)
- Georgia Tech (100)
- ETH Zürich (97)
- University of Illinois – Urbana-Champaign (77)
- The Ohio State University (62)
- Simon Fraser University (60)
- University of Victoria (57)
- Virginia Tech (53)
- National University of Singapore (50)
- East Tennessee State University (47)
- Indian Institute of Science (43)
- University of São Paulo (41)
- University of Texas – Austin (40)
- Iowa State University (39)

Department

- Computer Science (213)
- Informatique (204)
- Mathematics (203)
- Electrical and Computer Engineering (80)
- Mathematical Sciences (75)
- Computer Science and Engineering (58)
- Electrical Engineering (38)
- Applied Mathematics (34)
- Mechanical Engineering (28)
- Department of Computer Science (26)
- Mathématiques (23)
- Mathematics and Statistics (21)
- Department of Mathematics (19)
- Computer Sciences (16)
- 0112 (15)

Degrees

- PhD (809)
- MS (397)
- Docteur es (394)
- Master (45)
- Mestrado (22)
- MA (20)
- MAin Mathematics (11)
- M. Phil. (10)

Levels

- doctoral (1505)
- masters (634)
- thesis (79)
- doctor of philosophy ph.d. (23)

Languages

Country

- US (1513)
- Canada (466)
- France (394)
- Czech Republic (211)
- Switzerland (127)
- Australia (123)
- Brazil (118)
- Sweden (118)
- UK (112)
- India (110)
- Netherlands (94)
- Greece (85)
- South Africa (76)
- Spain (74)
- Singapore (52)

▼ Search Limiters

Mississippi State University

1.
Zhang, Fangyan.
Large-scale *graph* visual analytics.

Degree: PhD, Computer Science and Engineering, 2017, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;

► Large-scale *graph* analysis and visualization is becoming a more challenging task, due to the increasing amount of *graph* data. This dissertation focuses on methods…
(more)

Subjects/Keywords: large-scale graph; graph sampling; graph property; graph visualization; graph clustering; graph hierarchy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, F. (2017). Large-scale graph visual analytics. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;

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

Zhang, Fangyan. “Large-scale graph visual analytics.” 2017. Doctoral Dissertation, Mississippi State University. Accessed June 19, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;.

MLA Handbook (7^{th} Edition):

Zhang, Fangyan. “Large-scale graph visual analytics.” 2017. Web. 19 Jun 2019.

Vancouver:

Zhang F. Large-scale graph visual analytics. [Internet] [Doctoral dissertation]. Mississippi State University; 2017. [cited 2019 Jun 19]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;.

Council of Science Editors:

Zhang F. Large-scale graph visual analytics. [Doctoral Dissertation]. Mississippi State University; 2017. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;

Princeton University

2. Gauthier, Gregory Joseph. The structure of graphs with no cycles of length 0 (mod 3) .

Degree: PhD, 2017, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp010r9676355

► We examine the structure of graphs that have no cycles of length 0 (mod 3). We show that, if G is a simple 2-connected *graph*…
(more)

Subjects/Keywords: graph; structural graph theory; swamp

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gauthier, G. J. (2017). The structure of graphs with no cycles of length 0 (mod 3) . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp010r9676355

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

Gauthier, Gregory Joseph. “The structure of graphs with no cycles of length 0 (mod 3) .” 2017. Doctoral Dissertation, Princeton University. Accessed June 19, 2019. http://arks.princeton.edu/ark:/88435/dsp010r9676355.

MLA Handbook (7^{th} Edition):

Gauthier, Gregory Joseph. “The structure of graphs with no cycles of length 0 (mod 3) .” 2017. Web. 19 Jun 2019.

Vancouver:

Gauthier GJ. The structure of graphs with no cycles of length 0 (mod 3) . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 Jun 19]. Available from: http://arks.princeton.edu/ark:/88435/dsp010r9676355.

Council of Science Editors:

Gauthier GJ. The structure of graphs with no cycles of length 0 (mod 3) . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp010r9676355

University of Waterloo

3. 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

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

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

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

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. 19 Jun 2019.

Vancouver:

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

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

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

University of Johannesburg

4.
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 June 19, 2019. http://hdl.handle.net/10210/6158.

MLA Handbook (7^{th} Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Web. 19 Jun 2019.

Vancouver:

Desormeaux WJ. Total domination in graphs and graph modifications. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2019 Jun 19]. 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 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Muskovin JA. On (0,2)-graphs and semibiplanes. [Internet] [Masters thesis]. University of Georgia; 2009. [cited 2019 Jun 19]. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Venkatesh S. Subgraph pattern matching for graph databases. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2019 Jun 19]. 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

7. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Souza RFd. Resolução de problemas via teoria de grafos. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2019 Jun 19]. 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/ ;

Louisiana State University

8. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

D'souza KS. Excluding a Weakly 4-connected Minor. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2019 Jun 19]. 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

University of Victoria

9.
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 June 19, 2019. 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. 19 Jun 2019.

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 2019 Jun 19]. 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

Princeton University

10. Sandon, Colin Peter. Community Detection in the Stochastic Block Model: fundamental limits .

Degree: PhD, 2017, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp011v53k058n

► In recent years, there have been many developments in the study of the stochastic block model, starting with a paper by Decelle et al. in…
(more)

Subjects/Keywords: clustering; graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sandon, C. P. (2017). Community Detection in the Stochastic Block Model: fundamental limits . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp011v53k058n

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

Sandon, Colin Peter. “Community Detection in the Stochastic Block Model: fundamental limits .” 2017. Doctoral Dissertation, Princeton University. Accessed June 19, 2019. http://arks.princeton.edu/ark:/88435/dsp011v53k058n.

MLA Handbook (7^{th} Edition):

Sandon, Colin Peter. “Community Detection in the Stochastic Block Model: fundamental limits .” 2017. Web. 19 Jun 2019.

Vancouver:

Sandon CP. Community Detection in the Stochastic Block Model: fundamental limits . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 Jun 19]. Available from: http://arks.princeton.edu/ark:/88435/dsp011v53k058n.

Council of Science Editors:

Sandon CP. Community Detection in the Stochastic Block Model: fundamental limits . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp011v53k058n

Texas A&M University

11. 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 June 19, 2019. http://hdl.handle.net/1969.1/174219.

MLA Handbook (7^{th} Edition):

Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Web. 19 Jun 2019.

Vancouver:

Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2019 Jun 19]. 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

12.
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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Barnett JA. Generalizations and Variations on Graph Pebbling. [Internet] [Thesis]. Wake Forest University; 2014. [cited 2019 Jun 19]. 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 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 June 19, 2019. http://hdl.handle.net/1959.13/1384118.

MLA Handbook (7^{th} Edition):

Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Web. 19 Jun 2019.

Vancouver:

Wijaya RWN. Advances in graph labelings. [Internet] [Masters thesis]. University of Newcastle; 2018. [cited 2019 Jun 19]. 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

University of Johannesburg

14.
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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Internet] [Thesis]. University of Johannesburg; 2009. [cited 2019 Jun 19]. 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

Rochester Institute of Technology

15. 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 June 19, 2019. https://scholarworks.rit.edu/theses/9427.

MLA Handbook (7^{th} Edition):

Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Web. 19 Jun 2019.

Vancouver:

Culak J. Separators in High-Genus Near-Planar Graphs. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2019 Jun 19]. 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 New South Wales

16.
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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Shang H. Efficient algorithms for graph substructure search. [Internet] [Doctoral dissertation]. University of New South Wales; 2011. [cited 2019 Jun 19]. 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 Waterloo

17. Arroyo Guevara, Alan Marcelo. On Geometric Drawings of Graphs.

Degree: 2018, University of Waterloo

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

► This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing…
(more)

Subjects/Keywords: combinatorics; crossing numbers; graph theory; graph; drawing; complete graph; rectilinear; graph embedding; graph drawing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arroyo Guevara, A. M. (2018). On Geometric Drawings of Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13103

Not specified: Masters Thesis or Doctoral Dissertation

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

Arroyo Guevara, Alan Marcelo. “On Geometric Drawings of Graphs.” 2018. Thesis, University of Waterloo. Accessed June 19, 2019. http://hdl.handle.net/10012/13103.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Arroyo Guevara, Alan Marcelo. “On Geometric Drawings of Graphs.” 2018. Web. 19 Jun 2019.

Vancouver:

Arroyo Guevara AM. On Geometric Drawings of Graphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10012/13103.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arroyo Guevara AM. On Geometric Drawings of Graphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13103

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

18. 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 June 19, 2019. https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

MLA Handbook (7^{th} Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Web. 19 Jun 2019.

Vancouver:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Internet] [Doctoral dissertation]. Louisiana State University; 2018. [cited 2019 Jun 19]. 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

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 June 19, 2019. https://etda.libraries.psu.edu/catalog/8793.

MLA Handbook (7^{th} Edition):

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Web. 19 Jun 2019.

Vancouver:

Viswanath A. Enhanced force directed graph embedding algorithms. [Internet] [Masters thesis]. Penn State University; 2008. [cited 2019 Jun 19]. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2019 Jun 19]. 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

Indiana University

21.
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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2019 Jun 19]. 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

University of Victoria

22. Manzer, Joshua Daniel Adrian. Chronological rectangle digraphs.

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

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

► Interval graphs admit elegant ordering and structural characterizations. A natural digraph analogue of interval graphs, called chronological interval digraphs, has recently been identified and studied.…
(more)

Subjects/Keywords: Mathematics; Combinatorics; Graph Theory; Structural Graph Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Manzer, J. D. A. (2015). Chronological rectangle digraphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6989

Not specified: Masters Thesis or Doctoral Dissertation

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

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Thesis, University of Victoria. Accessed June 19, 2019. http://hdl.handle.net/1828/6989.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Web. 19 Jun 2019.

Vancouver:

Manzer JDA. Chronological rectangle digraphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/1828/6989.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Manzer JDA. Chronological rectangle digraphs. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6989

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

23. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 19]. 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

University of Waterloo

24. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Derka M. Restricted String Representations. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jun 19]. 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

University of Waterloo

25. Zhang, Yan. Efficient Structure-aware OLAP Query Processing over Large Property Graphs.

Degree: 2017, University of Waterloo

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

► Property *graph* model is a semantically rich model for real-world applications that represent their data as graphs, e.g., communication networks, social networks, financial transaction networks.…
(more)

Subjects/Keywords: OLAP; Graph Database; Property Graph; Materialized View

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, Y. (2017). Efficient Structure-aware OLAP Query Processing over Large Property Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12724

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Yan. “Efficient Structure-aware OLAP Query Processing over Large Property Graphs.” 2017. Thesis, University of Waterloo. Accessed June 19, 2019. http://hdl.handle.net/10012/12724.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Yan. “Efficient Structure-aware OLAP Query Processing over Large Property Graphs.” 2017. Web. 19 Jun 2019.

Vancouver:

Zhang Y. Efficient Structure-aware OLAP Query Processing over Large Property Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10012/12724.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang Y. Efficient Structure-aware OLAP Query Processing over Large Property Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12724

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

26.
Penders, A.
Accelerating *Graph* Analysis with Heterogeneous Systems:.

Degree: 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. “Accelerating Graph Analysis with Heterogeneous Systems:.” 2012. Masters Thesis, Delft University of Technology. Accessed June 19, 2019. http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.

MLA Handbook (7^{th} Edition):

Penders, A. “Accelerating Graph Analysis with Heterogeneous Systems:.” 2012. Web. 19 Jun 2019.

Vancouver:

Penders A. Accelerating Graph Analysis with Heterogeneous Systems:. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2019 Jun 19]. 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

University of Melbourne

27. Rotheram, Ricky. Cores of vertex-transitive graphs.

Degree: 2013, University of Melbourne

URL: http://hdl.handle.net/11343/39734

► The core of a *graph* Γ is the smallest *graph* Γ^\ast for which there exist *graph* homomorphisms Γ → Γ^\ast and Γ^\ast → Γ. Thus cores are fundamental to…
(more)

Subjects/Keywords: repository; mathematics; graph theory; algebraic graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rotheram, R. (2013). Cores of vertex-transitive graphs. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/39734

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

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Masters Thesis, University of Melbourne. Accessed June 19, 2019. http://hdl.handle.net/11343/39734.

MLA Handbook (7^{th} Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Web. 19 Jun 2019.

Vancouver:

Rotheram R. Cores of vertex-transitive graphs. [Internet] [Masters thesis]. University of Melbourne; 2013. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/11343/39734.

Council of Science Editors:

Rotheram R. Cores of vertex-transitive graphs. [Masters Thesis]. University of Melbourne; 2013. Available from: http://hdl.handle.net/11343/39734

Oklahoma State University

28. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Konduri S. Coordination of Multiple Autonomous Vehicles with Directed Communication Graphs. [Internet] [Thesis]. Oklahoma State University; 2012. [cited 2019 Jun 19]. 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

29. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 19]. 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 Newcastle

30. 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 June 19, 2019. 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. 19 Jun 2019.

Vancouver:

Weaver N. A family of higher-rank graphs arising from subshifts. [Internet] [Doctoral dissertation]. University of Newcastle; 2009. [cited 2019 Jun 19]. 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