Advanced search options

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

You searched for `subject:(Computational graph)`

.
Showing records 1 – 30 of
116 total matches.

Search Limiters

Dates

- 2016 – 2020 (47)
- 2011 – 2015 (50)
- 2006 – 2010 (19)

▼ Search Limiters

Duquesne University

1.
Guyer, Michael.
Common Techniques in Graceful Tree Labeling with a New *Computational* Approach.

Degree: MS, Computational Mathematics, 2016, Duquesne University

URL: https://dsc.duq.edu/etd/609

► The graceful tree conjecture was first introduced over 50 years ago, and to this day it remains largely unresolved. Ideas for how to label arbitrary…
(more)

Subjects/Keywords: Computational; Expansion; Graceful Labeling; Graph Theory; Tree

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Guyer, M. (2016). Common Techniques in Graceful Tree Labeling with a New Computational Approach. (Masters Thesis). Duquesne University. Retrieved from https://dsc.duq.edu/etd/609

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

Guyer, Michael. “Common Techniques in Graceful Tree Labeling with a New Computational Approach.” 2016. Masters Thesis, Duquesne University. Accessed November 30, 2020. https://dsc.duq.edu/etd/609.

MLA Handbook (7^{th} Edition):

Guyer, Michael. “Common Techniques in Graceful Tree Labeling with a New Computational Approach.” 2016. Web. 30 Nov 2020.

Vancouver:

Guyer M. Common Techniques in Graceful Tree Labeling with a New Computational Approach. [Internet] [Masters thesis]. Duquesne University; 2016. [cited 2020 Nov 30]. Available from: https://dsc.duq.edu/etd/609.

Council of Science Editors:

Guyer M. Common Techniques in Graceful Tree Labeling with a New Computational Approach. [Masters Thesis]. Duquesne University; 2016. Available from: https://dsc.duq.edu/etd/609

California State University – Sacramento

2.
Meyer, Andrew George.
Canonical forms, over-coloring, and polytime *graph* isomorphism.

Degree: MS, Computer Science, 2019, California State University – Sacramento

URL: http://hdl.handle.net/10211.3/213411

► The question of *Graph* Isomorphism's (GI) true time complexity classification has remained a mystery for years. It is certainly in NP but uncertain whether or…
(more)

Subjects/Keywords: Symmetric groups; Graph matching; Computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Meyer, A. G. (2019). Canonical forms, over-coloring, and polytime graph isomorphism. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/213411

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

Meyer, Andrew George. “Canonical forms, over-coloring, and polytime graph isomorphism.” 2019. Masters Thesis, California State University – Sacramento. Accessed November 30, 2020. http://hdl.handle.net/10211.3/213411.

MLA Handbook (7^{th} Edition):

Meyer, Andrew George. “Canonical forms, over-coloring, and polytime graph isomorphism.” 2019. Web. 30 Nov 2020.

Vancouver:

Meyer AG. Canonical forms, over-coloring, and polytime graph isomorphism. [Internet] [Masters thesis]. California State University – Sacramento; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10211.3/213411.

Council of Science Editors:

Meyer AG. Canonical forms, over-coloring, and polytime graph isomorphism. [Masters Thesis]. California State University – Sacramento; 2019. Available from: http://hdl.handle.net/10211.3/213411

University of Manchester

3. Aubad, Ali Abd Aubad. On Commuting Involution Graphs of Certain Finite Groups.

Degree: 2017, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:311689

'See full text for abstract.'

CD-ROM contains ( Electronic files associated to this thesis which are all set up in Magma format)

Subjects/Keywords: Group Theory; Graph Theory; Computational Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aubad, A. A. A. (2017). On Commuting Involution Graphs of Certain Finite Groups. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:311689

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

Aubad, Ali Abd Aubad. “On Commuting Involution Graphs of Certain Finite Groups.” 2017. Doctoral Dissertation, University of Manchester. Accessed November 30, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:311689.

MLA Handbook (7^{th} Edition):

Aubad, Ali Abd Aubad. “On Commuting Involution Graphs of Certain Finite Groups.” 2017. Web. 30 Nov 2020.

Vancouver:

Aubad AAA. On Commuting Involution Graphs of Certain Finite Groups. [Internet] [Doctoral dissertation]. University of Manchester; 2017. [cited 2020 Nov 30]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:311689.

Council of Science Editors:

Aubad AAA. On Commuting Involution Graphs of Certain Finite Groups. [Doctoral Dissertation]. University of Manchester; 2017. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:311689

University of Oxford

4.
Magkakis, Andreas Gkompel.
Counting, modular counting and *graph* homomorphisms.

Degree: PhD, 2016, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929

