Advanced search options

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

You searched for `subject:( Graph algorithms)`

.
Showing records 1 – 30 of
465 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (134)
- 2011 – 2015 (183)
- 2006 – 2010 (97)
- 2001 – 2005 (38)
- 1996 – 2000 (21)
- 1991 – 1995 (15)

Universities

- ETH Zürich (36)
- Brno University of Technology (24)
- Georgia Tech (24)
- University of Florida (16)
- University of Waterloo (15)
- Texas A&M University (12)
- University of Victoria (12)
- Indian Institute of Science (10)

Department

- Computer Science (46)
- Informatique (24)
- Electrical and Computer Engineering (10)

Degrees

- PhD (98)
- MS (40)
- Docteur es (32)

Languages

- English (293)
- Czech (24)
- Greek (17)
- French (13)
- Portuguese (11)

▼ 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Jul 14]. 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 July 14, 2020. http://hdl.handle.net/2022/22605.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2020 Jul 14]. 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 Hong Kong

3. 袁文俊. Flexgraph: flexible subgraph search in large graphs.

Degree: 2010, University of Hong Kong

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

Subjects/Keywords: Graph algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

袁文俊.. (2010). Flexgraph: flexible subgraph search in large graphs. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/134820

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

袁文俊.. “Flexgraph: flexible subgraph search in large graphs.” 2010. Thesis, University of Hong Kong. Accessed July 14, 2020. http://hdl.handle.net/10722/134820.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

袁文俊.. “Flexgraph: flexible subgraph search in large graphs.” 2010. Web. 14 Jul 2020.

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

Author name may be incomplete

Vancouver:

袁文俊.. Flexgraph: flexible subgraph search in large graphs. [Internet] [Thesis]. University of Hong Kong; 2010. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10722/134820.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

袁文俊.. Flexgraph: flexible subgraph search in large graphs. [Thesis]. University of Hong Kong; 2010. Available from: http://hdl.handle.net/10722/134820

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Vanderbilt University

4. 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 July 14, 2020. http://etd.library.vanderbilt.edu//available/etd-05032013-125427/ ;.

MLA Handbook (7^{th} Edition):

Linn, Joseph Garrett. “Path-Precedence Orders in Trees.” 2013. Web. 14 Jul 2020.

Vancouver:

Linn JG. Path-Precedence Orders in Trees. [Internet] [Doctoral dissertation]. Vanderbilt University; 2013. [cited 2020 Jul 14]. 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/ ;

University of Waterloo

5.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Subramanya V. Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jul 14]. 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

Hong Kong University of Science and Technology

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

Degree: 2018, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-95785 ; 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 http://repository.ust.hk/ir/Record/1783.1-95785 ; 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 July 14, 2020. http://repository.ust.hk/ir/Record/1783.1-95785 ; 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. 14 Jul 2020.

Vancouver:

Wang YC. Towards better perception of graph visualization. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2020 Jul 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-95785 ; 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: http://repository.ust.hk/ir/Record/1783.1-95785 ; 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 Limerick

7.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Ghassemi Toosi F. Novel heurisitic approaches to iterative graph drawing. [Internet] [Thesis]. University of Limerick; 2017. [cited 2020 Jul 14]. 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

Texas A&M University

8.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Jul 14]. 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

9. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Zhao X. Analyzing and Processing Big Real Graphs. [Internet] [Thesis]. University of California – eScholarship, University of California; 2014. [cited 2020 Jul 14]. 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

10. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Mondal D. Visualizing graphs: optimization and trade-offs. [Internet] [Thesis]. University of Manitoba; 2014. [cited 2020 Jul 14]. 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

Texas A&M University

11.
Harshvardhan.
Algorithm-Level Optimizations for Scalable Parallel *Graph* Processing.

Degree: PhD, Computer Science, 2018, Texas A&M University

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

► Efficiently processing large graphs is challenging, since parallel *graph* *algorithms* suffer from poor scalability and performance due to many factors, including heavy communication and load-imbalance.…
(more)

Subjects/Keywords: Graph Processing; Distributed Systems; Graph Algorithms; High Performance Computing; Parallel Graph Algorithms; Scalable Graph Algorithms; Distributed Graph Processing Systems; Large-scale Graph Processing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harshvardhan. (2018). Algorithm-Level Optimizations for Scalable Parallel Graph Processing. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173407

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

Author name may be incomplete

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

Harshvardhan. “Algorithm-Level Optimizations for Scalable Parallel Graph Processing.” 2018. Doctoral Dissertation, Texas A&M University. Accessed July 14, 2020. http://hdl.handle.net/1969.1/173407.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Harshvardhan. “Algorithm-Level Optimizations for Scalable Parallel Graph Processing.” 2018. Web. 14 Jul 2020.

Author name may be incomplete

Vancouver:

Harshvardhan. Algorithm-Level Optimizations for Scalable Parallel Graph Processing. [Internet] [Doctoral dissertation]. Texas A&M University; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1969.1/173407.

Author name may be incomplete

Council of Science Editors:

Harshvardhan. Algorithm-Level Optimizations for Scalable Parallel Graph Processing. [Doctoral Dissertation]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173407

