Advanced search options

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

You searched for `subject:(Graph structure)`

.
Showing records 1 – 30 of
94 total matches.

Search Limiters

Dates

- 2015 – 2019 (30)
- 2010 – 2014 (37)
- 2005 – 2009 (20)

▼ Search Limiters

Western Michigan University

1. Alqahtani, Mohra Abdullah Z. Generalized Line Graphs.

Degree: PhD, Mathematics, 2018, Western Michigan University

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

► With every nonempty *graph*, there are associated many graphs. One of the best known and most studied of these is the line *graph* L…
(more)

Subjects/Keywords: Generalized line graph; graph structure; derived graph; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alqahtani, M. A. Z. (2018). Generalized Line Graphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3348

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

Alqahtani, Mohra Abdullah Z. “Generalized Line Graphs.” 2018. Doctoral Dissertation, Western Michigan University. Accessed November 14, 2019. https://scholarworks.wmich.edu/dissertations/3348.

MLA Handbook (7^{th} Edition):

Alqahtani, Mohra Abdullah Z. “Generalized Line Graphs.” 2018. Web. 14 Nov 2019.

Vancouver:

Alqahtani MAZ. Generalized Line Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2018. [cited 2019 Nov 14]. Available from: https://scholarworks.wmich.edu/dissertations/3348.

Council of Science Editors:

Alqahtani MAZ. Generalized Line Graphs. [Doctoral Dissertation]. Western Michigan University; 2018. Available from: https://scholarworks.wmich.edu/dissertations/3348

Anna University

2. Senbagamalar J. On topological indices of Molecular graphs;.

Degree: On topological indices of Molecular graphs, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/33720

►

The representation of an object giving information only about the newlinenumber of elements composing it and their connectivity is named as newlinetopological representation of an… (more)

Subjects/Keywords: Molecular graph; quantitative structure activity relationships

Record Details Similar Records

❌

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

APA (6^{th} Edition):

J, S. (2015). On topological indices of Molecular graphs;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/33720

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

J, Senbagamalar. “On topological indices of Molecular graphs;.” 2015. Thesis, Anna University. Accessed November 14, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/33720.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

J, Senbagamalar. “On topological indices of Molecular graphs;.” 2015. Web. 14 Nov 2019.

Vancouver:

J S. On topological indices of Molecular graphs;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Nov 14]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33720.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

J S. On topological indices of Molecular graphs;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33720

Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

3.
Malik, Muhammad Zubair.
Combining data *structure* repair and program repair.

Degree: PhD, Electrical and Computer Engineering, 2014, University of Texas – Austin

URL: http://hdl.handle.net/2152/26034

► Bugs in code continue to pose a fundamental problem for software reliability and cause expensive failures. The process of removing known bugs is termed debugging,…
(more)

Subjects/Keywords: Program repair; Data Structure repair; Graph spectra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Malik, M. Z. (2014). Combining data structure repair and program repair. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/26034

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

Malik, Muhammad Zubair. “Combining data structure repair and program repair.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed November 14, 2019. http://hdl.handle.net/2152/26034.

MLA Handbook (7^{th} Edition):

Malik, Muhammad Zubair. “Combining data structure repair and program repair.” 2014. Web. 14 Nov 2019.

Vancouver:

Malik MZ. Combining data structure repair and program repair. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/2152/26034.

Council of Science Editors:

Malik MZ. Combining data structure repair and program repair. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/26034

Carnegie Mellon University

4. 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 November 14, 2019. 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. 14 Nov 2019.

Vancouver:

Kang U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. [Internet] [Thesis]. Carnegie Mellon University; 2012. [cited 2019 Nov 14]. 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

Linnaeus University

5. Badar, Muhammad. Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs.

Degree: Physics and Mathematics, 2010, Linnaeus University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6199

► Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combinatorics and some examples, Polya’s theorem and Burnside’s lemma arederived. The…
(more)

Subjects/Keywords: Generating function; Cycle index; Euler’s totient function; Unlabeled graph; Cycle structure; Non-isomorphic graph.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Badar, M. (2010). Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6199

Not specified: Masters Thesis or Doctoral Dissertation

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

Badar, Muhammad. “Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs.” 2010. Thesis, Linnaeus University. Accessed November 14, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6199.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Badar, Muhammad. “Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs.” 2010. Web. 14 Nov 2019.

Vancouver:

