Advanced search options

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

You searched for `subject:(Graph Analysis)`

.
Showing records 1 – 30 of
407 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (134)
- 2011 – 2015 (206)
- 2006 – 2010 (63)
- 2001 – 2005 (18)

Universities

- Brno University of Technology (24)
- Georgia Tech (15)
- ETH Zürich (10)

Department

- Computer Science (28)
- Informatique (20)
- Computer Science and Engineering (11)
- Mathematics (11)

Degrees

- PhD (110)
- Docteur es (41)
- MS (28)

Country

- US (167)
- France (41)
- Canada (28)
- Czech Republic (24)
- Sweden (20)
- Greece (19)
- UK (18)
- Australia (13)
- Switzerland (10)

▼ Search Limiters

Delft University of Technology

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

Degree: 2012, Delft University of Technology

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

Penders, A. “Accelerating Graph Analysis with Heterogeneous Systems:.” 2012. Web. 22 Jan 2020.

Vancouver:

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

Council of Science Editors:

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

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

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

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhao, Xiaohan. “Analyzing and Processing Big Real Graphs.” 2014. Web. 22 Jan 2020.

Vancouver:

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

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

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

Georgia Tech

3.
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 January 22, 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. 22 Jan 2020.

Vancouver:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Jan 22]. 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

University of Johannesburg

4. Ungerer, Elna. Aspects of signed and minus domination in graphs.

Degree: PhD, 2012, University of Johannesburg

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

► In Chapter 1 we will give a brief historical account of domination theory and define the necessary concepts which we use in the remainder of…
(more)

Subjects/Keywords: Graph theory; Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ungerer, E. (2012). Aspects of signed and minus domination in graphs. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6640

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

Ungerer, Elna. “Aspects of signed and minus domination in graphs.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed January 22, 2020. http://hdl.handle.net/10210/6640.

MLA Handbook (7^{th} Edition):

Ungerer, Elna. “Aspects of signed and minus domination in graphs.” 2012. Web. 22 Jan 2020.

Vancouver:

Ungerer E. Aspects of signed and minus domination in graphs. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/10210/6640.

Council of Science Editors:

Ungerer E. Aspects of signed and minus domination in graphs. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6640

University of Johannesburg

5. Dorfling, Samantha. Domination in graphs with bounded degrees.

Degree: 2012, University of Johannesburg

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

►

M.Sc.

Let G be a *graph* and D a set of vertices such that every vertex in G is in D or adjacent to at…
(more)

Subjects/Keywords: Graph theory.; Combinatorial analysis.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dorfling, S. (2012). Domination in graphs with bounded degrees. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/7284

Not specified: Masters Thesis or Doctoral Dissertation

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

Dorfling, Samantha. “Domination in graphs with bounded degrees.” 2012. Thesis, University of Johannesburg. Accessed January 22, 2020. http://hdl.handle.net/10210/7284.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dorfling, Samantha. “Domination in graphs with bounded degrees.” 2012. Web. 22 Jan 2020.

Vancouver:

Dorfling S. Domination in graphs with bounded degrees. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/10210/7284.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dorfling S. Domination in graphs with bounded degrees. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/7284

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

6. Jose, Neha Clare. Social Media Network Data Mining and Optimization.

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

URL: etd-05252016-161222 ; https://digitalcommons.lsu.edu/gradschool_theses/3024

► Many small social aid organizations could benefit from collaborating with other organizations on common causes, but may not have the necessary social relationships. We present…
(more)

Subjects/Keywords: Graph Analysis; Centrality; Data Mining

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jose, N. C. (2016). Social Media Network Data Mining and Optimization. (Masters Thesis). Louisiana State University. Retrieved from etd-05252016-161222 ; https://digitalcommons.lsu.edu/gradschool_theses/3024

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

Jose, Neha Clare. “Social Media Network Data Mining and Optimization.” 2016. Masters Thesis, Louisiana State University. Accessed January 22, 2020. etd-05252016-161222 ; https://digitalcommons.lsu.edu/gradschool_theses/3024.

MLA Handbook (7^{th} Edition):

Jose, Neha Clare. “Social Media Network Data Mining and Optimization.” 2016. Web. 22 Jan 2020.

Vancouver:

Jose NC. Social Media Network Data Mining and Optimization. [Internet] [Masters thesis]. Louisiana State University; 2016. [cited 2020 Jan 22]. Available from: etd-05252016-161222 ; https://digitalcommons.lsu.edu/gradschool_theses/3024.

Council of Science Editors:

Jose NC. Social Media Network Data Mining and Optimization. [Masters Thesis]. Louisiana State University; 2016. Available from: etd-05252016-161222 ; https://digitalcommons.lsu.edu/gradschool_theses/3024

7. Corley, Christopher M. On the minimum rank of certain graphs with path cover number 2.

Degree: 2015, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/166

► The minimum rank problem is an interesting and ongoing problem in spectral *graph* theory which seeks to answer the question "Given a simple *graph* G…
(more)

Subjects/Keywords: Graph theory (Mathematics); Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Corley, C. M. (2015). On the minimum rank of certain graphs with path cover number 2. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/166

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

Corley, Christopher M. “On the minimum rank of certain graphs with path cover number 2.” 2015. Masters Thesis, University of Tennessee – Chattanooga. Accessed January 22, 2020. https://scholar.utc.edu/theses/166.

MLA Handbook (7^{th} Edition):

Corley, Christopher M. “On the minimum rank of certain graphs with path cover number 2.” 2015. Web. 22 Jan 2020.

Vancouver:

Corley CM. On the minimum rank of certain graphs with path cover number 2. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2015. [cited 2020 Jan 22]. Available from: https://scholar.utc.edu/theses/166.

Council of Science Editors:

Corley CM. On the minimum rank of certain graphs with path cover number 2. [Masters Thesis]. University of Tennessee – Chattanooga; 2015. Available from: https://scholar.utc.edu/theses/166

Cal Poly

8. Cantrell, Michael A. Observations of the Copenhagen Networks Study.

Degree: MS, Computer Science, 2019, Cal Poly

URL: https://digitalcommons.calpoly.edu/theses/2087

► Attribute-rich longitudinal datasets of any kind are extremely rare. In 2012 and 2013, the SensibleDTU project created such a dataset using approximately 1,000 university…
(more)

Subjects/Keywords: Data Analysis; Graph Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cantrell, M. A. (2019). Observations of the Copenhagen Networks Study. (Masters Thesis). Cal Poly. Retrieved from https://digitalcommons.calpoly.edu/theses/2087

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

Cantrell, Michael A. “Observations of the Copenhagen Networks Study.” 2019. Masters Thesis, Cal Poly. Accessed January 22, 2020. https://digitalcommons.calpoly.edu/theses/2087.

MLA Handbook (7^{th} Edition):

Cantrell, Michael A. “Observations of the Copenhagen Networks Study.” 2019. Web. 22 Jan 2020.

Vancouver:

Cantrell MA. Observations of the Copenhagen Networks Study. [Internet] [Masters thesis]. Cal Poly; 2019. [cited 2020 Jan 22]. Available from: https://digitalcommons.calpoly.edu/theses/2087.

Council of Science Editors:

Cantrell MA. Observations of the Copenhagen Networks Study. [Masters Thesis]. Cal Poly; 2019. Available from: https://digitalcommons.calpoly.edu/theses/2087

Rutgers University

9.
Herdade, Simao, 1984-.
Stability results in additive combinatorics and *graph* theory.

Degree: PhD, Mathematics, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

►

A general problem in Extremal Combinatorics asks about the maximum size of a collection of finite objects satisfying certain restrictions, and an ideal solution to… (more)

Subjects/Keywords: Combinatorial analysis; Stability; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Herdade, Simao, 1. (2015). Stability results in additive combinatorics and graph theory. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

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

Herdade, Simao, 1984-. “Stability results in additive combinatorics and graph theory.” 2015. Doctoral Dissertation, Rutgers University. Accessed January 22, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/47413/.

MLA Handbook (7^{th} Edition):

Herdade, Simao, 1984-. “Stability results in additive combinatorics and graph theory.” 2015. Web. 22 Jan 2020.

Vancouver:

Herdade, Simao 1. Stability results in additive combinatorics and graph theory. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Jan 22]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/.

Council of Science Editors:

Herdade, Simao 1. Stability results in additive combinatorics and graph theory. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

Rutgers University

10. Ilinca, Liviu, 1980-. Asymptotic enumeration of 2- and 3-SAT functions.

Degree: PhD, Mathematics, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609

►

We are interested in the number, G(k,n), of Boolean functions of n variables definable by k-SAT formulae. First, in Chapter 2, we give an alternate… (more)

Subjects/Keywords: Combinatorial analysis; Graph theory; Hypergraphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ilinca, Liviu, 1. (2010). Asymptotic enumeration of 2- and 3-SAT functions. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609

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