► A homomorphism from a *graph* G to a *graph* H is a function from V (G) to V (H) that preserves edges. Many combinatorial structures…
(more)

Subjects/Keywords: 511; Computer science; evolutionary dynamics; graph homomorphisms; computational complexity; computational counting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Magkakis, A. G. (2016). Counting, modular counting and graph homomorphisms. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929

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

Magkakis, Andreas Gkompel. “Counting, modular counting and graph homomorphisms.” 2016. Doctoral Dissertation, University of Oxford. Accessed November 30, 2020. http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929.

MLA Handbook (7^{th} Edition):

Magkakis, Andreas Gkompel. “Counting, modular counting and graph homomorphisms.” 2016. Web. 30 Nov 2020.

Vancouver:

Magkakis AG. Counting, modular counting and graph homomorphisms. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2020 Nov 30]. Available from: http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929.

Council of Science Editors:

Magkakis AG. Counting, modular counting and graph homomorphisms. [Doctoral Dissertation]. University of Oxford; 2016. Available from: http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929

Washington State University

5.
[No author].
Parallel Algorithms for Large-scale *Computational* Metagenomics
.

Degree: 2011, Washington State University

URL: http://hdl.handle.net/2376/2889

► Developing high performance computing solutions for modern day biological problems present a unique set of challenges. The field is experiencing a data revolution due to…
(more)

Subjects/Keywords: Computer Science; Bioinformatics; Bioinformatics; Computational Biology; Graph Algorithms; Graph Construction; High Performance Computing; Sequence Clustering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2011). Parallel Algorithms for Large-scale Computational Metagenomics . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/2889

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