Badar M. Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs. [Internet] [Thesis]. Linnaeus University; 2010. [cited 2019 Nov 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6199.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Badar M. Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs. [Thesis]. Linnaeus University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6199

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

6. Huang, Zhibin. Computational search of RNA pseudoknots and structural variations in genomes.

Degree: PhD, Computer Science, 2011, University of Georgia

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

► Non-coding RNA (ncRNA) secondary structural homologs can be detected effectively in genomes based on a covariance model (CM) and associated dynamic programming algorithms. However, the…
(more)

Subjects/Keywords: ncRNA structure search; Sequence structure alignment; pseudoknot; ncRNA structure variation; RNA structure evolution; Graph tree decomposition; Dynamic Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, Z. (2011). Computational search of RNA pseudoknots and structural variations in genomes. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd

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

Huang, Zhibin. “Computational search of RNA pseudoknots and structural variations in genomes.” 2011. Doctoral Dissertation, University of Georgia. Accessed November 14, 2019. http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd.

MLA Handbook (7^{th} Edition):

Huang, Zhibin. “Computational search of RNA pseudoknots and structural variations in genomes.” 2011. Web. 14 Nov 2019.

Vancouver:

Huang Z. Computational search of RNA pseudoknots and structural variations in genomes. [Internet] [Doctoral dissertation]. University of Georgia; 2011. [cited 2019 Nov 14]. Available from: http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd.

Council of Science Editors:

Huang Z. Computational search of RNA pseudoknots and structural variations in genomes. [Doctoral Dissertation]. University of Georgia; 2011. Available from: http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd

Penn State University

7.
Yuan, Dayu.
Mining and indexing *graph* databases.

Degree: PhD, Computer Science and Engineering, 2013, Penn State University

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

► Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional…
(more)

Subjects/Keywords: data mining; graph database; query processing; index structure; information retrieval

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yuan, D. (2013). Mining and indexing graph databases. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/19880

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

Yuan, Dayu. “Mining and indexing graph databases.” 2013. Doctoral Dissertation, Penn State University. Accessed November 14, 2019. https://etda.libraries.psu.edu/catalog/19880.

MLA Handbook (7^{th} Edition):

Yuan, Dayu. “Mining and indexing graph databases.” 2013. Web. 14 Nov 2019.

Vancouver:

Yuan D. Mining and indexing graph databases. [Internet] [Doctoral dissertation]. Penn State University; 2013. [cited 2019 Nov 14]. Available from: https://etda.libraries.psu.edu/catalog/19880.

Council of Science Editors:

Yuan D. Mining and indexing graph databases. [Doctoral Dissertation]. Penn State University; 2013. Available from: https://etda.libraries.psu.edu/catalog/19880

University of California – San Diego

8.
Moeller, Daniel Paul.
Exploiting *Structure* in the Stable Matching Problem.

Degree: Computer Science, 2016, University of California – San Diego

URL: http://www.escholarship.org/uc/item/6f80v7jc

► Stable matching is a widely studied problem in social choice theory. For the basiccentralized case, an optimal quadratic time algorithm is known. However, we presentseveral…
(more)

Subjects/Keywords: Computer science; Complexity; Decentralized; Jealousy Graph; Stable Matching; Structure; Succinct

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Moeller, D. P. (2016). Exploiting Structure in the Stable Matching Problem. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/6f80v7jc

Not specified: Masters Thesis or Doctoral Dissertation

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

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Thesis, University of California – San Diego. Accessed November 14, 2019. http://www.escholarship.org/uc/item/6f80v7jc.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Web. 14 Nov 2019.

Vancouver:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2019 Nov 14]. Available from: http://www.escholarship.org/uc/item/6f80v7jc.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/6f80v7jc

Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

9. Wu, Xiaojian. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.

Degree: MS, Computer Science and Engineering, 2010, Mississippi State University

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

► Bayesian network is a popular machine learning tool for modeling uncertain dependence relationships among the random factors of a domain. It represents the relations…
(more)

Subjects/Keywords: Dynamic Programming; Heursitic Search; Structure Learning; Directed Acyclic Graph; Bayesian Network

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, X. (2010). A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;

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

Wu, Xiaojian. “A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.” 2010. Masters Thesis, Mississippi State University. Accessed November 14, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;.

MLA Handbook (7^{th} Edition):

Wu, Xiaojian. “A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.” 2010. Web. 14 Nov 2019.

Vancouver:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Internet] [Masters thesis]. Mississippi State University; 2010. [cited 2019 Nov 14]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;.

Council of Science Editors:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Masters Thesis]. Mississippi State University; 2010. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;

Kansas State University

10.
Clemens, Jason.
Spanning tree
modulus: deflation and a hierarchical *graph* * structure*.