Ilinca, Liviu, 1980-. “Asymptotic enumeration of 2- and 3-SAT functions.” 2010. Doctoral Dissertation, Rutgers University. Accessed January 22, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609.

MLA Handbook (7^{th} Edition):

Ilinca, Liviu, 1980-. “Asymptotic enumeration of 2- and 3-SAT functions.” 2010. Web. 22 Jan 2020.

Vancouver:

Ilinca, Liviu 1. Asymptotic enumeration of 2- and 3-SAT functions. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Jan 22]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609.

Council of Science Editors:

Ilinca, Liviu 1. Asymptotic enumeration of 2- and 3-SAT functions. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609

Carnegie Mellon University

11. Kang, U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries.

Degree: 2012, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/160

► How do we find patterns and anomalies, on graphs with billions of nodes and edges, which do not fit in memory? How to use parallelism…
(more)

Subjects/Keywords: graph mining; MAPREDUCE; HADOOP; graph structure analysis; radius plot; diameter; connected component; inference; spectral graph analysis; eigensolver; tensor analysis; graph management; graph indexing; graph compression; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kang, U. (2012). Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/160

Not specified: Masters Thesis or Doctoral Dissertation

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

Kang, U. “Mining Tera-Scale Graphs: Theory, Engineering and Discoveries.” 2012. Thesis, Carnegie Mellon University. Accessed January 22, 2020. http://repository.cmu.edu/dissertations/160.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kang, U. “Mining Tera-Scale Graphs: Theory, Engineering and Discoveries.” 2012. Web. 22 Jan 2020.

Vancouver:

Kang U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. [Internet] [Thesis]. Carnegie Mellon University; 2012. [cited 2020 Jan 22]. Available from: http://repository.cmu.edu/dissertations/160.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kang U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. [Thesis]. Carnegie Mellon University; 2012. Available from: http://repository.cmu.edu/dissertations/160

Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

12. 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 January 22, 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. 22 Jan 2020.

Vancouver:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Internet] [Thesis]. Ryerson University; 2012. [cited 2020 Jan 22]. 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

Cranfield University

13. Muvingi, Onai. Restructuring air transport to meet the needs of the Southern African development community.

Degree: PhD, 2012, Cranfield University

URL: http://dspace.lib.cranfield.ac.uk/handle/1826/7915 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571989

► An efficient air transport system is an important part of social and economic development of Southern African Development Community (SADC). Efficient intra-SADC air service connections…
(more)

Subjects/Keywords: 387.7; Network analysis; graph theory; graph theory; benchmarking; gravity model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Muvingi, O. (2012). Restructuring air transport to meet the needs of the Southern African development community. (Doctoral Dissertation). Cranfield University. Retrieved from http://dspace.lib.cranfield.ac.uk/handle/1826/7915 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571989

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

Muvingi, Onai. “Restructuring air transport to meet the needs of the Southern African development community.” 2012. Doctoral Dissertation, Cranfield University. Accessed January 22, 2020. http://dspace.lib.cranfield.ac.uk/handle/1826/7915 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571989.

MLA Handbook (7^{th} Edition):

Muvingi, Onai. “Restructuring air transport to meet the needs of the Southern African development community.” 2012. Web. 22 Jan 2020.

Vancouver:

Muvingi O. Restructuring air transport to meet the needs of the Southern African development community. [Internet] [Doctoral dissertation]. Cranfield University; 2012. [cited 2020 Jan 22]. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/7915 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571989.

Council of Science Editors:

Muvingi O. Restructuring air transport to meet the needs of the Southern African development community. [Doctoral Dissertation]. Cranfield University; 2012. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/7915 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571989

Cranfield University

14. Muvingi, Onai. Restructuring air transport to meet the needs of the Southern African development community.

Degree: PhD, 2012, Cranfield University

URL: http://dspace.lib.cranfield.ac.uk/handle/1826/7915

► An efficient air transport system is an important part of social and economic development of Southern African Development Community (SADC). Efficient intra-SADC air service connections…
(more)

Subjects/Keywords: Network analysis; graph theory; graph theory; benchmarking; gravity model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Muvingi, O. (2012). Restructuring air transport to meet the needs of the Southern African development community. (Doctoral Dissertation). Cranfield University. Retrieved from http://dspace.lib.cranfield.ac.uk/handle/1826/7915

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

Muvingi, Onai. “Restructuring air transport to meet the needs of the Southern African development community.” 2012. Doctoral Dissertation, Cranfield University. Accessed January 22, 2020. http://dspace.lib.cranfield.ac.uk/handle/1826/7915.