author], [No. “Parallel Algorithms for Large-scale Computational Metagenomics .” 2011. Thesis, Washington State University. Accessed November 30, 2020. http://hdl.handle.net/2376/2889.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Parallel Algorithms for Large-scale Computational Metagenomics .” 2011. Web. 30 Nov 2020.

Vancouver:

author] [. Parallel Algorithms for Large-scale Computational Metagenomics . [Internet] [Thesis]. Washington State University; 2011. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2376/2889.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Parallel Algorithms for Large-scale Computational Metagenomics . [Thesis]. Washington State University; 2011. Available from: http://hdl.handle.net/2376/2889

Not specified: Masters Thesis or Doctoral Dissertation

East Tennessee State University

6.
Witt, Walter G.
Quantifying the Structure of Misfolded Proteins Using *Graph* Theory.

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

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

► The structure of a protein molecule is highly correlated to its function. Some diseases such as cystic fibrosis are the result of a change…
(more)

Subjects/Keywords: mathematical biology; graph theory; proteins; spectral clustering; computational biology; nest graph model; Other Applied Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Witt, W. G. (2017). Quantifying the Structure of Misfolded Proteins Using Graph Theory. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3244

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

Witt, Walter G. “Quantifying the Structure of Misfolded Proteins Using Graph Theory.” 2017. Masters Thesis, East Tennessee State University. Accessed November 30, 2020. https://dc.etsu.edu/etd/3244.

MLA Handbook (7^{th} Edition):

Witt, Walter G. “Quantifying the Structure of Misfolded Proteins Using Graph Theory.” 2017. Web. 30 Nov 2020.

Vancouver:

Witt WG. Quantifying the Structure of Misfolded Proteins Using Graph Theory. [Internet] [Masters thesis]. East Tennessee State University; 2017. [cited 2020 Nov 30]. Available from: https://dc.etsu.edu/etd/3244.

Council of Science Editors:

Witt WG. Quantifying the Structure of Misfolded Proteins Using Graph Theory. [Masters Thesis]. East Tennessee State University; 2017. Available from: https://dc.etsu.edu/etd/3244

Portland State University

7.
Wilson, Keith Eirik.
Factoring Semiprimes Using PG2N Prime *Graph* Multiagent Search.

Degree: MS(M.S.) in Computer Science, Computer Science, 2011, Portland State University

URL: https://pdxscholar.library.pdx.edu/open_access_etds/219

► In this thesis a heuristic method for factoring semiprimes by multiagent depth-limited search of PG2N graphs is presented. An analysis of PG2N *graph* connectivity…
(more)

Subjects/Keywords: Computational search; Factoring; Prime number graph; Prime Numbers; Trees (Graph theory); Factorization (Mathematics)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wilson, K. E. (2011). Factoring Semiprimes Using PG2N Prime Graph Multiagent Search. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/219

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

Wilson, Keith Eirik. “Factoring Semiprimes Using PG2N Prime Graph Multiagent Search.” 2011. Masters Thesis, Portland State University. Accessed November 30, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/219.

MLA Handbook (7^{th} Edition):

Wilson, Keith Eirik. “Factoring Semiprimes Using PG2N Prime Graph Multiagent Search.” 2011. Web. 30 Nov 2020.

Vancouver:

Wilson KE. Factoring Semiprimes Using PG2N Prime Graph Multiagent Search. [Internet] [Masters thesis]. Portland State University; 2011. [cited 2020 Nov 30]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/219.

Council of Science Editors:

Wilson KE. Factoring Semiprimes Using PG2N Prime Graph Multiagent Search. [Masters Thesis]. Portland State University; 2011. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/219

University of Ottawa

8. Kaykobad, M Tanvir. Transforming Plane Triangulations by Simultaneous Diagonal Flips .

Degree: 2020, University of Ottawa

URL: http://hdl.handle.net/10393/40499

► We explore the problem of transforming plane triangulations using simultaneous diagonal flips. Wagner showed that any n-vertex plane triangulation can be transformed to any other…
(more)

Subjects/Keywords: Computational geometry; Graph; Planar graph; Combinatorial triangulation; Simple planar triangulation; Diagonal flip; Simultaneous flip; Hamiltonian; Canonical triangulation; Outerplanar graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaykobad, M. T. (2020). Transforming Plane Triangulations by Simultaneous Diagonal Flips . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40499

Not specified: Masters Thesis or Doctoral Dissertation

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

Kaykobad, M Tanvir. “Transforming Plane Triangulations by Simultaneous Diagonal Flips .” 2020. Thesis, University of Ottawa. Accessed November 30, 2020. http://hdl.handle.net/10393/40499.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kaykobad, M Tanvir. “Transforming Plane Triangulations by Simultaneous Diagonal Flips .” 2020. Web. 30 Nov 2020.

Vancouver:

Kaykobad MT. Transforming Plane Triangulations by Simultaneous Diagonal Flips . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10393/40499.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaykobad MT. Transforming Plane Triangulations by Simultaneous Diagonal Flips . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40499

Not specified: Masters Thesis or Doctoral Dissertation

9. Jones, Bevan Keeley. Learning words and syntactic cues in highly ambiguous contexts.

Degree: PhD, 2016, University of Edinburgh

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

► The cross-situational word learning paradigm argues that word meanings can be approximated by word-object associations, computed from co-occurrence statistics between words and entities in the…
(more)

Subjects/Keywords: 413.028; word learning; semantic parsing; computational linguistics; computational modeling; graph grammar; frog stories; variational Bayes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jones, B. K. (2016). Learning words and syntactic cues in highly ambiguous contexts. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15959

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

Jones, Bevan Keeley. “Learning words and syntactic cues in highly ambiguous contexts.” 2016. Doctoral Dissertation, University of Edinburgh. Accessed November 30, 2020. http://hdl.handle.net/1842/15959.

MLA Handbook (7^{th} Edition):

Jones, Bevan Keeley. “Learning words and syntactic cues in highly ambiguous contexts.” 2016. Web. 30 Nov 2020.

Vancouver:

Jones BK. Learning words and syntactic cues in highly ambiguous contexts. [Internet] [Doctoral dissertation]. University of Edinburgh; 2016. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1842/15959.

Council of Science Editors:

Jones BK. Learning words and syntactic cues in highly ambiguous contexts. [Doctoral Dissertation]. University of Edinburgh; 2016. Available from: http://hdl.handle.net/1842/15959

Universiteit Utrecht

10. Rijnbeek, T.P.M. Continuous Voronoi Games on Graphs with Multiple Opponents.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/317774

► In this thesis, we study the puzzle game Lines—a commercial game developed by Gamious—which is a variant of the one-round Voronoi game on graphs. The…
(more)

Subjects/Keywords: Voronoi game; Voronoi diagram; Facility location; Lines; Graph theory; Computational geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rijnbeek, T. P. M. (2015). Continuous Voronoi Games on Graphs with Multiple Opponents. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/317774

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

Rijnbeek, T P M. “Continuous Voronoi Games on Graphs with Multiple Opponents.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/317774.

MLA Handbook (7^{th} Edition):

Rijnbeek, T P M. “Continuous Voronoi Games on Graphs with Multiple Opponents.” 2015. Web. 30 Nov 2020.

Vancouver:

Rijnbeek TPM. Continuous Voronoi Games on Graphs with Multiple Opponents. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/317774.

Council of Science Editors:

Rijnbeek TPM. Continuous Voronoi Games on Graphs with Multiple Opponents. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/317774

University of Waterloo

11.
Spriggs, Michael John.
Morphing Parallel *Graph* Drawings.

Degree: 2007, University of Waterloo

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

► A pair of straight-line drawings of a *graph* is called parallel if, for every edge of the *graph*, the line segment that represents the edge…
(more)

Subjects/Keywords: algorithms computational geometry graph drawing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Spriggs, M. J. (2007). Morphing Parallel Graph Drawings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3083

Not specified: Masters Thesis or Doctoral Dissertation

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

Spriggs, Michael John. “Morphing Parallel Graph Drawings.” 2007. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/3083.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Spriggs, Michael John. “Morphing Parallel Graph Drawings.” 2007. Web. 30 Nov 2020.

Vancouver:

Spriggs MJ. Morphing Parallel Graph Drawings. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/3083.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Spriggs MJ. Morphing Parallel Graph Drawings. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3083

Not specified: Masters Thesis or Doctoral Dissertation

12. Hosseini Alamdari, Soroush. Planar Open Rectangle-of-Influence Drawings.

Degree: 2012, University of Waterloo

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

► A straight line drawing of a *graph* is an open weak rectangle-of-influence (RI) drawing, if there is no vertex in the relative interior of the…
(more)

Subjects/Keywords: Computational Geometry; Graph Drawing

…*computational* biology, and GIS
(e.g. see Chapter “*Graph* drawing” of [17]). One of… …x28;a)
(b)
Figure 1.1: A plane *graph* G (a) and a open weak… …of standard definitions that are used extensively in the
domain of *graph* theory. These… …definitions can be found in any standard
*graph* theory textbook (e.g. see [7, 34])… …An undirected *graph* G is a pair consisting of a set of vertices V (G) and
a…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hosseini Alamdari, S. (2012). Planar Open Rectangle-of-Influence Drawings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6750