Author name may be incomplete

Montana State University

12. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Li Z. An efficient implementation of a planarity testing and maximal planar subgraph algorithm. [Internet] [Thesis]. Montana State University; 1996. [cited 2020 Jul 14]. 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

McGill University

13.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Lalonde JP. Algorithms for the decomposition of graphs into strongly connected components and applications. [Internet] [Masters thesis]. McGill University; 1973. [cited 2020 Jul 14]. 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

Columbia University

14.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Sun T. Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings. [Internet] [Doctoral dissertation]. Columbia University; 2019. [cited 2020 Jul 14]. 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

University of Connecticut

15.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Ahmad M. Understanding Concurrency for Graph Workloads in Large Scale Multicores. [Internet] [Masters thesis]. University of Connecticut; 2016. [cited 2020 Jul 14]. 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

16.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2020 Jul 14]. 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

17. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Kielstra IT. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd . [Internet] [Thesis]. University of Guelph; 2019. [cited 2020 Jul 14]. 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 Victoria

18. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Markov MM. A fast practical algorithm for the vertex separation of unicyclic graphs. [Internet] [Thesis]. University of Victoria; 2008. [cited 2020 Jul 14]. 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

19. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Jul 14]. 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

University of Victoria

20. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Dinneen MJ. Bounded combinatorial width and forbidden substructures. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Jul 14]. 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

Georgia Tech

21.
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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Sanders DP. Linear algorithms for graphs of tree-width at most four. [Internet] [Doctoral dissertation]. Georgia Tech; 1993. [cited 2020 Jul 14]. 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

Virginia Tech

22. 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 July 14, 2020. http://hdl.handle.net/10919/81960.

MLA Handbook (7^{th} Edition):

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Web. 14 Jul 2020.

Vancouver:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Jul 14]. 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

Ryerson University

23. Haidar, Ali. The CC-Game: A Variant Of The Game Of Cops And Robbers.

Degree: 2012, Ryerson University

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

► Cops and Robbers is a vertex pursuit game played on graphs. The objective of the game, as the name suggests, is for a set of…
(more)

Subjects/Keywords: Graph theory – Data processing; Random graphs; Graph algorithms; Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Haidar, A. (2012). The CC-Game: A Variant Of The Game Of Cops And Robbers. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

Not specified: Masters Thesis or Doctoral Dissertation

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

Haidar, Ali. “The CC-Game: A Variant Of The Game Of Cops And Robbers.” 2012. Thesis, Ryerson University. Accessed July 14, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1866.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Haidar, Ali. “The CC-Game: A Variant Of The Game Of Cops And Robbers.” 2012. Web. 14 Jul 2020.

Vancouver:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Internet] [Thesis]. Ryerson University; 2012. [cited 2020 Jul 14]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Thesis]. Ryerson University; 2012. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

24. Milanic, Martin. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs.

Degree: PhD, Operations Research, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482

► We consider the maximum independent set and maximum weight independent set problems in graphs. As these problems are generally NP-hard, we study their complexity in…
(more)

Subjects/Keywords: Graph algorithms; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Milanic, M. (2007). Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482

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

Milanic, Martin. “Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 14, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482.

MLA Handbook (7^{th} Edition):

Milanic, Martin. “Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs.” 2007. Web. 14 Jul 2020.

Vancouver:

Milanic M. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Jul 14]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482.

Council of Science Editors:

Milanic M. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482

University of Victoria

25.
Anderson, Rachel Jean Selma.
* Graph* Convexity and Vertex Orderings.

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

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

► In discrete mathematics, a convex space is an ordered pair (V,M) where M is a family of subsets of a finite set V , such…
(more)

Subjects/Keywords: discrete mathematics; graph theory; graph convexity; vertex orderings; vertex ordering algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anderson, R. J. S. (2014). Graph Convexity and Vertex Orderings. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5289

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

Anderson, Rachel Jean Selma. “Graph Convexity and Vertex Orderings.” 2014. Masters Thesis, University of Victoria. Accessed July 14, 2020. http://hdl.handle.net/1828/5289.

MLA Handbook (7^{th} Edition):

Anderson, Rachel Jean Selma. “Graph Convexity and Vertex Orderings.” 2014. Web. 14 Jul 2020.

Vancouver:

Anderson RJS. Graph Convexity and Vertex Orderings. [Internet] [Masters thesis]. University of Victoria; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1828/5289.

Council of Science Editors:

Anderson RJS. Graph Convexity and Vertex Orderings. [Masters Thesis]. University of Victoria; 2014. Available from: http://hdl.handle.net/1828/5289

University of Victoria

26.
Ibarra, Louis Walter.
Dynamic *algorithms* for chordal and interval graphs.

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

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

► We present the first dynamic algorithm that maintains a clique tree representation of a chordal *graph* and supports the following operations: (1) query whether deleting…
(more)