Degree: PhD, Department of Mathematics, 2018, Kansas State University

URL: http://hdl.handle.net/2097/39115

► The concept of discrete p-modulus provides a general framework for understanding arbitrary families of objects on a *graph*. The p-modulus provides a sense of ``*structure*''…
(more)

Subjects/Keywords: Modulus; Spanning tree; Minimum spanning trees; Graph structure; Greedy algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Clemens, J. (2018). Spanning tree modulus: deflation and a hierarchical graph structure. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39115

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

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Doctoral Dissertation, Kansas State University. Accessed November 14, 2019. http://hdl.handle.net/2097/39115.

MLA Handbook (7^{th} Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Web. 14 Nov 2019.

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/2097/39115.

Council of Science Editors:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Doctoral Dissertation]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/39115

North Carolina State University

11.
Chen, Kunsheng.
An open solution to discover the *graph* *structure* of World Wide Web.

Degree: MS, Computer Science, 2009, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/1176

► The World Wide Web is a large complex network of inter-linked web pages. Understanding this *structure* is of immense benefit both economically and socially. Currently,…
(more)

Subjects/Keywords: graph structure of World Wide Web; distributed web crawler

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, K. (2009). An open solution to discover the graph structure of World Wide Web. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1176

Not specified: Masters Thesis or Doctoral Dissertation

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

Chen, Kunsheng. “An open solution to discover the graph structure of World Wide Web.” 2009. Thesis, North Carolina State University. Accessed November 14, 2019. http://www.lib.ncsu.edu/resolver/1840.16/1176.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Kunsheng. “An open solution to discover the graph structure of World Wide Web.” 2009. Web. 14 Nov 2019.

Vancouver:

Chen K. An open solution to discover the graph structure of World Wide Web. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2019 Nov 14]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1176.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen K. An open solution to discover the graph structure of World Wide Web. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1176

Not specified: Masters Thesis or Doctoral Dissertation

University of New South Wales

12. Kwok, Eric. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.

Degree: Mathematics & Statistics, 2018, University of New South Wales

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

► Transport and mixing in dynamical systems are important properties for many physical, chemical, biological, and engineering processes. The detection of transport barriers for dynamics with…
(more)

Subjects/Keywords: Lagrangian coherent structure; Dynamic; Isoperimetry; Weighted manifold; Graph; Manifold learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kwok, E. (2018). Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true

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

Kwok, Eric. “Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.” 2018. Doctoral Dissertation, University of New South Wales. Accessed November 14, 2019. http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Kwok, Eric. “Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.” 2018. Web. 14 Nov 2019.

Vancouver:

Kwok E. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2019 Nov 14]. Available from: http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true.

Council of Science Editors:

Kwok E. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true

Purdue University

13.
Huang, Jiajie.
Graphical methods in RNA *structure* matching.

Degree: PhD, PULSe, 2016, Purdue University

URL: https://docs.lib.purdue.edu/open_access_dissertations/773

► Eukaryotic genomes are pervasively transcribed; almost every base can be found in an RNA transcript. This is a surprising observation since most of the…
(more)

Subjects/Keywords: Biological sciences; Graph matching; RNA structure; Bioinformatics; Biology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, J. (2016). Graphical methods in RNA structure matching. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/773

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

Huang, Jiajie. “Graphical methods in RNA structure matching.” 2016. Doctoral Dissertation, Purdue University. Accessed November 14, 2019. https://docs.lib.purdue.edu/open_access_dissertations/773.

MLA Handbook (7^{th} Edition):

Huang, Jiajie. “Graphical methods in RNA structure matching.” 2016. Web. 14 Nov 2019.

Vancouver:

Huang J. Graphical methods in RNA structure matching. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2019 Nov 14]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/773.

Council of Science Editors:

Huang J. Graphical methods in RNA structure matching. [Doctoral Dissertation]. Purdue University; 2016. Available from: https://docs.lib.purdue.edu/open_access_dissertations/773

University of New Orleans

14.
Maus, Aaron.
Formulation of Hybrid Knowledge-Based/Molecular Mechanics Potentials for Protein *Structure* Refinement and a Novel *Graph* Theoretical Protein *Structure* Comparison and Analysis Technique.

Degree: PhD, Computer Science, 2019, University of New Orleans

URL: https://scholarworks.uno.edu/td/2673

► Proteins are the fundamental machinery that enables the functions of life. It is critical to understand them not just for basic biology, but also…
(more)

