Advanced search options

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

You searched for `subject:(Graph algorithms)`

.
Showing records 1 – 30 of
442 total matches.

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

Search Limiters

Dates

- 2015 – 2019 (136)
- 2010 – 2014 (179)
- 2005 – 2009 (84)
- 2000 – 2004 (38)
- 1995 – 1999 (18)
- 1990 – 1994 (12)

Universities

- ETH Zürich (36)
- Georgia Tech (24)
- Brno University of Technology (20)
- University of Florida (16)
- University of Waterloo (15)
- University of Victoria (11)
- Indian Institute of Science (10)

Department

- Computer Science (38)
- Informatique (23)
- Electrical and Computer Engineering (13)

Degrees

- PhD (92)
- MS (36)
- Docteur es (31)

Languages

- English (285)
- Czech (20)
- Greek (16)
- French (13)
- Portuguese (11)

Country

- US (166)
- Canada (66)
- Switzerland (39)
- France (31)
- Greece (22)
- Czech Republic (20)
- Australia (12)
- Hong Kong (12)
- India (11)
- Brazil (10)

▼ Search Limiters

Ryerson University

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

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

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

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

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

Vancouver:

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

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

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

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

Vancouver:

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

3.
Boyer, John M.
Simplified O(n) *algorithms* for planar *graph* embedding, Kuratowski subgraph isolation, and related problems.

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

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

► A *graph* is planar if it can be drawn on the plane with vertices at unique locations and no edge intersections. Due to the wealth…
(more)

Subjects/Keywords: Graph theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boyer, J. M. (2018). Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9918

Not specified: Masters Thesis or Doctoral Dissertation

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

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Thesis, University of Victoria. Accessed June 24, 2019. https://dspace.library.uvic.ca//handle/1828/9918.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Web. 24 Jun 2019.

Vancouver:

Boyer JM. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Jun 24]. Available from: https://dspace.library.uvic.ca//handle/1828/9918.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Boyer JM. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9918

Not specified: Masters Thesis or Doctoral Dissertation

Colorado State University

4. Chaturvedi, Mmanu. Parametric classification of directed acyclic graphs, A.

Degree: MS(M.S.), Computer Science, 2017, Colorado State University

URL: http://hdl.handle.net/10217/183921

► We consider four NP-hard optimization problems on directed acyclic graphs (DAGs), namely, max clique, min coloring, max independent set and min clique cover. It is…
(more)

Subjects/Keywords: Graph Theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chaturvedi, M. (2017). Parametric classification of directed acyclic graphs, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/183921

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

Chaturvedi, Mmanu. “Parametric classification of directed acyclic graphs, A.” 2017. Masters Thesis, Colorado State University. Accessed June 24, 2019. http://hdl.handle.net/10217/183921.

MLA Handbook (7^{th} Edition):

Chaturvedi, Mmanu. “Parametric classification of directed acyclic graphs, A.” 2017. Web. 24 Jun 2019.

Vancouver:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Internet] [Masters thesis]. Colorado State University; 2017. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10217/183921.

Council of Science Editors:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Masters Thesis]. Colorado State University; 2017. Available from: http://hdl.handle.net/10217/183921

University of Hong Kong

5. Fang, Yixiang. Effective and efficient community search over large attributed graphs.

Degree: PhD, 2017, University of Hong Kong

URL: http://hdl.handle.net/10722/250721

► Communities, which are prevalent in attributed graphs such as social networks and knowledge bases, can be used in emerging applications such as product advertisement and…
(more)

Subjects/Keywords: Data mining; Graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fang, Y. (2017). Effective and efficient community search over large attributed graphs. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/250721

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

Fang, Yixiang. “Effective and efficient community search over large attributed graphs.” 2017. Doctoral Dissertation, University of Hong Kong. Accessed June 24, 2019. http://hdl.handle.net/10722/250721.

MLA Handbook (7^{th} Edition):

Fang, Yixiang. “Effective and efficient community search over large attributed graphs.” 2017. Web. 24 Jun 2019.

Vancouver:

Fang Y. Effective and efficient community search over large attributed graphs. [Internet] [Doctoral dissertation]. University of Hong Kong; 2017. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10722/250721.

Council of Science Editors:

Fang Y. Effective and efficient community search over large attributed graphs. [Doctoral Dissertation]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/250721

University of Hong Kong