Subjects/Keywords: Computer hardware description languages; Graph theory; Algorithms; Trees (Graph theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ibarra, L. W. (2018). Dynamic algorithms for chordal and interval graphs. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9596

Not specified: Masters Thesis or Doctoral Dissertation

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

Ibarra, Louis Walter. “Dynamic algorithms for chordal and interval graphs.” 2018. Thesis, University of Victoria. Accessed July 14, 2020. https://dspace.library.uvic.ca//handle/1828/9596.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ibarra, Louis Walter. “Dynamic algorithms for chordal and interval graphs.” 2018. Web. 14 Jul 2020.

Vancouver:

Ibarra LW. Dynamic algorithms for chordal and interval graphs. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Jul 14]. Available from: https://dspace.library.uvic.ca//handle/1828/9596.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ibarra LW. Dynamic algorithms for chordal and interval graphs. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9596

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

27.
Mouatadid, Lalla.
Efficient *Algorithms* on Cocomparability Graphs via Vertex Orderings.

Degree: PhD, 2018, University of Toronto

URL: http://hdl.handle.net/1807/92081

► In this thesis, we give new structural and algorithmic results on cocomparability (ccp) graphs; particularly, by connecting structural properties of *graph* searching to those of…
(more)

Subjects/Keywords: Cocomparability Graphs; Efficient Algorithms; Graph Searching; Graph Theory; Optimization; Posets; 0984

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mouatadid, L. (2018). Efficient Algorithms on Cocomparability Graphs via Vertex Orderings. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/92081

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

Mouatadid, Lalla. “Efficient Algorithms on Cocomparability Graphs via Vertex Orderings.” 2018. Doctoral Dissertation, University of Toronto. Accessed July 14, 2020. http://hdl.handle.net/1807/92081.

MLA Handbook (7^{th} Edition):

Mouatadid, Lalla. “Efficient Algorithms on Cocomparability Graphs via Vertex Orderings.” 2018. Web. 14 Jul 2020.

Vancouver:

Mouatadid L. Efficient Algorithms on Cocomparability Graphs via Vertex Orderings. [Internet] [Doctoral dissertation]. University of Toronto; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1807/92081.

Council of Science Editors:

Mouatadid L. Efficient Algorithms on Cocomparability Graphs via Vertex Orderings. [Doctoral Dissertation]. University of Toronto; 2018. Available from: http://hdl.handle.net/1807/92081

Georgia Tech

28.
Fairbanks, James Paul.
* Graph* analysis combining numerical, statistical, and streaming techniques.

Degree: PhD, Computational Science and Engineering, 2016, Georgia Tech

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

► *Graph* analysis uses *graph* data collected on a physical, biological, or social phenomena to shed light on the underlying dynamics and behavior of the agents…
(more)

Subjects/Keywords: Graph analysis; Graph algorithms; Data analysis; Spectral clustering; Numerical analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fairbanks, J. P. (2016). Graph analysis combining numerical, statistical, and streaming techniques. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54972

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

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Doctoral Dissertation, Georgia Tech. Accessed July 14, 2020. http://hdl.handle.net/1853/54972.

MLA Handbook (7^{th} Edition):

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Web. 14 Jul 2020.

Vancouver:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1853/54972.

Council of Science Editors:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/54972

Rutgers University

29.
Kaminski, Marcin Jakub.
New algorithmic and hardness results for *graph* partitioning problems.

Degree: PhD, Operations Research, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472

► In this thesis we study algorithmic aspects of two *graph* partitioning problems – *graph* coloring and maximum cut. This is a summary of main results…
(more)

Subjects/Keywords: Graph algorithms; Graph coloring; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaminski, M. J. (2007). New algorithmic and hardness results for graph partitioning problems. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472

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

Kaminski, Marcin Jakub. “New algorithmic and hardness results for graph partitioning problems.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 14, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472.

MLA Handbook (7^{th} Edition):

Kaminski, Marcin Jakub. “New algorithmic and hardness results for graph partitioning problems.” 2007. Web. 14 Jul 2020.

Vancouver:

Kaminski MJ. New algorithmic and hardness results for graph partitioning problems. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Jul 14]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472.

Council of Science Editors:

Kaminski MJ. New algorithmic and hardness results for graph partitioning problems. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472

Georgia Tech

30.
Hegde, Rajneesh.
New Tools and Results in *Graph* Structure Theory.

Degree: PhD, Mathematics, 2006, Georgia Tech

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

► We first prove a ``non-embeddable extensions' theorem for polyhedral *graph* embeddings. Let G be a ``weakly 4-connected' planar *graph*. We describe a set of constructions…
(more)

Subjects/Keywords: Graph algorithms; Graph minors; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hegde, R. (2006). New Tools and Results in Graph Structure Theory. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/10481

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

Hegde, Rajneesh. “New Tools and Results in Graph Structure Theory.” 2006. Doctoral Dissertation, Georgia Tech. Accessed July 14, 2020. http://hdl.handle.net/1853/10481.

MLA Handbook (7^{th} Edition):

Hegde, Rajneesh. “New Tools and Results in Graph Structure Theory.” 2006. Web. 14 Jul 2020.

Vancouver:

Hegde R. New Tools and Results in Graph Structure Theory. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1853/10481.

Council of Science Editors:

Hegde R. New Tools and Results in Graph Structure Theory. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/10481