Subjects/Keywords: Bioinformatics; Protein Structure Prediction; Protein Structure Refinement; Statistical Energy Functions; Protein Structure Comparison; Graph Analysis; Bioinformatics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maus, A. (2019). Formulation of Hybrid Knowledge-Based/Molecular Mechanics Potentials for Protein Structure Refinement and a Novel Graph Theoretical Protein Structure Comparison and Analysis Technique. (Doctoral Dissertation). University of New Orleans. Retrieved from https://scholarworks.uno.edu/td/2673

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

Maus, Aaron. “Formulation of Hybrid Knowledge-Based/Molecular Mechanics Potentials for Protein Structure Refinement and a Novel Graph Theoretical Protein Structure Comparison and Analysis Technique.” 2019. Doctoral Dissertation, University of New Orleans. Accessed November 14, 2019. https://scholarworks.uno.edu/td/2673.

MLA Handbook (7^{th} Edition):

Maus, Aaron. “Formulation of Hybrid Knowledge-Based/Molecular Mechanics Potentials for Protein Structure Refinement and a Novel Graph Theoretical Protein Structure Comparison and Analysis Technique.” 2019. Web. 14 Nov 2019.

Vancouver:

Maus A. Formulation of Hybrid Knowledge-Based/Molecular Mechanics Potentials for Protein Structure Refinement and a Novel Graph Theoretical Protein Structure Comparison and Analysis Technique. [Internet] [Doctoral dissertation]. University of New Orleans; 2019. [cited 2019 Nov 14]. Available from: https://scholarworks.uno.edu/td/2673.

Council of Science Editors:

Maus A. Formulation of Hybrid Knowledge-Based/Molecular Mechanics Potentials for Protein Structure Refinement and a Novel Graph Theoretical Protein Structure Comparison and Analysis Technique. [Doctoral Dissertation]. University of New Orleans; 2019. Available from: https://scholarworks.uno.edu/td/2673

KTH

15.
Josefsson, Lovisa.
* Graph* Visualization of Legal Business Structures.

Degree: Electrical Engineering and Computer Science (EECS), 2019, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254654

►

Visualization of complex data is a challenging topic. Data are often stored in spreadsheets making it difficult to get an overview of otherwise inaccessible… (more)

Subjects/Keywords: Graph Visualization; Network Visualization; Legal Business Structure; Corporate Structure; Legal Structure; Contract Structure; Agreement Structure; Grafvisualisering; Näterksvisualisering; Legal Affärsstruktur; Företagsstruktur; Legal Struktur; Kontraktsstruktur; Computer and Information Sciences; Data- och informationsvetenskap

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Josefsson, L. (2019). Graph Visualization of Legal Business Structures. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254654

Not specified: Masters Thesis or Doctoral Dissertation

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

Josefsson, Lovisa. “Graph Visualization of Legal Business Structures.” 2019. Thesis, KTH. Accessed November 14, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254654.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Josefsson, Lovisa. “Graph Visualization of Legal Business Structures.” 2019. Web. 14 Nov 2019.

Vancouver:

Josefsson L. Graph Visualization of Legal Business Structures. [Internet] [Thesis]. KTH; 2019. [cited 2019 Nov 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254654.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Josefsson L. Graph Visualization of Legal Business Structures. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254654

Not specified: Masters Thesis or Doctoral Dissertation

Queensland University of Technology

16. He, Hu. Joint 2D and 3D cues for image segmentation towards robotic applications.

Degree: 2014, Queensland University of Technology

URL: https://eprints.qut.edu.au/71760/

► This thesis investigates the fusion of 3D visual information with 2D image cues to provide 3D semantic maps of large-scale environments in which a robot…
(more)

Subjects/Keywords: Image Segmentation; Computer Vision; Robotics; Structure from Motion; Markov Random Fields; Graph Cut; Energy Minimisation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

He, H. (2014). Joint 2D and 3D cues for image segmentation towards robotic applications. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/71760/

Not specified: Masters Thesis or Doctoral Dissertation

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

He, Hu. “Joint 2D and 3D cues for image segmentation towards robotic applications.” 2014. Thesis, Queensland University of Technology. Accessed November 14, 2019. https://eprints.qut.edu.au/71760/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

He, Hu. “Joint 2D and 3D cues for image segmentation towards robotic applications.” 2014. Web. 14 Nov 2019.

Vancouver:

He H. Joint 2D and 3D cues for image segmentation towards robotic applications. [Internet] [Thesis]. Queensland University of Technology; 2014. [cited 2019 Nov 14]. Available from: https://eprints.qut.edu.au/71760/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

He H. Joint 2D and 3D cues for image segmentation towards robotic applications. [Thesis]. Queensland University of Technology; 2014. Available from: https://eprints.qut.edu.au/71760/

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

17. Hidaka, Yukikazu. Computational model of stroke therapy and long term recovery.

Degree: PhD, Computer Science, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1546

► Understanding the effects of task practice on the long term recovery of arm function post-stroke could allow effective motor training at a reduced cost. There…
(more)

Subjects/Keywords: Bayesian regression; computational model; graph structure learning; machine learning; stroke rehabilitation; task specific training

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hidaka, Y. (2013). Computational model of stroke therapy and long term recovery. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1546

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

Hidaka, Yukikazu. “Computational model of stroke therapy and long term recovery.” 2013. Doctoral Dissertation, University of Southern California. Accessed November 14, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1546.

MLA Handbook (7^{th} Edition):

Hidaka, Yukikazu. “Computational model of stroke therapy and long term recovery.” 2013. Web. 14 Nov 2019.

Vancouver:

Hidaka Y. Computational model of stroke therapy and long term recovery. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2019 Nov 14]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1546.

