Advanced search options

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

You searched for `subject:(Sub graph isomorphism)`

.
Showing records 1 – 4 of
4 total matches.

▼ Search Limiters

University of Waterloo

1.
Lin, Zhiyuan.
From *Isomorphism*-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF).

Degree: 2016, University of Waterloo

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

► Resource Description Framework (RDF) is a *graph*-like data model designed for the web. One of its compelling features is a precise, model-theoretic semantics. We address…
(more)

Subjects/Keywords: Privacy; Graph Security; Resource Description Framework; Graph Isomorphism; Graph Automorphism; Sub-graph Isomorphism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lin, Z. (2016). From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF). (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10643

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

Lin, Zhiyuan. “From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF).” 2016. Thesis, University of Waterloo. Accessed June 24, 2019. http://hdl.handle.net/10012/10643.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lin, Zhiyuan. “From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF).” 2016. Web. 24 Jun 2019.

Vancouver:

Lin Z. From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF). [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10012/10643.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin Z. From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF). [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10643

Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

2.
Balasubramanian, Suman.
ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY *ISOMORPHISM* PROBLEM.

Degree: PhD, Mathematics and Statistics, 2009, Mississippi State University

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

► We study the Erdős- Sòs conjecture that states that every *graph* of average degree greater than k-1 contains every tree of order k+1. While the…
(more)

Subjects/Keywords: Cayley graph; (pq r)metacirculant; Tree; K<; sub>; 2 s<; /sub>;

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Balasubramanian, S. (2009). ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;

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

Balasubramanian, Suman. “ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM.” 2009. Doctoral Dissertation, Mississippi State University. Accessed June 24, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;.

MLA Handbook (7^{th} Edition):

Balasubramanian, Suman. “ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM.” 2009. Web. 24 Jun 2019.

Vancouver:

Balasubramanian S. ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM. [Internet] [Doctoral dissertation]. Mississippi State University; 2009. [cited 2019 Jun 24]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;.

Council of Science Editors:

Balasubramanian S. ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM. [Doctoral Dissertation]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;

3. MEDURI VENKATA VAMSIKRISHNA. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.

Degree: 2011, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/20999

Subjects/Keywords: Databases; Complex Query optimization; Iterative Dynamic Programming; Sub query plan reuse; Cover set generation; Sub graph isomorphism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

VAMSIKRISHNA, M. V. (2011). Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/20999

Not specified: Masters Thesis or Doctoral Dissertation

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

VAMSIKRISHNA, MEDURI VENKATA. “Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.” 2011. Thesis, National University of Singapore. Accessed June 24, 2019. http://scholarbank.nus.edu.sg/handle/10635/20999.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

VAMSIKRISHNA, MEDURI VENKATA. “Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.” 2011. Web. 24 Jun 2019.

Vancouver:

VAMSIKRISHNA MV. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. [Internet] [Thesis]. National University of Singapore; 2011. [cited 2019 Jun 24]. Available from: http://scholarbank.nus.edu.sg/handle/10635/20999.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

VAMSIKRISHNA MV. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. [Thesis]. National University of Singapore; 2011. Available from: http://scholarbank.nus.edu.sg/handle/10635/20999

Not specified: Masters Thesis or Doctoral Dissertation

4. XU CE. Automated application-specific instruction set generation.

Degree: 2006, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/15080

Subjects/Keywords: ASIP; Design Automation; Data Flow Graph; Sub-Graph Isomorphism; DAG Covering; Branch-and-Bound

Record Details Similar Records

❌

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

APA (6^{th} Edition):

CE, X. (2006). Automated application-specific instruction set generation. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/15080

Not specified: Masters Thesis or Doctoral Dissertation

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

CE, XU. “Automated application-specific instruction set generation.” 2006. Thesis, National University of Singapore. Accessed June 24, 2019. http://scholarbank.nus.edu.sg/handle/10635/15080.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

CE, XU. “Automated application-specific instruction set generation.” 2006. Web. 24 Jun 2019.

Vancouver:

CE X. Automated application-specific instruction set generation. [Internet] [Thesis]. National University of Singapore; 2006. [cited 2019 Jun 24]. Available from: http://scholarbank.nus.edu.sg/handle/10635/15080.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

CE X. Automated application-specific instruction set generation. [Thesis]. National University of Singapore; 2006. Available from: http://scholarbank.nus.edu.sg/handle/10635/15080

Not specified: Masters Thesis or Doctoral Dissertation