MLA Handbook (7^{th} Edition):

Muvingi, Onai. “Restructuring air transport to meet the needs of the Southern African development community.” 2012. Web. 22 Jan 2020.

Vancouver:

Muvingi O. Restructuring air transport to meet the needs of the Southern African development community. [Internet] [Doctoral dissertation]. Cranfield University; 2012. [cited 2020 Jan 22]. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/7915.

Council of Science Editors:

Muvingi O. Restructuring air transport to meet the needs of the Southern African development community. [Doctoral Dissertation]. Cranfield University; 2012. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/7915

Georgia Tech

15.
Zakrzewska, Anita N.
*Graph**analysis* of streaming relational data.

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

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

► *Graph* *analysis* can be used to study streaming data from a variety of sources, such as social networks, financial transactions, and online communication. The *analysis*…
(more)

Subjects/Keywords: Graph algorithms; Graph analysis; Streaming data; Dynamic graphs; Community detection; Sampling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zakrzewska, A. N. (2018). Graph analysis of streaming relational data. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59917

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

Zakrzewska, Anita N. “Graph analysis of streaming relational data.” 2018. Doctoral Dissertation, Georgia Tech. Accessed January 22, 2020. http://hdl.handle.net/1853/59917.

MLA Handbook (7^{th} Edition):

Zakrzewska, Anita N. “Graph analysis of streaming relational data.” 2018. Web. 22 Jan 2020.

Vancouver:

Zakrzewska AN. Graph analysis of streaming relational data. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/1853/59917.

Council of Science Editors:

Zakrzewska AN. Graph analysis of streaming relational data. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59917

16.
Tian, Chao.
Towards effective *analysis* of big graphs : from scalability to quality.

Degree: PhD, 2017, University of Edinburgh

URL: http://hdl.handle.net/1842/29578

► This thesis investigates the central issues underlying *graph* *analysis*, namely, scalability and quality. We first study the incremental problems for *graph* queries, which aim to…
(more)

Subjects/Keywords: graph analysis; graph querying; graph data management; graph dependencies; NGDs; clean graphs; scalability; quality; subgraph isomorphism; linear arithmetic expressions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tian, C. (2017). Towards effective analysis of big graphs : from scalability to quality. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/29578

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

Tian, Chao. “Towards effective analysis of big graphs : from scalability to quality.” 2017. Doctoral Dissertation, University of Edinburgh. Accessed January 22, 2020. http://hdl.handle.net/1842/29578.

MLA Handbook (7^{th} Edition):

Tian, Chao. “Towards effective analysis of big graphs : from scalability to quality.” 2017. Web. 22 Jan 2020.

Vancouver:

Tian C. Towards effective analysis of big graphs : from scalability to quality. [Internet] [Doctoral dissertation]. University of Edinburgh; 2017. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/1842/29578.

Council of Science Editors:

Tian C. Towards effective analysis of big graphs : from scalability to quality. [Doctoral Dissertation]. University of Edinburgh; 2017. Available from: http://hdl.handle.net/1842/29578

Louisiana State University

17.
Basuchowdhuri, Partha.
Greedy methods for approximate *graph* matching with applications for social network * analysis*.

Degree: MSCS, Computer Sciences, 2009, Louisiana State University

URL: etd-04132009-134102 ; https://digitalcommons.lsu.edu/gradschool_theses/3105

► In this thesis, we study greedy algorithms for approximate sub-*graph* matching with attributed graphs. Such algorithms find one or multiple copies of a sub-*graph* pattern…
(more)

Subjects/Keywords: Sub-Graph Mining; Seed; Social Network Analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Basuchowdhuri, P. (2009). Greedy methods for approximate graph matching with applications for social network analysis. (Masters Thesis). Louisiana State University. Retrieved from etd-04132009-134102 ; https://digitalcommons.lsu.edu/gradschool_theses/3105

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

Basuchowdhuri, Partha. “Greedy methods for approximate graph matching with applications for social network analysis.” 2009. Masters Thesis, Louisiana State University. Accessed January 22, 2020. etd-04132009-134102 ; https://digitalcommons.lsu.edu/gradschool_theses/3105.

MLA Handbook (7^{th} Edition):

Basuchowdhuri, Partha. “Greedy methods for approximate graph matching with applications for social network analysis.” 2009. Web. 22 Jan 2020.

Vancouver:

Basuchowdhuri P. Greedy methods for approximate graph matching with applications for social network analysis. [Internet] [Masters thesis]. Louisiana State University; 2009. [cited 2020 Jan 22]. Available from: etd-04132009-134102 ; https://digitalcommons.lsu.edu/gradschool_theses/3105.

Council of Science Editors:

Basuchowdhuri P. Greedy methods for approximate graph matching with applications for social network analysis. [Masters Thesis]. Louisiana State University; 2009. Available from: etd-04132009-134102 ; https://digitalcommons.lsu.edu/gradschool_theses/3105

Ryerson University

18. Dennis, Christopher. Error locating: degree constraints.

Degree: 2016, Ryerson University

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

► Error graphs are a useful mathematical tool for representing failing interactions in a system. This representation is used as the basis for constructing an error…
(more)

Subjects/Keywords: Array processors.; Graph theory.; Combinatorial analysis.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dennis, C. (2016). Error locating: degree constraints. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A5690

Not specified: Masters Thesis or Doctoral Dissertation

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

Dennis, Christopher. “Error locating: degree constraints.” 2016. Thesis, Ryerson University. Accessed January 22, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A5690.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dennis, Christopher. “Error locating: degree constraints.” 2016. Web. 22 Jan 2020.

Vancouver:

Dennis C. Error locating: degree constraints. [Internet] [Thesis]. Ryerson University; 2016. [cited 2020 Jan 22]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5690.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dennis C. Error locating: degree constraints. [Thesis]. Ryerson University; 2016. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5690

Not specified: Masters Thesis or Doctoral Dissertation

19. Villanueva, Matthew. On the δ-conjecture for graphs with minimum degree |G| – 4.

Degree: 2017, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/507

► For a *graph* G of order n, the minimum rank of G is defined to be the minimum rank among all n × n symmetric…
(more)

Subjects/Keywords: Graph theory; Mathematical analysis; Matrices; Algebras, Linear

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Villanueva, M. (2017). On the δ-conjecture for graphs with minimum degree |G| – 4. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/507

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

Villanueva, Matthew. “On the δ-conjecture for graphs with minimum degree |G| – 4.” 2017. Masters Thesis, University of Tennessee – Chattanooga. Accessed January 22, 2020. https://scholar.utc.edu/theses/507.

MLA Handbook (7^{th} Edition):

Villanueva, Matthew. “On the δ-conjecture for graphs with minimum degree |G| – 4.” 2017. Web. 22 Jan 2020.

Vancouver:

Villanueva M. On the δ-conjecture for graphs with minimum degree |G| – 4. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2017. [cited 2020 Jan 22]. Available from: https://scholar.utc.edu/theses/507.

Council of Science Editors:

Villanueva M. On the δ-conjecture for graphs with minimum degree |G| – 4. [Masters Thesis]. University of Tennessee – Chattanooga; 2017. Available from: https://scholar.utc.edu/theses/507

University of Waterloo

20. Walker, Sean. Conflicting Attitudes in Environmental Management and Brownfield Redevelopment.

Degree: 2012, University of Waterloo

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

► An enhanced attitudes methodology within the framework of the *Graph* Model for Conflict Resolution (GMCR) is developed and applied to a range of environmental disputes,…
(more)

Subjects/Keywords: Conflict Analysis; Graph Model for Conflict Resolution

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Walker, S. (2012). Conflicting Attitudes in Environmental Management and Brownfield Redevelopment. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6741

Not specified: Masters Thesis or Doctoral Dissertation

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

Walker, Sean. “Conflicting Attitudes in Environmental Management and Brownfield Redevelopment.” 2012. Thesis, University of Waterloo. Accessed January 22, 2020. http://hdl.handle.net/10012/6741.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Walker, Sean. “Conflicting Attitudes in Environmental Management and Brownfield Redevelopment.” 2012. Web. 22 Jan 2020.

Vancouver:

Walker S. Conflicting Attitudes in Environmental Management and Brownfield Redevelopment. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/10012/6741.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Walker S. Conflicting Attitudes in Environmental Management and Brownfield Redevelopment. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6741

Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

21. Simoes Gomes, Carolina. Heavyweight Pattern Mining in Attributed Flow Graphs.

Degree: MS, Department of Computing Science, 2012, University of Alberta

URL: https://era.library.ualberta.ca/files/r494vk17h

► Flow graphs are an abstraction used to represent elements travelling through a network of nodes. The paths between nodes are directed edges in the *graph*,…
(more)