Council of Science Editors:

Hidaka Y. Computational model of stroke therapy and long term recovery. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1546

18. Kelz, Justin M. A Walk Through Quaternionic Structures.

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

URL: http://www.escholarship.org/uc/item/31w4d6tr

► In 1980, Murray Marshall proved that the category of Quaternionic Structures is naturally equivalent to the category of abstract Witt rings. This paper develops a…
(more)

Subjects/Keywords: Mathematics; Abstract Witt Ring; Combinatorics; Graph Theory; Quaternionic Structure; Steiner Triple System; Witt Ring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kelz, J. M. (2016). A Walk Through Quaternionic Structures. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/31w4d6tr

Not specified: Masters Thesis or Doctoral Dissertation

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

Kelz, Justin M. “A Walk Through Quaternionic Structures.” 2016. Thesis, University of California – eScholarship, University of California. Accessed November 14, 2019. http://www.escholarship.org/uc/item/31w4d6tr.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kelz, Justin M. “A Walk Through Quaternionic Structures.” 2016. Web. 14 Nov 2019.

Vancouver:

Kelz JM. A Walk Through Quaternionic Structures. [Internet] [Thesis]. University of California – eScholarship, University of California; 2016. [cited 2019 Nov 14]. Available from: http://www.escholarship.org/uc/item/31w4d6tr.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kelz JM. A Walk Through Quaternionic Structures. [Thesis]. University of California – eScholarship, University of California; 2016. Available from: http://www.escholarship.org/uc/item/31w4d6tr

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

19.
Chui, Carmen Stephanie.
A Molecular *Structure* Ontology for Medicinal Chemistry.

Degree: PhD, 2019, University of Toronto

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

► The field of medicinal chemistry involves the design, synthesis, and development of new drugs that can be further enhanced with the application of ontologies. This…
(more)

Subjects/Keywords: graph theory; knowledge representation; medicinal chemistry; molecular structure; ontologies; ontology engineering; 0546

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chui, C. S. (2019). A Molecular Structure Ontology for Medicinal Chemistry. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/97001

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

Chui, Carmen Stephanie. “A Molecular Structure Ontology for Medicinal Chemistry.” 2019. Doctoral Dissertation, University of Toronto. Accessed November 14, 2019. http://hdl.handle.net/1807/97001.

MLA Handbook (7^{th} Edition):

Chui, Carmen Stephanie. “A Molecular Structure Ontology for Medicinal Chemistry.” 2019. Web. 14 Nov 2019.

Vancouver:

Chui CS. A Molecular Structure Ontology for Medicinal Chemistry. [Internet] [Doctoral dissertation]. University of Toronto; 2019. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1807/97001.

Council of Science Editors:

Chui CS. A Molecular Structure Ontology for Medicinal Chemistry. [Doctoral Dissertation]. University of Toronto; 2019. Available from: http://hdl.handle.net/1807/97001

University of Cincinnati

20. Sardana, Divya. Analysis of Meso-scale Structures in Weighted Graphs.

Degree: PhD, Engineering and Applied Science: Computer Science and Engineering, 2017, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038

► Many real world systems across multiple disciplines, like social, biologicaland information networks can be described as complex networks,i.e., assemblies of nodes and edges having nontrivial…
(more)

Subjects/Keywords: Computer Science; community structure; core periphery structure; graph clustering; protein protein interaction networks; semi supervised clustering; overlapping clustering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sardana, D. (2017). Analysis of Meso-scale Structures in Weighted Graphs. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038

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