Not specified: Masters Thesis or Doctoral Dissertation

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

Hosseini Alamdari, Soroush. “Planar Open Rectangle-of-Influence Drawings.” 2012. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/6750.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hosseini Alamdari, Soroush. “Planar Open Rectangle-of-Influence Drawings.” 2012. Web. 30 Nov 2020.

Vancouver:

Hosseini Alamdari S. Planar Open Rectangle-of-Influence Drawings. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/6750.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hosseini Alamdari S. Planar Open Rectangle-of-Influence Drawings. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6750

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

13.
Molengraaf, Constantijn (author).
Local multi-qubit Clifford equivalence of *graph* states.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:a00a112f-94dd-42c9-a5cb-7b10bcd03caf

►

In the range of applications opened by quantum technology, often a highly entangled source state is needed as an input for a protocol (target state).… (more)

Subjects/Keywords: Quantum information; Quantum networks; Graph theory; Computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Molengraaf, C. (. (2019). Local multi-qubit Clifford equivalence of graph states. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a00a112f-94dd-42c9-a5cb-7b10bcd03caf

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

Molengraaf, Constantijn (author). “Local multi-qubit Clifford equivalence of graph states.” 2019. Masters Thesis, Delft University of Technology. Accessed November 30, 2020. http://resolver.tudelft.nl/uuid:a00a112f-94dd-42c9-a5cb-7b10bcd03caf.

MLA Handbook (7^{th} Edition):

Molengraaf, Constantijn (author). “Local multi-qubit Clifford equivalence of graph states.” 2019. Web. 30 Nov 2020.

Vancouver:

Molengraaf C(. Local multi-qubit Clifford equivalence of graph states. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Nov 30]. Available from: http://resolver.tudelft.nl/uuid:a00a112f-94dd-42c9-a5cb-7b10bcd03caf.

Council of Science Editors:

Molengraaf C(. Local multi-qubit Clifford equivalence of graph states. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:a00a112f-94dd-42c9-a5cb-7b10bcd03caf

University of Minnesota

14. Zjevik, Ondrej. Symmetric chain decompositions of partially ordered sets.

Degree: MS, Applied and Computational Mathematics, 2014, University of Minnesota

URL: http://hdl.handle.net/11299/166874

► A partially ordered set, or poset, is a set of elements and a binary relation which determines an order within elements. Various combinatorial properties of…
(more)

Subjects/Keywords: Graph decomposition; Partially ordered set; Symmetric chains; Applied and computational mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zjevik, O. (2014). Symmetric chain decompositions of partially ordered sets. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/166874

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

Zjevik, Ondrej. “Symmetric chain decompositions of partially ordered sets.” 2014. Masters Thesis, University of Minnesota. Accessed November 30, 2020. http://hdl.handle.net/11299/166874.

MLA Handbook (7^{th} Edition):

Zjevik, Ondrej. “Symmetric chain decompositions of partially ordered sets.” 2014. Web. 30 Nov 2020.

Vancouver:

Zjevik O. Symmetric chain decompositions of partially ordered sets. [Internet] [Masters thesis]. University of Minnesota; 2014. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/11299/166874.

Council of Science Editors:

Zjevik O. Symmetric chain decompositions of partially ordered sets. [Masters Thesis]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/166874

University of Hong Kong

15. Yue, Fung-ling. On the complexity of finding optimal edge rankings.

Degree: 1996, University of Hong Kong

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

Subjects/Keywords: Computational complexity.; Trees (Graph theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yue, F. (1996). On the complexity of finding optimal edge rankings. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/31816

Not specified: Masters Thesis or Doctoral Dissertation

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

Yue, Fung-ling. “On the complexity of finding optimal edge rankings.” 1996. Thesis, University of Hong Kong. Accessed November 30, 2020. http://hdl.handle.net/10722/31816.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yue, Fung-ling. “On the complexity of finding optimal edge rankings.” 1996. Web. 30 Nov 2020.

Vancouver:

Yue F. On the complexity of finding optimal edge rankings. [Internet] [Thesis]. University of Hong Kong; 1996. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10722/31816.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yue F. On the complexity of finding optimal edge rankings. [Thesis]. University of Hong Kong; 1996. Available from: http://hdl.handle.net/10722/31816

Not specified: Masters Thesis or Doctoral Dissertation

University of Tennessee – Knoxville

16.
Phillips, Charles Alexander.
Multipartite *Graph* Algorithms for the Analysis of Heterogeneous Data.

Degree: 2015, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_graddiss/3600

► The explosive growth in the rate of data generation in recent years threatens to outpace the growth in computer power, motivating the need for new,…
(more)

Subjects/Keywords: graph algorithms; combinatorics; clustering; multipartite; biclique; Computational Biology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Phillips, C. A. (2015). Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/3600

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

Phillips, Charles Alexander. “Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.” 2015. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed November 30, 2020. https://trace.tennessee.edu/utk_graddiss/3600.

MLA Handbook (7^{th} Edition):

Phillips, Charles Alexander. “Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.” 2015. Web. 30 Nov 2020.

Vancouver:

Phillips CA. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2015. [cited 2020 Nov 30]. Available from: https://trace.tennessee.edu/utk_graddiss/3600.

Council of Science Editors:

Phillips CA. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2015. Available from: https://trace.tennessee.edu/utk_graddiss/3600

University of Oxford

17.
Meeks, Kitty M. F. T.
* Graph* colourings and games.

Degree: PhD, 2012, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116

► *Graph* colourings and combinatorial games are two very widely studied topics in discrete mathematics. This thesis addresses the *computational* complexity of a range of problems…
(more)

Subjects/Keywords: 511.6; Combinatorics; Computer science (mathematics); Applications and algorithms; graph theory; games on graphs; graph colouring; algorithms; computational complexity; parameterised complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Meeks, K. M. F. T. (2012). Graph colourings and games. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116

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

Meeks, Kitty M F T. “Graph colourings and games.” 2012. Doctoral Dissertation, University of Oxford. Accessed November 30, 2020. http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116.

MLA Handbook (7^{th} Edition):

Meeks, Kitty M F T. “Graph colourings and games.” 2012. Web. 30 Nov 2020.

Vancouver:

Meeks KMFT. Graph colourings and games. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2020 Nov 30]. Available from: http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116.

Council of Science Editors:

Meeks KMFT. Graph colourings and games. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116

The Ohio State University

18. Fan, Fengtao. Computing Topological Features of Data and Shapes.

Degree: PhD, Computer Science and Engineering, 2013, The Ohio State University

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

► The topological features of an object are features which are preserved while continuously deforming the object. Examples are the dimension of an object and…
(more)

Subjects/Keywords: Computer Science; Computational Topology; Persistent Homology; Graph Induced Complex; Dimension Detection; Reeb Graph; Handle and Tunnel Loops

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fan, F. (2013). Computing Topological Features of Data and Shapes. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1385999908

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

Fan, Fengtao. “Computing Topological Features of Data and Shapes.” 2013. Doctoral Dissertation, The Ohio State University. Accessed November 30, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1385999908.

MLA Handbook (7^{th} Edition):

Fan, Fengtao. “Computing Topological Features of Data and Shapes.” 2013. Web. 30 Nov 2020.

Vancouver:

Fan F. Computing Topological Features of Data and Shapes. [Internet] [Doctoral dissertation]. The Ohio State University; 2013. [cited 2020 Nov 30]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1385999908.

Council of Science Editors:

Fan F. Computing Topological Features of Data and Shapes. [Doctoral Dissertation]. The Ohio State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1385999908

KTH

19. Wåhlin, Lova. Towards Machine Learning Enabled Automatic Design of IT-Network Architectures.

Degree: Mathematical Statistics, 2019, KTH

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

►

There are many machine learning techniques that cannot be performed on *graph*-data. Techniques such as *graph* embedding, i.e mapping a *graph* to a vector,…
(more)

Subjects/Keywords: IT-Architecture graph; Node Embedding; Graph Embedding; Reinforcement Learning; Machine Learning; IT-Arkitektur; Node Embedding; Graph Embedding; Reinforcement learning; Maskininlärning; Computational Mathematics; Beräkningsmatematik

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wåhlin, L. (2019). Towards Machine Learning Enabled Automatic Design of IT-Network Architectures. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213

Not specified: Masters Thesis or Doctoral Dissertation

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

Wåhlin, Lova. “Towards Machine Learning Enabled Automatic Design of IT-Network Architectures.” 2019. Thesis, KTH. Accessed November 30, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wåhlin, Lova. “Towards Machine Learning Enabled Automatic Design of IT-Network Architectures.” 2019. Web. 30 Nov 2020.

Vancouver:

Wåhlin L. Towards Machine Learning Enabled Automatic Design of IT-Network Architectures. [Internet] [Thesis]. KTH; 2019. [cited 2020 Nov 30]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wåhlin L. Towards Machine Learning Enabled Automatic Design of IT-Network Architectures. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213

Not specified: Masters Thesis or Doctoral Dissertation

University of Technology, Sydney

20.
Gong, Chen.
Robust *graph* transduction.

Degree: 2016, University of Technology, Sydney

URL: http://hdl.handle.net/10453/102708

► Given a weighted *graph*, *graph* transduction aims to assign unlabeled examples explicit class labels rather than build a general decision function based on the available…
(more)

Subjects/Keywords: Computational intelligence.; “Bridge points”.; Graph theory.; Graph transduction algorithms.; Label Prediction via Deformed Graph Laplacian” (LPDGL); Non-iterative algorithm.; Saliency detection.; Superpixels

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gong, C. (2016). Robust graph transduction. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/102708

Not specified: Masters Thesis or Doctoral Dissertation

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

Gong, Chen. “Robust graph transduction.” 2016. Thesis, University of Technology, Sydney. Accessed November 30, 2020. http://hdl.handle.net/10453/102708.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gong, Chen. “Robust graph transduction.” 2016. Web. 30 Nov 2020.

Vancouver:

Gong C. Robust graph transduction. [Internet] [Thesis]. University of Technology, Sydney; 2016. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10453/102708.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gong C. Robust graph transduction. [Thesis]. University of Technology, Sydney; 2016. Available from: http://hdl.handle.net/10453/102708

Not specified: Masters Thesis or Doctoral Dissertation

Carnegie Mellon University

21. Veras, Richard Michael. A Systematic Approach for Obtaining Performance on Matrix-Like Operations.

Degree: 2017, Carnegie Mellon University

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

► Scientific Computation provides a critical role in the scientific process because it allows us ask complex queries and test predictions that would otherwise be unfeasible…
(more)

Subjects/Keywords: Code Generation; Computational Science; Dense Linear Algebra; Graph Analytics; High Performance Computing; Sparse Linear Algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Veras, R. M. (2017). A Systematic Approach for Obtaining Performance on Matrix-Like Operations. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/1011

Not specified: Masters Thesis or Doctoral Dissertation

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

Veras, Richard Michael. “A Systematic Approach for Obtaining Performance on Matrix-Like Operations.” 2017. Thesis, Carnegie Mellon University. Accessed November 30, 2020. http://repository.cmu.edu/dissertations/1011.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Veras, Richard Michael. “A Systematic Approach for Obtaining Performance on Matrix-Like Operations.” 2017. Web. 30 Nov 2020.

Vancouver:

Veras RM. A Systematic Approach for Obtaining Performance on Matrix-Like Operations. [Internet] [Thesis]. Carnegie Mellon University; 2017. [cited 2020 Nov 30]. Available from: http://repository.cmu.edu/dissertations/1011.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Veras RM. A Systematic Approach for Obtaining Performance on Matrix-Like Operations. [Thesis]. Carnegie Mellon University; 2017. Available from: http://repository.cmu.edu/dissertations/1011

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

22. Hua, Wenmian. Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems.

Degree: PhD, Electrical and Computer Engineering, 2020, Cornell University

URL: http://hdl.handle.net/1813/70398

► Asynchronous circuits have potential advantages of higher speed and lower power consumption compared to their synchronous counterparts, but their poor CAD support is a major…
(more)

Subjects/Keywords: asynchronous circuits; computational modeling; graph theory; metastability-free interface; min-max systems; timing analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hua, W. (2020). Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/70398

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

Hua, Wenmian. “Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems.” 2020. Doctoral Dissertation, Cornell University. Accessed November 30, 2020. http://hdl.handle.net/1813/70398.

MLA Handbook (7^{th} Edition):

Hua, Wenmian. “Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems.” 2020. Web. 30 Nov 2020.

Vancouver:

Hua W. Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems. [Internet] [Doctoral dissertation]. Cornell University; 2020. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1813/70398.

Council of Science Editors:

Hua W. Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems. [Doctoral Dissertation]. Cornell University; 2020. Available from: http://hdl.handle.net/1813/70398

Texas A&M University

23. Kahruman-Anderoglu, Sera. Optimization in Geometric Graphs: Complexity and Approximation.

Degree: PhD, Industrial Engineering, 2011, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092

► We consider several related problems arising in geometric graphs. In particular, we investigate the *computational* complexity and approximability properties of several optimization problems in unit…
(more)

Subjects/Keywords: graph theory; geometric graphs; heuristics; computational complexity; approximation algorithms; branch and bound; wireless networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kahruman-Anderoglu, S. (2011). Optimization in Geometric Graphs: Complexity and Approximation. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092

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

Kahruman-Anderoglu, Sera. “Optimization in Geometric Graphs: Complexity and Approximation.” 2011. Doctoral Dissertation, Texas A&M University. Accessed November 30, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092.

MLA Handbook (7^{th} Edition):

Kahruman-Anderoglu, Sera. “Optimization in Geometric Graphs: Complexity and Approximation.” 2011. Web. 30 Nov 2020.

Vancouver:

Kahruman-Anderoglu S. Optimization in Geometric Graphs: Complexity and Approximation. [Internet] [Doctoral dissertation]. Texas A&M University; 2011. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092.

Council of Science Editors:

Kahruman-Anderoglu S. Optimization in Geometric Graphs: Complexity and Approximation. [Doctoral Dissertation]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092

Washington State University

24. [No author]. Feature extraction from network data .

Degree: 2019, Washington State University

URL: http://hdl.handle.net/2376/17893

► This work explores different approaches to feature extraction from network data. The first part focuses on Boolean networks, a simplistic discrete dynamical system built over…
(more)

Subjects/Keywords: Applied mathematics; anomaly detection; Boolean networks; computational geometry; graph matching; Gromov–Hausdorff distances; shape analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2019). Feature extraction from network data . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/17893

Not specified: Masters Thesis or Doctoral Dissertation

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

author], [No. “Feature extraction from network data .” 2019. Thesis, Washington State University. Accessed November 30, 2020. http://hdl.handle.net/2376/17893.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Feature extraction from network data .” 2019. Web. 30 Nov 2020.

Vancouver:

author] [. Feature extraction from network data . [Internet] [Thesis]. Washington State University; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2376/17893.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Feature extraction from network data . [Thesis]. Washington State University; 2019. Available from: http://hdl.handle.net/2376/17893

Not specified: Masters Thesis or Doctoral Dissertation

East Tennessee State University

25.
Green, Hannah E.
Differentiating Between a Protein and its Decoy Using Nested *Graph* Models and Weighted *Graph* Theoretical Invariants.

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

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

► To determine the function of a protein, we must know its 3-dimensional structure, which can be difficult to ascertain. Currently, predictive models are used…
(more)

Subjects/Keywords: Graph Theory; Computational Biology; Proteins; Invariants; Discrete Mathematics and Combinatorics; Other Applied Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Green, H. E. (2017). Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3248

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

Green, Hannah E. “Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants.” 2017. Masters Thesis, East Tennessee State University. Accessed November 30, 2020. https://dc.etsu.edu/etd/3248.

MLA Handbook (7^{th} Edition):

Green, Hannah E. “Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants.” 2017. Web. 30 Nov 2020.

Vancouver:

Green HE. Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants. [Internet] [Masters thesis]. East Tennessee State University; 2017. [cited 2020 Nov 30]. Available from: https://dc.etsu.edu/etd/3248.

Council of Science Editors:

Green HE. Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants. [Masters Thesis]. East Tennessee State University; 2017. Available from: https://dc.etsu.edu/etd/3248

Florida Atlantic University

26.
Gottipati, Chenchu B.
* Graph* labeling and non-separating trees.

Degree: 2014, Florida Atlantic University

URL: http://purl.flvc.org/fau/fd/FA00004289 ; (URL) http://purl.flvc.org/fau/fd/FA00004289

►

Summary: This dissertation studies two independent problems, one is about *graph* labeling and the other problem is related to connectivity condition in a simple *graph*.…
(more)

Subjects/Keywords: Computational complexity; Computer graphics; Graph theory; Integrated circuits – Very large scale integration; Mathematical optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gottipati, C. B. (2014). Graph labeling and non-separating trees. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004289 ; (URL) http://purl.flvc.org/fau/fd/FA00004289

Not specified: Masters Thesis or Doctoral Dissertation

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

Gottipati, Chenchu B. “Graph labeling and non-separating trees.” 2014. Thesis, Florida Atlantic University. Accessed November 30, 2020. http://purl.flvc.org/fau/fd/FA00004289 ; (URL) http://purl.flvc.org/fau/fd/FA00004289.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gottipati, Chenchu B. “Graph labeling and non-separating trees.” 2014. Web. 30 Nov 2020.

Vancouver:

Gottipati CB. Graph labeling and non-separating trees. [Internet] [Thesis]. Florida Atlantic University; 2014. [cited 2020 Nov 30]. Available from: http://purl.flvc.org/fau/fd/FA00004289 ; (URL) http://purl.flvc.org/fau/fd/FA00004289.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gottipati CB. Graph labeling and non-separating trees. [Thesis]. Florida Atlantic University; 2014. Available from: http://purl.flvc.org/fau/fd/FA00004289 ; (URL) http://purl.flvc.org/fau/fd/FA00004289

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

27. Everett, William. This again? Logic loops and catalytic cycles.

Degree: 2019, Iowa State University

URL: https://lib.dr.iastate.edu/etd/17677

► This dissertation is composed of chapters that are published, in preparation for journal submission or currently unpublished. Chapter 2 covers the development of a prototype…
(more)

Subjects/Keywords: computational chemistry; computer science; directed acyclic graph; physical chemistry; quantum chemistry; zirconium catalysis; Physical Chemistry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Everett, W. (2019). This again? Logic loops and catalytic cycles. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17677

Not specified: Masters Thesis or Doctoral Dissertation

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

Everett, William. “This again? Logic loops and catalytic cycles.” 2019. Thesis, Iowa State University. Accessed November 30, 2020. https://lib.dr.iastate.edu/etd/17677.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Everett, William. “This again? Logic loops and catalytic cycles.” 2019. Web. 30 Nov 2020.

Vancouver:

Everett W. This again? Logic loops and catalytic cycles. [Internet] [Thesis]. Iowa State University; 2019. [cited 2020 Nov 30]. Available from: https://lib.dr.iastate.edu/etd/17677.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Everett W. This again? Logic loops and catalytic cycles. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/17677

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

28. Bultena, Bette. Face-balanced, Venn and polyVenn diagrams.

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

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

► A \emph{simple} n-\emph{Venn diagram} is a collection of n simple intersecting closed curves in the plane where exactly two curves meet at any intersection point;…
(more)

Subjects/Keywords: Venn diagram; graph theory; computational geometry; minimum area Venn diagram; Winkler's conjecture

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bultena, B. (2013). Face-balanced, Venn and polyVenn diagrams. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4873

Not specified: Masters Thesis or Doctoral Dissertation

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

Bultena, Bette. “Face-balanced, Venn and polyVenn diagrams.” 2013. Thesis, University of Victoria. Accessed November 30, 2020. http://hdl.handle.net/1828/4873.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bultena, Bette. “Face-balanced, Venn and polyVenn diagrams.” 2013. Web. 30 Nov 2020.

Vancouver:

Bultena B. Face-balanced, Venn and polyVenn diagrams. [Internet] [Thesis]. University of Victoria; 2013. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1828/4873.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bultena B. Face-balanced, Venn and polyVenn diagrams. [Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4873

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

29. Phan, Phan. Expanding constraint theory to determine well-posedness of large mathematical models.

Degree: PhD, Industrial & Systems Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/454436/rec/2611

► Mathematical modeling represents one of the major tools for the conception and management of the ever increasing complexity of systems engineering. Unfortunately, present approaches to…
(more)

Subjects/Keywords: constraint; bipartite graph; well-posedness; model consistency; computational allowability, basic nodal square

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Phan, P. (2011). Expanding constraint theory to determine well-posedness of large mathematical models. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/454436/rec/2611

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

Phan, Phan. “Expanding constraint theory to determine well-posedness of large mathematical models.” 2011. Doctoral Dissertation, University of Southern California. Accessed November 30, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/454436/rec/2611.

MLA Handbook (7^{th} Edition):

Phan, Phan. “Expanding constraint theory to determine well-posedness of large mathematical models.” 2011. Web. 30 Nov 2020.

Vancouver:

Phan P. Expanding constraint theory to determine well-posedness of large mathematical models. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Nov 30]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/454436/rec/2611.

Council of Science Editors:

Phan P. Expanding constraint theory to determine well-posedness of large mathematical models. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/454436/rec/2611

University of Southern California

30.
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/1549

► 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/1549

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 30, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1549.

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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/1549