Subjects/Keywords: software analysis; pattern mining; program analysis; flow graph; program profiling; sub-graph mining; data mining

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Simoes Gomes, C. (2012). Heavyweight Pattern Mining in Attributed Flow Graphs. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/r494vk17h

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

Simoes Gomes, Carolina. “Heavyweight Pattern Mining in Attributed Flow Graphs.” 2012. Masters Thesis, University of Alberta. Accessed January 22, 2020. https://era.library.ualberta.ca/files/r494vk17h.

MLA Handbook (7^{th} Edition):

Simoes Gomes, Carolina. “Heavyweight Pattern Mining in Attributed Flow Graphs.” 2012. Web. 22 Jan 2020.

Vancouver:

Simoes Gomes C. Heavyweight Pattern Mining in Attributed Flow Graphs. [Internet] [Masters thesis]. University of Alberta; 2012. [cited 2020 Jan 22]. Available from: https://era.library.ualberta.ca/files/r494vk17h.

Council of Science Editors:

Simoes Gomes C. Heavyweight Pattern Mining in Attributed Flow Graphs. [Masters Thesis]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/r494vk17h

22.
Liu, Qingyun.
Data-driven *Graph* * Analysis*.

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

URL: http://www.escholarship.org/uc/item/89z8k2r7

► The ever-expanding demands for network utilities today have greatly changed people’s lives. We are all around by various networks, from Internet, social net- works, to…
(more)

Subjects/Keywords: Computer science; Data-driven Analysis; Graph Analysis; Graph Modeling; Large-scale Data; Online Social Networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Q. (2017). Data-driven Graph Analysis. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/89z8k2r7

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, Qingyun. “Data-driven Graph Analysis.” 2017. Thesis, University of California – eScholarship, University of California. Accessed January 22, 2020. http://www.escholarship.org/uc/item/89z8k2r7.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Qingyun. “Data-driven Graph Analysis.” 2017. Web. 22 Jan 2020.

Vancouver:

Liu Q. Data-driven Graph Analysis. [Internet] [Thesis]. University of California – eScholarship, University of California; 2017. [cited 2020 Jan 22]. Available from: http://www.escholarship.org/uc/item/89z8k2r7.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu Q. Data-driven Graph Analysis. [Thesis]. University of California – eScholarship, University of California; 2017. Available from: http://www.escholarship.org/uc/item/89z8k2r7

Not specified: Masters Thesis or Doctoral Dissertation

California State University – San Bernardino

23. Chavez, Dolores. Investigation of 4-cutwidth critical graphs.

Degree: MAin Mathematics, Mathematics, 2006, California State University – San Bernardino

URL: https://scholarworks.lib.csusb.edu/etd-project/3081

► A 2004 article written by Yixun Lin and Aifeng Yang published in the journal Discrete Math characterized the set of a 3-cutwidth critical graphs by…
(more)

Subjects/Keywords: Graph labelings; Graph theory; Combinatorial analysis; Combinatorial analysis; Graph labelings; Graph theory.; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chavez, D. (2006). Investigation of 4-cutwidth critical graphs. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd-project/3081

Not specified: Masters Thesis or Doctoral Dissertation

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

Chavez, Dolores. “Investigation of 4-cutwidth critical graphs.” 2006. Thesis, California State University – San Bernardino. Accessed January 22, 2020. https://scholarworks.lib.csusb.edu/etd-project/3081.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chavez, Dolores. “Investigation of 4-cutwidth critical graphs.” 2006. Web. 22 Jan 2020.

Vancouver:

Chavez D. Investigation of 4-cutwidth critical graphs. [Internet] [Thesis]. California State University – San Bernardino; 2006. [cited 2020 Jan 22]. Available from: https://scholarworks.lib.csusb.edu/etd-project/3081.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chavez D. Investigation of 4-cutwidth critical graphs. [Thesis]. California State University – San Bernardino; 2006. Available from: https://scholarworks.lib.csusb.edu/etd-project/3081

Not specified: Masters Thesis or Doctoral Dissertation

24. Garrison, Erik. Graphical pangenomics.

Degree: PhD, 2019, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/294516

► Completely sequencing genomes is expensive, and to save costs we often analyze new genomic data in the context of a reference genome. This approach distorts…
(more)

Subjects/Keywords: genomics; pangenomics; variation graph; biology; genetics; metagenomics; succinct data structures; sequence analysis; genome graph; alignment; reference genome; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garrison, E. (2019). Graphical pangenomics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/294516

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

Garrison, Erik. “Graphical pangenomics.” 2019. Doctoral Dissertation, University of Cambridge. Accessed January 22, 2020. https://www.repository.cam.ac.uk/handle/1810/294516.