Sardana, Divya. “Analysis of Meso-scale Structures in Weighted Graphs.” 2017. Doctoral Dissertation, University of Cincinnati. Accessed November 14, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038.

MLA Handbook (7^{th} Edition):

Sardana, Divya. “Analysis of Meso-scale Structures in Weighted Graphs.” 2017. Web. 14 Nov 2019.

Vancouver:

Sardana D. Analysis of Meso-scale Structures in Weighted Graphs. [Internet] [Doctoral dissertation]. University of Cincinnati; 2017. [cited 2019 Nov 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038.

Council of Science Editors:

Sardana D. Analysis of Meso-scale Structures in Weighted Graphs. [Doctoral Dissertation]. University of Cincinnati; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038

21.
Al Nasr, Kamal H.
De Novo Protein *Structure* Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary *Structure* Topology * Graph*.

Degree: PhD, Computer Science, 2012, Old Dominion University

URL: 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45

► Proteins are the molecules carry out the vital functions and make more than the half of dry weight in every cell. Protein in nature…
(more)

Subjects/Keywords: Cryoem; De novo proteins; Protein structure modeling; Digital mapping; Secondary structure topology graph; Bioinformatics; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Al Nasr, K. H. (2012). De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45

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

Al Nasr, Kamal H. “De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph.” 2012. Doctoral Dissertation, Old Dominion University. Accessed November 14, 2019. 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45.

MLA Handbook (7^{th} Edition):

Al Nasr, Kamal H. “De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph.” 2012. Web. 14 Nov 2019.

Vancouver:

Al Nasr KH. De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph. [Internet] [Doctoral dissertation]. Old Dominion University; 2012. [cited 2019 Nov 14]. Available from: 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45.

Council of Science Editors:

Al Nasr KH. De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph. [Doctoral Dissertation]. Old Dominion University; 2012. Available from: 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45

Indian Institute of Science

22.
Bhattacharya, Sourangshu.
Computational Protein *Structure* Analysis : Kernel And Spectral Methods.

Degree: 2008, Indian Institute of Science

URL: http://hdl.handle.net/2005/831

► The focus of this thesis is to develop computational techniques for analysis of protein structures. We model protein structures as points in 3-dimensional space which…
(more)

Subjects/Keywords: Protein - Structure; Protein Structure - Data Processing; Protein Structure Alignment; Kernel Method; Structural Bioinformatics; Spectral Graph Theory; Machine Learning; Neighborhood Alignments; Structural Alignment; Protein Structure Classification; Bioinformatics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhattacharya, S. (2008). Computational Protein Structure Analysis : Kernel And Spectral Methods. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/831

Not specified: Masters Thesis or Doctoral Dissertation

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

Bhattacharya, Sourangshu. “Computational Protein Structure Analysis : Kernel And Spectral Methods.” 2008. Thesis, Indian Institute of Science. Accessed November 14, 2019. http://hdl.handle.net/2005/831.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bhattacharya, Sourangshu. “Computational Protein Structure Analysis : Kernel And Spectral Methods.” 2008. Web. 14 Nov 2019.

Vancouver:

Bhattacharya S. Computational Protein Structure Analysis : Kernel And Spectral Methods. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/2005/831.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bhattacharya S. Computational Protein Structure Analysis : Kernel And Spectral Methods. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/831

Not specified: Masters Thesis or Doctoral Dissertation

23. Schaeffer, Satu Elisa. Algorithms for Nonuniform Networks.

Degree: 2006, Helsinki University of Technology

URL: http://lib.tkk.fi/Diss/2006/isbn9512281198/

►

In this thesis, observations on structural properties of natural networks are taken as a starting point for developing efficient algorithms for natural instances of different… (more)

Subjects/Keywords: community structure; graph algorithm; graph clustering; graph data mining; graph similarity; local search; minimum spanning tree; network model; nonuniform network; random graph; random sampling; routing; scale-free network; shortest path algorithm; small-world network

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schaeffer, S. E. (2006). Algorithms for Nonuniform Networks. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512281198/

Not specified: Masters Thesis or Doctoral Dissertation

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

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Thesis, Helsinki University of Technology. Accessed November 14, 2019. http://lib.tkk.fi/Diss/2006/isbn9512281198/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 14 Nov 2019.

Vancouver:

Schaeffer SE. Algorithms for Nonuniform Networks. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2019 Nov 14]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schaeffer SE. Algorithms for Nonuniform Networks. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/