6. Yuan, Wenjun. Flexgraph: flexible subgraph search in large graphs.

Degree: M. Phil., 2010, University of Hong Kong

URL: Yuan, W. [袁文俊]. (2010). Flexgraph : flexible subgraph search in large graphs. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4608753 ; http://dx.doi.org/10.5353/th_b4608753 ; http://hdl.handle.net/10722/134820

published_or_final_version

Computer Science

Master

Master of Philosophy

Subjects/Keywords: Graph algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yuan, W. (2010). Flexgraph: flexible subgraph search in large graphs. (Masters Thesis). University of Hong Kong. Retrieved from Yuan, W. [袁文俊]. (2010). Flexgraph : flexible subgraph search in large graphs. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4608753 ; http://dx.doi.org/10.5353/th_b4608753 ; http://hdl.handle.net/10722/134820

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

Yuan, Wenjun. “Flexgraph: flexible subgraph search in large graphs.” 2010. Masters Thesis, University of Hong Kong. Accessed June 24, 2019. Yuan, W. [袁文俊]. (2010). Flexgraph : flexible subgraph search in large graphs. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4608753 ; http://dx.doi.org/10.5353/th_b4608753 ; http://hdl.handle.net/10722/134820.

MLA Handbook (7^{th} Edition):

Yuan, Wenjun. “Flexgraph: flexible subgraph search in large graphs.” 2010. Web. 24 Jun 2019.

Vancouver:

Yuan W. Flexgraph: flexible subgraph search in large graphs. [Internet] [Masters thesis]. University of Hong Kong; 2010. [cited 2019 Jun 24]. Available from: Yuan, W. [袁文俊]. (2010). Flexgraph : flexible subgraph search in large graphs. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4608753 ; http://dx.doi.org/10.5353/th_b4608753 ; http://hdl.handle.net/10722/134820.

Council of Science Editors:

Yuan W. Flexgraph: flexible subgraph search in large graphs. [Masters Thesis]. University of Hong Kong; 2010. Available from: Yuan, W. [袁文俊]. (2010). Flexgraph : flexible subgraph search in large graphs. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4608753 ; http://dx.doi.org/10.5353/th_b4608753 ; http://hdl.handle.net/10722/134820

Hong Kong University of Science and Technology

7.
Wang, Yong CSE.
Towards better perception of *graph* visualization.

Degree: 2018, Hong Kong University of Science and Technology

URL: https://doi.org/10.14711/thesis-991012636368503412 ; http://repository.ust.hk/ir/bitstream/1783.1-95785/1/th_redirect.html

► *Graph* data is ubiquitous in lots of application areas such as social media, biological networks, financial transactions and software engineering. To help users understand and…
(more)

Subjects/Keywords: Graph algorithms; Visualization; Graphic methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Y. C. (2018). Towards better perception of graph visualization. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-991012636368503412 ; http://repository.ust.hk/ir/bitstream/1783.1-95785/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Wang, Yong CSE. “Towards better perception of graph visualization.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed June 24, 2019. https://doi.org/10.14711/thesis-991012636368503412 ; http://repository.ust.hk/ir/bitstream/1783.1-95785/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Yong CSE. “Towards better perception of graph visualization.” 2018. Web. 24 Jun 2019.

Vancouver:

Wang YC. Towards better perception of graph visualization. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2019 Jun 24]. Available from: https://doi.org/10.14711/thesis-991012636368503412 ; http://repository.ust.hk/ir/bitstream/1783.1-95785/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang YC. Towards better perception of graph visualization. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: https://doi.org/10.14711/thesis-991012636368503412 ; http://repository.ust.hk/ir/bitstream/1783.1-95785/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

8.
Subramanya, Vijay.
* Graph* Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable.

Degree: 2016, University of Waterloo

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

► *Graph* editing problems have a long history and have been widely studied, with applications in biochemistry and complex network analysis. They generally ask whether an…
(more)

Subjects/Keywords: Graph editing; Parameterized algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Subramanya, V. (2016). Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11026

Not specified: Masters Thesis or Doctoral Dissertation

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

Subramanya, Vijay. “Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable.” 2016. Thesis, University of Waterloo. Accessed June 24, 2019. http://hdl.handle.net/10012/11026.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Subramanya, Vijay. “Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable.” 2016. Web. 24 Jun 2019.

Vancouver:

Subramanya V. Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10012/11026.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Subramanya V. Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/11026