MLA Handbook (7^{th} Edition):

Garrison, Erik. “Graphical pangenomics.” 2019. Web. 22 Jan 2020.

Vancouver:

Garrison E. Graphical pangenomics. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Jan 22]. Available from: https://www.repository.cam.ac.uk/handle/1810/294516.

Council of Science Editors:

Garrison E. Graphical pangenomics. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/294516

University of Cambridge

25. Garrison, Erik. Graphical pangenomics.

Degree: PhD, 2019, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/294516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.782939

► Completely sequencing genomes is expensive, and to save costs we often analyze new genomic data in the context of a reference genome. This approach distorts…
(more)

Subjects/Keywords: genomics; pangenomics; variation graph; biology; genetics; metagenomics; succinct data structures; sequence analysis; genome graph; alignment; reference genome; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garrison, E. (2019). Graphical pangenomics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/294516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.782939

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

Garrison, Erik. “Graphical pangenomics.” 2019. Doctoral Dissertation, University of Cambridge. Accessed January 22, 2020. https://www.repository.cam.ac.uk/handle/1810/294516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.782939.

MLA Handbook (7^{th} Edition):

Garrison, Erik. “Graphical pangenomics.” 2019. Web. 22 Jan 2020.

Vancouver:

Garrison E. Graphical pangenomics. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Jan 22]. Available from: https://www.repository.cam.ac.uk/handle/1810/294516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.782939.

Council of Science Editors:

Garrison E. Graphical pangenomics. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/294516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.782939

University of Johannesburg

26. Marcon, Alister Justin. Flows in networks : an algorithmic approach.

Degree: 2013, University of Johannesburg

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

►

M.Sc. (Mathematics)

In Chapter 1, we consider the relevant theory pertaining to graphs and digraphs that will be used in the study of flows in… (more)

Subjects/Keywords: Graph theory; Network analysis (Planning); Algorithms; Mathematical optimization; System analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Marcon, A. J. (2013). Flows in networks : an algorithmic approach. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/8364

Not specified: Masters Thesis or Doctoral Dissertation

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

Marcon, Alister Justin. “Flows in networks : an algorithmic approach.” 2013. Thesis, University of Johannesburg. Accessed January 22, 2020. http://hdl.handle.net/10210/8364.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Marcon, Alister Justin. “Flows in networks : an algorithmic approach.” 2013. Web. 22 Jan 2020.

Vancouver:

Marcon AJ. Flows in networks : an algorithmic approach. [Internet] [Thesis]. University of Johannesburg; 2013. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/10210/8364.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marcon AJ. Flows in networks : an algorithmic approach. [Thesis]. University of Johannesburg; 2013. Available from: http://hdl.handle.net/10210/8364

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

27.
Kabir, Humayun.
HIERARCHICAL SPARSE *GRAPH* COMPUTATIONS ON MULTICORE PLATFORMS.

Degree: 2018, Penn State University

URL: https://etda.libraries.psu.edu/catalog/15185hzk134

► *Graph* *analysis* is widely used to study connectivity, centrality, community and path *analysis* of social networks, biological networks, communication networks and any interacting objects that…
(more)

Subjects/Keywords: k-core; k-truss; multicore; sparse matrix; network analysis; graph analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kabir, H. (2018). HIERARCHICAL SPARSE GRAPH COMPUTATIONS ON MULTICORE PLATFORMS. (Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/15185hzk134

Not specified: Masters Thesis or Doctoral Dissertation

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

Kabir, Humayun. “HIERARCHICAL SPARSE GRAPH COMPUTATIONS ON MULTICORE PLATFORMS.” 2018. Thesis, Penn State University. Accessed January 22, 2020. https://etda.libraries.psu.edu/catalog/15185hzk134.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kabir, Humayun. “HIERARCHICAL SPARSE GRAPH COMPUTATIONS ON MULTICORE PLATFORMS.” 2018. Web. 22 Jan 2020.

Vancouver:

Kabir H. HIERARCHICAL SPARSE GRAPH COMPUTATIONS ON MULTICORE PLATFORMS. [Internet] [Thesis]. Penn State University; 2018. [cited 2020 Jan 22]. Available from: https://etda.libraries.psu.edu/catalog/15185hzk134.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kabir H. HIERARCHICAL SPARSE GRAPH COMPUTATIONS ON MULTICORE PLATFORMS. [Thesis]. Penn State University; 2018. Available from: https://etda.libraries.psu.edu/catalog/15185hzk134

Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

28.
Duffy, Edward.
The Design & Implementation of an Abstract Semantic *Graph* for Statement-Level Dynamic *Analysis* of C++ Applications.

Degree: PhD, Computer Science, 2011, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/832

► In this thesis, we describe our system, Hylian, for statement-level *analysis*, both static and dynamic, of a C++ application. We begin by extending the GNU…
(more)

Subjects/Keywords: Abstract semantic graph; Dynamic analysis; Programming languages; Semantic analysis; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duffy, E. (2011). The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/832

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

Duffy, Edward. “The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications.” 2011. Doctoral Dissertation, Clemson University. Accessed January 22, 2020. https://tigerprints.clemson.edu/all_dissertations/832.

MLA Handbook (7^{th} Edition):

Duffy, Edward. “The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications.” 2011. Web. 22 Jan 2020.

Vancouver:

Duffy E. The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2020 Jan 22]. Available from: https://tigerprints.clemson.edu/all_dissertations/832.