Not specified: Masters Thesis or Doctoral Dissertation

East Tennessee State University

24.
Koessler, Denise Renee.
A Predictive Model for Secondary RNA *Structure* Using *Graph* Theory and a Neural Network.

Degree: MS, Mathematical Sciences, 2010, East Tennessee State University

URL: https://dc.etsu.edu/etd/1684

► In this work we use a *graph*-theoretic representation of secondary RNA *structure* found in the database RAG: RNA-As-Graphs. We model the bonding of two…
(more)

Subjects/Keywords: graph theory; artificial neural network; graph models; math modeling; secondary RNA; RNA structure; RNA as Graphs; RNA; tree graph; application of graph theory; vertex identification; merge; predictive model; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Koessler, D. R. (2010). A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1684

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

Koessler, Denise Renee. “A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.” 2010. Masters Thesis, East Tennessee State University. Accessed November 14, 2019. https://dc.etsu.edu/etd/1684.

MLA Handbook (7^{th} Edition):

Koessler, Denise Renee. “A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.” 2010. Web. 14 Nov 2019.

Vancouver:

Koessler DR. A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. [Internet] [Masters thesis]. East Tennessee State University; 2010. [cited 2019 Nov 14]. Available from: https://dc.etsu.edu/etd/1684.

Council of Science Editors:

Koessler DR. A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. [Masters Thesis]. East Tennessee State University; 2010. Available from: https://dc.etsu.edu/etd/1684

University of Saskatchewan

25.
He, Peiren.
A general computational tool for *structure* synthesis.

Degree: 2003, University of Saskatchewan

URL: http://hdl.handle.net/10388/etd-10062008-104305

► Synthesis of structures is a very difficult task even with only a small number of components that form a system; yet it is the catalyst…
(more)

Subjects/Keywords: structure synthesis; graph isomorphism; graph automorphism; eigenvector; eigenvalue; canonical labeling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

He, P. (2003). A general computational tool for structure synthesis. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-10062008-104305

Not specified: Masters Thesis or Doctoral Dissertation

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

He, Peiren. “A general computational tool for structure synthesis.” 2003. Thesis, University of Saskatchewan. Accessed November 14, 2019. http://hdl.handle.net/10388/etd-10062008-104305.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

He, Peiren. “A general computational tool for structure synthesis.” 2003. Web. 14 Nov 2019.

Vancouver:

He P. A general computational tool for structure synthesis. [Internet] [Thesis]. University of Saskatchewan; 2003. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10388/etd-10062008-104305.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

He P. A general computational tool for structure synthesis. [Thesis]. University of Saskatchewan; 2003. Available from: http://hdl.handle.net/10388/etd-10062008-104305

Not specified: Masters Thesis or Doctoral Dissertation

Linnaeus University

26. Maryokhin, Tymur. Data dissemination in large-cardinality social graphs.

Degree: Computer Science, 2015, Linnaeus University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268

► Near real-time event streams are a key feature in many popular social media applications. These types of applications allow users to selectively follow event…
(more)

Subjects/Keywords: Data dissemination; message delivery; social graph; big data; large scale; feed following; materialized views; social network analysis; community structure detection; graph theory; database theory.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maryokhin, T. (2015). Data dissemination in large-cardinality social graphs. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268

Not specified: Masters Thesis or Doctoral Dissertation

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

Maryokhin, Tymur. “Data dissemination in large-cardinality social graphs.” 2015. Thesis, Linnaeus University. Accessed November 14, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Maryokhin, Tymur. “Data dissemination in large-cardinality social graphs.” 2015. Web. 14 Nov 2019.

Vancouver:

Maryokhin T. Data dissemination in large-cardinality social graphs. [Internet] [Thesis]. Linnaeus University; 2015. [cited 2019 Nov 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maryokhin T. Data dissemination in large-cardinality social graphs. [Thesis]. Linnaeus University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268

Not specified: Masters Thesis or Doctoral Dissertation

27. Boas, Paulino Ribeiro Villas. Efeito da amostragem nas propriedades topológicas de redes complexas.

Degree: PhD, Física Aplicada, 2008, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;

►

Muitos sistemas complexos naturais ou construídos pelos seres humanos podem ser representados por redes complexas, uma teoria que une o estudo de grafos com a… (more)

Subjects/Keywords: Amostragem; Complex networks; Estrutura topológica; Grafos; Graph; Incompleteza; Incompletness; Measurements; Medidas; Redes complexas; Sampling; Topological structure

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boas, P. R. V. (2008). Efeito da amostragem nas propriedades topológicas de redes complexas. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;

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

Boas, Paulino Ribeiro Villas. “Efeito da amostragem nas propriedades topológicas de redes complexas.” 2008. Doctoral Dissertation, University of São Paulo. Accessed November 14, 2019. http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;.

MLA Handbook (7^{th} Edition):

Boas, Paulino Ribeiro Villas. “Efeito da amostragem nas propriedades topológicas de redes complexas.” 2008. Web. 14 Nov 2019.

Vancouver:

Boas PRV. Efeito da amostragem nas propriedades topológicas de redes complexas. [Internet] [Doctoral dissertation]. University of São Paulo; 2008. [cited 2019 Nov 14]. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;.

Council of Science Editors:

Boas PRV. Efeito da amostragem nas propriedades topológicas de redes complexas. [Doctoral Dissertation]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;

28. Soares, Telma Woerle de Lima. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes.

Degree: PhD, Ciências de Computação e Matemática Computacional, 2009, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;

►

Problemas de projeto de redes (PPRs) são muito importantes uma vez que envolvem uma série de aplicações em áreas da engenharia e ciências. Para solucionar… (more)

Subjects/Keywords: Algoritmos evolutivos; Data structure; Estutura de dados; Evolutionary algorithms; Graph representations; Networks design; Projeto de redes; Representações de grafos

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Soares, T. W. d. L. (2009). Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;

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

Soares, Telma Woerle de Lima. “Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes.” 2009. Doctoral Dissertation, University of São Paulo. Accessed November 14, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;.

MLA Handbook (7^{th} Edition):

Soares, Telma Woerle de Lima. “Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes.” 2009. Web. 14 Nov 2019.

Vancouver:

Soares TWdL. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes. [Internet] [Doctoral dissertation]. University of São Paulo; 2009. [cited 2019 Nov 14]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;.

Council of Science Editors:

Soares TWdL. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes. [Doctoral Dissertation]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;

Durham University

29.
Hofton, Antony Edward.
* Graph* layout using subgraph isomorphisms.

Degree: PhD, 2000, Durham University

URL: http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781

► Today, graphs are used for many things. In engineering, graphs are used to design circuits in very large scale integration. In computer science, graphs are…
(more)

Subjects/Keywords: 005; ANHOF; Call graph; Data flow; Structure

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hofton, A. E. (2000). Graph layout using subgraph isomorphisms. (Doctoral Dissertation). Durham University. Retrieved from http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781

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

Hofton, Antony Edward. “Graph layout using subgraph isomorphisms.” 2000. Doctoral Dissertation, Durham University. Accessed November 14, 2019. http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781.

MLA Handbook (7^{th} Edition):

Hofton, Antony Edward. “Graph layout using subgraph isomorphisms.” 2000. Web. 14 Nov 2019.

Vancouver:

Hofton AE. Graph layout using subgraph isomorphisms. [Internet] [Doctoral dissertation]. Durham University; 2000. [cited 2019 Nov 14]. Available from: http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781.

Council of Science Editors:

Hofton AE. Graph layout using subgraph isomorphisms. [Doctoral Dissertation]. Durham University; 2000. Available from: http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781

Case Western Reserve University

30.
Henderson, Robert Vann.
A *graph* theory-based 'expert system' methodology for
*structure*-activity studies.

Degree: PhD, Chemistry, 1992, Case Western Reserve University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337

► A new *graph* theory-based methodology is proposed for the statistical evaluation of the link between the *structure* and the chemical/biological activity of organic molecules. The…
(more)

Subjects/Keywords: graph theory-based 'expert system' methodology structure-activity studies

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Henderson, R. V. (1992). A graph theory-based 'expert system' methodology for structure-activity studies. (Doctoral Dissertation). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337

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

Henderson, Robert Vann. “A graph theory-based 'expert system' methodology for structure-activity studies.” 1992. Doctoral Dissertation, Case Western Reserve University. Accessed November 14, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337.

MLA Handbook (7^{th} Edition):

Henderson, Robert Vann. “A graph theory-based 'expert system' methodology for structure-activity studies.” 1992. Web. 14 Nov 2019.

Vancouver:

Henderson RV. A graph theory-based 'expert system' methodology for structure-activity studies. [Internet] [Doctoral dissertation]. Case Western Reserve University; 1992. [cited 2019 Nov 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337.

Council of Science Editors:

Henderson RV. A graph theory-based 'expert system' methodology for structure-activity studies. [Doctoral Dissertation]. Case Western Reserve University; 1992. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337