Not specified: Masters Thesis or Doctoral Dissertation

University of Houston

9.
Cabrera, Wellington 1969-.
OPTIMIZED *ALGORITHMS* FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS.

Degree: Computer Science, Department of, 2017, University of Houston

URL: http://hdl.handle.net/10657/1854

► Large data sets are generally stored on disk following an organization as rows, columns or arrays, with row storage being the most common. On the…
(more)

Subjects/Keywords: algorithms graph summarization matrix model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cabrera, W. 1. (2017). OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS. (Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1854

Not specified: Masters Thesis or Doctoral Dissertation

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

Cabrera, Wellington 1969-. “OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS.” 2017. Thesis, University of Houston. Accessed June 24, 2019. http://hdl.handle.net/10657/1854.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cabrera, Wellington 1969-. “OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS.” 2017. Web. 24 Jun 2019.

Vancouver:

Cabrera W1. OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS. [Internet] [Thesis]. University of Houston; 2017. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10657/1854.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cabrera W1. OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS. [Thesis]. University of Houston; 2017. Available from: http://hdl.handle.net/10657/1854

Not specified: Masters Thesis or Doctoral Dissertation

Brock University

10.
Li, Yifeng.
Properties and *algorithms* of the (n, k)-arrangement graphs
.

Degree: Department of Computer Science, 2010, Brock University

URL: http://hdl.handle.net/10464/2950

► The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement *graph* is a class of generalized star graphs. Compared with the…
(more)

Subjects/Keywords: Topological graph theory.; Computer algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Y. (2010). Properties and algorithms of the (n, k)-arrangement graphs . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2950

Not specified: Masters Thesis or Doctoral Dissertation

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

Li, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Thesis, Brock University. Accessed June 24, 2019. http://hdl.handle.net/10464/2950.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Web. 24 Jun 2019.

Vancouver:

Li Y. Properties and algorithms of the (n, k)-arrangement graphs . [Internet] [Thesis]. Brock University; 2010. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10464/2950.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Y. Properties and algorithms of the (n, k)-arrangement graphs . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/2950

Not specified: Masters Thesis or Doctoral Dissertation

University of Limerick

11.
Ghassemi Toosi, Farshad.
Novel heurisitic approaches to iterative *graph* drawing.

Degree: 2017, University of Limerick

URL: http://hdl.handle.net/10344/6554

► This thesis presents a new *graph* drawing approach (the concentric approach) for drawing any undirected *graph* without taking stress or forces into account, in order…
(more)

Subjects/Keywords: graph drawing; algorithms; matrix

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghassemi Toosi, F. (2017). Novel heurisitic approaches to iterative graph drawing. (Thesis). University of Limerick. Retrieved from http://hdl.handle.net/10344/6554

Not specified: Masters Thesis or Doctoral Dissertation

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

Ghassemi Toosi, Farshad. “Novel heurisitic approaches to iterative graph drawing.” 2017. Thesis, University of Limerick. Accessed June 24, 2019. http://hdl.handle.net/10344/6554.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ghassemi Toosi, Farshad. “Novel heurisitic approaches to iterative graph drawing.” 2017. Web. 24 Jun 2019.

Vancouver:

Ghassemi Toosi F. Novel heurisitic approaches to iterative graph drawing. [Internet] [Thesis]. University of Limerick; 2017. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10344/6554.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghassemi Toosi F. Novel heurisitic approaches to iterative graph drawing. [Thesis]. University of Limerick; 2017. Available from: http://hdl.handle.net/10344/6554

Not specified: Masters Thesis or Doctoral Dissertation

Vanderbilt University

12. Linn, Joseph Garrett. Path-Precedence Orders in Trees.

Degree: PhD, Computer Science, 2013, Vanderbilt University

URL: http://etd.library.vanderbilt.edu//available/etd-05032013-125427/ ;

► This dissertation studies classes of partial orders defined by the precedence of paths in trees, using two different notions of precedence. Strict precedence uses the…
(more)

Subjects/Keywords: partial orders; graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Linn, J. G. (2013). Path-Precedence Orders in Trees. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu//available/etd-05032013-125427/ ;

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

Linn, Joseph Garrett. “Path-Precedence Orders in Trees.” 2013. Doctoral Dissertation, Vanderbilt University. Accessed June 24, 2019. http://etd.library.vanderbilt.edu//available/etd-05032013-125427/ ;.

MLA Handbook (7^{th} Edition):

Linn, Joseph Garrett. “Path-Precedence Orders in Trees.” 2013. Web. 24 Jun 2019.

Vancouver:

Linn JG. Path-Precedence Orders in Trees. [Internet] [Doctoral dissertation]. Vanderbilt University; 2013. [cited 2019 Jun 24]. Available from: http://etd.library.vanderbilt.edu//available/etd-05032013-125427/ ;.

Council of Science Editors:

Linn JG. Path-Precedence Orders in Trees. [Doctoral Dissertation]. Vanderbilt University; 2013. Available from: http://etd.library.vanderbilt.edu//available/etd-05032013-125427/ ;

Texas A&M University

13.
Pearce, Roger Allan.
Scalable Parallel *Algorithms* for Massive Scale-free Graphs.

Degree: 2013, Texas A&M University

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

► Efficiently storing and processing massive *graph* data sets is a challenging problem as researchers seek to leverage ?Big Data? to answer next-generation scientific questions. New…
(more)

Subjects/Keywords: parallel algorithms; graph algorithms; scale-free graphs; graph partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151937

Not specified: Masters Thesis or Doctoral Dissertation

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

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Thesis, Texas A&M University. Accessed June 24, 2019. http://hdl.handle.net/1969.1/151937.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 24 Jun 2019.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1969.1/151937.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151937

Not specified: Masters Thesis or Doctoral Dissertation

14. Zhao, Xiaohan. Analyzing and Processing Big Real Graphs.

Degree: 2014, University of California – eScholarship, University of California

URL: http://www.escholarship.org/uc/item/0896j24v

► As fundamental abstractions of network structures, graphs are everywhere, ranging from biological protein interaction networks and Internet routing networks, to emerging online social networks. Studying…
(more)

Subjects/Keywords: Computer science; Approximation Algorithms; Dynamic Graph Models; Graph; Graph Analysis; Privacy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhao, X. (2014). Analyzing and Processing Big Real Graphs. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/0896j24v

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhao, Xiaohan. “Analyzing and Processing Big Real Graphs.” 2014. Thesis, University of California – eScholarship, University of California. Accessed June 24, 2019. http://www.escholarship.org/uc/item/0896j24v.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhao, Xiaohan. “Analyzing and Processing Big Real Graphs.” 2014. Web. 24 Jun 2019.

Vancouver:

Zhao X. Analyzing and Processing Big Real Graphs. [Internet] [Thesis]. University of California – eScholarship, University of California; 2014. [cited 2019 Jun 24]. Available from: http://www.escholarship.org/uc/item/0896j24v.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhao X. Analyzing and Processing Big Real Graphs. [Thesis]. University of California – eScholarship, University of California; 2014. Available from: http://www.escholarship.org/uc/item/0896j24v

Not specified: Masters Thesis or Doctoral Dissertation

University of Manitoba

15. Mondal, Debajyoti. Visualizing graphs: optimization and trade-offs.

Degree: Computer Science, 2014, University of Manitoba

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

► Effective visualization of graphs is a powerful tool to help understand the relationships among the *graph*'s underlying objects and to interact with them. Several styles…
(more)

Subjects/Keywords: Graph Drawing; Algorithms; Planar Graph; Graph Thickness; Complete Graph; Polyline Drawing; Trade-offs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mondal, D. (2014). Visualizing graphs: optimization and trade-offs. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31673

Not specified: Masters Thesis or Doctoral Dissertation

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

Mondal, Debajyoti. “Visualizing graphs: optimization and trade-offs.” 2014. Thesis, University of Manitoba. Accessed June 24, 2019. http://hdl.handle.net/1993/31673.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mondal, Debajyoti. “Visualizing graphs: optimization and trade-offs.” 2014. Web. 24 Jun 2019.

Vancouver:

Mondal D. Visualizing graphs: optimization and trade-offs. [Internet] [Thesis]. University of Manitoba; 2014. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1993/31673.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mondal D. Visualizing graphs: optimization and trade-offs. [Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/31673

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

16.
Korula, Nitish J.
Approximation *Algorithms* for Network Design and Orienteering.

Degree: PhD, 0112, 2010, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/16731

► This thesis presents approximation *algorithms* for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under…
(more)

Subjects/Keywords: Algorithms; Approximation algorithms; Network design; Graph algorithms; Connectivity; Orienteering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Korula, N. J. (2010). Approximation Algorithms for Network Design and Orienteering. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16731

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

Korula, Nitish J. “Approximation Algorithms for Network Design and Orienteering.” 2010. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed June 24, 2019. http://hdl.handle.net/2142/16731.

MLA Handbook (7^{th} Edition):

Korula, Nitish J. “Approximation Algorithms for Network Design and Orienteering.” 2010. Web. 24 Jun 2019.

Vancouver:

Korula NJ. Approximation Algorithms for Network Design and Orienteering. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/2142/16731.

Council of Science Editors:

Korula NJ. Approximation Algorithms for Network Design and Orienteering. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16731

University of Western Australia

17.
Douglas, Brendan.
Quantum and classical *algorithms* for *graph* classification and search problems.

Degree: PhD, 2011, University of Western Australia

URL: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01

►

[Truncated abstract] This thesis is split into three parts, each addressing the overarching theme of applying *graph* theoretic techniques to classi cation and search problems.…
(more)

Subjects/Keywords: Quantum algorithms; Graph isomorphism; Quantum walks; Adinkras

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Douglas, B. (2011). Quantum and classical algorithms for graph classification and search problems. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01

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

Douglas, Brendan. “Quantum and classical algorithms for graph classification and search problems.” 2011. Doctoral Dissertation, University of Western Australia. Accessed June 24, 2019. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01.

MLA Handbook (7^{th} Edition):

Douglas, Brendan. “Quantum and classical algorithms for graph classification and search problems.” 2011. Web. 24 Jun 2019.

Vancouver:

Douglas B. Quantum and classical algorithms for graph classification and search problems. [Internet] [Doctoral dissertation]. University of Western Australia; 2011. [cited 2019 Jun 24]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01.

Council of Science Editors:

Douglas B. Quantum and classical algorithms for graph classification and search problems. [Doctoral Dissertation]. University of Western Australia; 2011. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=30840&local_base=GEN01-INS01

Georgia Tech

18.
Sanders, Daniel Preston.
Linear *algorithms* for graphs of tree-width at most four.

Degree: PhD, Algorithms, Combinatorics, and Optimization, 1993, Georgia Tech

URL: http://hdl.handle.net/1853/30061

Subjects/Keywords: Graph theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sanders, D. P. (1993). Linear algorithms for graphs of tree-width at most four. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/30061

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

Sanders, Daniel Preston. “Linear algorithms for graphs of tree-width at most four.” 1993. Doctoral Dissertation, Georgia Tech. Accessed June 24, 2019. http://hdl.handle.net/1853/30061.

MLA Handbook (7^{th} Edition):

Sanders, Daniel Preston. “Linear algorithms for graphs of tree-width at most four.” 1993. Web. 24 Jun 2019.

Vancouver:

Sanders DP. Linear algorithms for graphs of tree-width at most four. [Internet] [Doctoral dissertation]. Georgia Tech; 1993. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1853/30061.

Council of Science Editors:

Sanders DP. Linear algorithms for graphs of tree-width at most four. [Doctoral Dissertation]. Georgia Tech; 1993. Available from: http://hdl.handle.net/1853/30061

Hong Kong University of Science and Technology

19. Liu, Lian. Finding shortest gentle paths.

Degree: 2010, Hong Kong University of Science and Technology

URL: https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/1/th_redirect.html

► Finding shortest paths is a fundamental operator in spatial databases, which has a wide range of applications to both academia and industry. Although shortest path…
(more)

Subjects/Keywords: Paths and cycles (Graph theory); Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, L. (2010). Finding shortest gentle paths. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, Lian. “Finding shortest gentle paths.” 2010. Thesis, Hong Kong University of Science and Technology. Accessed June 24, 2019. https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Lian. “Finding shortest gentle paths.” 2010. Web. 24 Jun 2019.

Vancouver:

Liu L. Finding shortest gentle paths. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2010. [cited 2019 Jun 24]. Available from: https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu L. Finding shortest gentle paths. [Thesis]. Hong Kong University of Science and Technology; 2010. Available from: https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

20. Zhang, Wangda. Evaluating multi-way joins over discounted hitting time.

Degree: M. Phil., 2013, University of Hong Kong

URL: Zhang, W. [张望达]. (2013). Evaluating multi-way joins over discounted hitting time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177353 ; http://dx.doi.org/10.5353/th_b5177353 ; http://hdl.handle.net/10722/196484

►

The prevalence of graphs in emerging applications has recently raised a lot of research interests. To acquire interesting information hidden in large graphs, tasks including… (more)

Subjects/Keywords: Query languages (Computer science); Graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, W. (2013). Evaluating multi-way joins over discounted hitting time. (Masters Thesis). University of Hong Kong. Retrieved from Zhang, W. [张望达]. (2013). Evaluating multi-way joins over discounted hitting time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177353 ; http://dx.doi.org/10.5353/th_b5177353 ; http://hdl.handle.net/10722/196484

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

Zhang, Wangda. “Evaluating multi-way joins over discounted hitting time.” 2013. Masters Thesis, University of Hong Kong. Accessed June 24, 2019. Zhang, W. [张望达]. (2013). Evaluating multi-way joins over discounted hitting time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177353 ; http://dx.doi.org/10.5353/th_b5177353 ; http://hdl.handle.net/10722/196484.

MLA Handbook (7^{th} Edition):

Zhang, Wangda. “Evaluating multi-way joins over discounted hitting time.” 2013. Web. 24 Jun 2019.

Vancouver:

Zhang W. Evaluating multi-way joins over discounted hitting time. [Internet] [Masters thesis]. University of Hong Kong; 2013. [cited 2019 Jun 24]. Available from: Zhang, W. [张望达]. (2013). Evaluating multi-way joins over discounted hitting time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177353 ; http://dx.doi.org/10.5353/th_b5177353 ; http://hdl.handle.net/10722/196484.

Council of Science Editors:

Zhang W. Evaluating multi-way joins over discounted hitting time. [Masters Thesis]. University of Hong Kong; 2013. Available from: Zhang, W. [张望达]. (2013). Evaluating multi-way joins over discounted hitting time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5177353 ; http://dx.doi.org/10.5353/th_b5177353 ; http://hdl.handle.net/10722/196484

Montana State University

21. Li, Zhongyuan. An efficient implementation of a planarity testing and maximal planar subgraph algorithm.

Degree: College of Engineering, 1996, Montana State University

URL: https://scholarworks.montana.edu/xmlui/handle/1/7520

Subjects/Keywords: Graph theory.; Algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Z. (1996). An efficient implementation of a planarity testing and maximal planar subgraph algorithm. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/7520

Not specified: Masters Thesis or Doctoral Dissertation

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

Li, Zhongyuan. “An efficient implementation of a planarity testing and maximal planar subgraph algorithm.” 1996. Thesis, Montana State University. Accessed June 24, 2019. https://scholarworks.montana.edu/xmlui/handle/1/7520.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Zhongyuan. “An efficient implementation of a planarity testing and maximal planar subgraph algorithm.” 1996. Web. 24 Jun 2019.

Vancouver:

Li Z. An efficient implementation of a planarity testing and maximal planar subgraph algorithm. [Internet] [Thesis]. Montana State University; 1996. [cited 2019 Jun 24]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/7520.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Z. An efficient implementation of a planarity testing and maximal planar subgraph algorithm. [Thesis]. Montana State University; 1996. Available from: https://scholarworks.montana.edu/xmlui/handle/1/7520

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

22. Dinneen, Michael John. Bounded combinatorial width and forbidden substructures.

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

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

Subjects/Keywords: Graph theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dinneen, M. J. (2015). Bounded combinatorial width and forbidden substructures. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6330

Not specified: Masters Thesis or Doctoral Dissertation

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

Dinneen, Michael John. “Bounded combinatorial width and forbidden substructures.” 2015. Thesis, University of Victoria. Accessed June 24, 2019. http://hdl.handle.net/1828/6330.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dinneen, Michael John. “Bounded combinatorial width and forbidden substructures.” 2015. Web. 24 Jun 2019.

Vancouver:

Dinneen MJ. Bounded combinatorial width and forbidden substructures. [Internet] [Thesis]. University of Victoria; 2015. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1828/6330.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dinneen MJ. Bounded combinatorial width and forbidden substructures. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6330

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

23. Markov, Minko Marinov. A fast practical algorithm for the vertex separation of unicyclic graphs.

Degree: Dept. of Computer Science, 2008, University of Victoria

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

► The vertex separation of a *graph* is the minimum vertex separation of a linear layout of that *graph* over all its linear layouts. A linear…
(more)

Subjects/Keywords: Graph theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Markov, M. M. (2008). A fast practical algorithm for the vertex separation of unicyclic graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/612

Not specified: Masters Thesis or Doctoral Dissertation

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

Markov, Minko Marinov. “A fast practical algorithm for the vertex separation of unicyclic graphs.” 2008. Thesis, University of Victoria. Accessed June 24, 2019. http://hdl.handle.net/1828/612.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Markov, Minko Marinov. “A fast practical algorithm for the vertex separation of unicyclic graphs.” 2008. Web. 24 Jun 2019.

Vancouver:

Markov MM. A fast practical algorithm for the vertex separation of unicyclic graphs. [Internet] [Thesis]. University of Victoria; 2008. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1828/612.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Markov MM. A fast practical algorithm for the vertex separation of unicyclic graphs. [Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/612

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

24. Duffy, Christopher. Homomorphisms of (j, k)-mixed graphs.

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

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

► A mixed *graph* is a simple *graph* in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j…
(more)

Subjects/Keywords: graph theory; coloring; homomorphism; algorithms; complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duffy, C. (2015). Homomorphisms of (j, k)-mixed graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6601

Not specified: Masters Thesis or Doctoral Dissertation

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

Duffy, Christopher. “Homomorphisms of (j, k)-mixed graphs.” 2015. Thesis, University of Victoria. Accessed June 24, 2019. http://hdl.handle.net/1828/6601.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Duffy, Christopher. “Homomorphisms of (j, k)-mixed graphs.” 2015. Web. 24 Jun 2019.

Vancouver:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1828/6601.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6601

Not specified: Masters Thesis or Doctoral Dissertation

McGill University

25.
Lalonde, J. P.
* Algorithms* for the decomposition of graphs into strongly connected components and applications.

Degree: MS, School of Computer Science., 1973, McGill University

URL: http://digitool.library.mcgill.ca/thesisfile51601.pdf

Subjects/Keywords: Graph theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lalonde, J. P. (1973). Algorithms for the decomposition of graphs into strongly connected components and applications. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile51601.pdf

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

Lalonde, J P. “Algorithms for the decomposition of graphs into strongly connected components and applications.” 1973. Masters Thesis, McGill University. Accessed June 24, 2019. http://digitool.library.mcgill.ca/thesisfile51601.pdf.

MLA Handbook (7^{th} Edition):

Lalonde, J P. “Algorithms for the decomposition of graphs into strongly connected components and applications.” 1973. Web. 24 Jun 2019.

Vancouver:

Lalonde JP. Algorithms for the decomposition of graphs into strongly connected components and applications. [Internet] [Masters thesis]. McGill University; 1973. [cited 2019 Jun 24]. Available from: http://digitool.library.mcgill.ca/thesisfile51601.pdf.

Council of Science Editors:

Lalonde JP. Algorithms for the decomposition of graphs into strongly connected components and applications. [Masters Thesis]. McGill University; 1973. Available from: http://digitool.library.mcgill.ca/thesisfile51601.pdf

26.
Sachdeva, Sushant.
New Results in the Theory of Approximation: Fast *Graph* *Algorithms* and Inapproximability
.

Degree: PhD, 2013, Princeton University

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

► For several basic optimization problems, it is NP-hard to find an exact solution. As a result, understanding the best possible trade-off between the running time…
(more)

Subjects/Keywords: Algorithms; Approximation; Exponential; Graph Partitioning; Hardness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sachdeva, S. (2013). New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01rn301150n

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

Sachdeva, Sushant. “New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability .” 2013. Doctoral Dissertation, Princeton University. Accessed June 24, 2019. http://arks.princeton.edu/ark:/88435/dsp01rn301150n.

MLA Handbook (7^{th} Edition):

Sachdeva, Sushant. “New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability .” 2013. Web. 24 Jun 2019.

Vancouver:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2019 Jun 24]. Available from: http://arks.princeton.edu/ark:/88435/dsp01rn301150n.

Council of Science Editors:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Doctoral Dissertation]. Princeton University; 2013. Available from: http://arks.princeton.edu/ark:/88435/dsp01rn301150n

University of Guelph

27. Kielstra, Immanuel Thomas. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd .

Degree: 2019, University of Guelph

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

► This thesis attempts to determine whether a modified version of the genetic algorithm developed by Ashlock et al. (2014) could be used to create graphs…
(more)

Subjects/Keywords: Parameter Optimization; Genetic Algorithms; Graph Colouring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kielstra, I. T. (2019). Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694

Not specified: Masters Thesis or Doctoral Dissertation

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

Kielstra, Immanuel Thomas. “Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd .” 2019. Thesis, University of Guelph. Accessed June 24, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kielstra, Immanuel Thomas. “Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd .” 2019. Web. 24 Jun 2019.

Vancouver:

Kielstra IT. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd . [Internet] [Thesis]. University of Guelph; 2019. [cited 2019 Jun 24]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kielstra IT. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd . [Thesis]. University of Guelph; 2019. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694

Not specified: Masters Thesis or Doctoral Dissertation

University of Connecticut

28.
Ahmad, Masab.
Understanding Concurrency for *Graph* Workloads in Large Scale Multicores.

Degree: MS, Electrical Engineering, 2016, University of Connecticut

URL: https://opencommons.uconn.edu/gs_theses/1018

► *Algorithms* operating on a *graph* setting are known to be highly irregular and un- structured. This leads to workload imbalance and data locality challenge…
(more)

Subjects/Keywords: Computer Architecture; Graph Algorithms; Workload Characterization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ahmad, M. (2016). Understanding Concurrency for Graph Workloads in Large Scale Multicores. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/1018

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

Ahmad, Masab. “Understanding Concurrency for Graph Workloads in Large Scale Multicores.” 2016. Masters Thesis, University of Connecticut. Accessed June 24, 2019. https://opencommons.uconn.edu/gs_theses/1018.

MLA Handbook (7^{th} Edition):

Ahmad, Masab. “Understanding Concurrency for Graph Workloads in Large Scale Multicores.” 2016. Web. 24 Jun 2019.

Vancouver:

Ahmad M. Understanding Concurrency for Graph Workloads in Large Scale Multicores. [Internet] [Masters thesis]. University of Connecticut; 2016. [cited 2019 Jun 24]. Available from: https://opencommons.uconn.edu/gs_theses/1018.

Council of Science Editors:

Ahmad M. Understanding Concurrency for Graph Workloads in Large Scale Multicores. [Masters Thesis]. University of Connecticut; 2016. Available from: https://opencommons.uconn.edu/gs_theses/1018

Columbia University

29.
Sun, Timothy.
Testing Convexity and Acyclicity, and New Constructions for Dense *Graph* Embeddings.

Degree: 2019, Columbia University

URL: https://doi.org/10.7916/d8-fs41-c774

► Property testing, especially that of geometric and *graph* properties, is an ongoing area of research. In this thesis, we present a result from each of…
(more)

Subjects/Keywords: Computer science; Algorithms; Topological graph theory; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sun, T. (2019). Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-fs41-c774

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

Sun, Timothy. “Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings.” 2019. Doctoral Dissertation, Columbia University. Accessed June 24, 2019. https://doi.org/10.7916/d8-fs41-c774.

MLA Handbook (7^{th} Edition):

Sun, Timothy. “Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings.” 2019. Web. 24 Jun 2019.

Vancouver:

Sun T. Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings. [Internet] [Doctoral dissertation]. Columbia University; 2019. [cited 2019 Jun 24]. Available from: https://doi.org/10.7916/d8-fs41-c774.

Council of Science Editors:

Sun T. Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings. [Doctoral Dissertation]. Columbia University; 2019. Available from: https://doi.org/10.7916/d8-fs41-c774

Virginia Tech

30. Cadena, Jose Eduardo. Finding Interesting Subgraphs with Guarantees.

Degree: PhD, Computer Science, 2018, Virginia Tech

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

► Networks are a mathematical abstraction of the interactions between a set of entities, with extensive applications in social science, epidemiology, bioinformatics, and cybersecurity, among others.…
(more)

Subjects/Keywords: Graph Mining; Data Mining; Graph Algorithms; Anomaly Detection; Finding Subgraphs; Parameterized Complexity; Distributed Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cadena, J. E. (2018). Finding Interesting Subgraphs with Guarantees. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/81960

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

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Doctoral Dissertation, Virginia Tech. Accessed June 24, 2019. http://hdl.handle.net/10919/81960.

MLA Handbook (7^{th} Edition):

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Web. 24 Jun 2019.

Vancouver:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10919/81960.

Council of Science Editors:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/81960