Council of Science Editors:

Duffy E. The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/832

University of Toronto

29. Miyani, Dhaval Ketan. BinPro: A Tool for Binary Backdoor Accountability in Code Audits.

Degree: 2016, University of Toronto

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

►

Highly security sensitive organizations often perform source code audits on software they use. However, after the audit is performed, they must still perform a binary… (more)

Subjects/Keywords: Backdoor; Computer Security; Graph Matching; Program Analysis; Static Analysis; 0464

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Miyani, D. K. (2016). BinPro: A Tool for Binary Backdoor Accountability in Code Audits. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/75812

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

Miyani, Dhaval Ketan. “BinPro: A Tool for Binary Backdoor Accountability in Code Audits.” 2016. Masters Thesis, University of Toronto. Accessed January 22, 2020. http://hdl.handle.net/1807/75812.

MLA Handbook (7^{th} Edition):

Miyani, Dhaval Ketan. “BinPro: A Tool for Binary Backdoor Accountability in Code Audits.” 2016. Web. 22 Jan 2020.

Vancouver:

Miyani DK. BinPro: A Tool for Binary Backdoor Accountability in Code Audits. [Internet] [Masters thesis]. University of Toronto; 2016. [cited 2020 Jan 22]. Available from: http://hdl.handle.net/1807/75812.

Council of Science Editors:

Miyani DK. BinPro: A Tool for Binary Backdoor Accountability in Code Audits. [Masters Thesis]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/75812

30. Girault, Benjamin. Signal Processing on Graphs - Contributions to an Emerging Field : Traitement du signal sur graphes - Contributions à un domaine émergent.

Degree: Docteur es, Informatique, 2015, Lyon, École normale supérieure

URL: http://www.theses.fr/2015ENSL1046

►

Ce manuscrit introduit dans une première partie le domaine du traitement du signal sur graphe en commençant par poser les bases d'algèbre linéaire et de… (more)

Subjects/Keywords: Traitement du signal sur graphe; Translation sur graphe; Analyse de graphe; Signaux sur graphe aléatoires; Stationarité; Graph signal processing; Graph translation; Graph analysis; Stochastic graph signals; Stationarity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Girault, B. (2015). Signal Processing on Graphs - Contributions to an Emerging Field : Traitement du signal sur graphes - Contributions à un domaine émergent. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2015ENSL1046

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

Girault, Benjamin. “Signal Processing on Graphs - Contributions to an Emerging Field : Traitement du signal sur graphes - Contributions à un domaine émergent.” 2015. Doctoral Dissertation, Lyon, École normale supérieure. Accessed January 22, 2020. http://www.theses.fr/2015ENSL1046.

MLA Handbook (7^{th} Edition):

Girault, Benjamin. “Signal Processing on Graphs - Contributions to an Emerging Field : Traitement du signal sur graphes - Contributions à un domaine émergent.” 2015. Web. 22 Jan 2020.

Vancouver:

Girault B. Signal Processing on Graphs - Contributions to an Emerging Field : Traitement du signal sur graphes - Contributions à un domaine émergent. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2015. [cited 2020 Jan 22]. Available from: http://www.theses.fr/2015ENSL1046.

Council of Science Editors:

Girault B. Signal Processing on Graphs - Contributions to an Emerging Field : Traitement du signal sur graphes - Contributions à un domaine émergent. [Doctoral Dissertation]. Lyon, École normale supérieure; 2015. Available from: http://www.theses.fr/2015ENSL1046