Advanced search options

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

You searched for `subject:(subgraph isomorphism)`

.
Showing records 1 – 14 of
14 total matches.

▼ Search Limiters

1.
Jain, Ayushi.
Parallel algorithms for *subgraph* pattern matching.

Degree: MS, Computer Science, 2014, University of Georgia

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

► Due to the growing importance of Big Data, graphs are becoming huge in size and are rapidly getting too large for conventional computer approaches. Graph…
(more)

Subjects/Keywords: subgraph isomorphism

…defined in terms of *subgraph* *isomorphism*, an NP-Complete problem.
Most existing graph pattern… …completeness of the *subgraph* *isomorphism* problem.
Numerous applications deal with large-scale massive… …are similar to the given query graph. This
leads to the *subgraph* *isomorphism* problem which… …are pioneering work on
*subgraph* *isomorphism* and are widely used. They can be effectively… …art algorithms [34]
9
have been developed for *subgraph* *isomorphism*, including…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jain, A. (2014). Parallel algorithms for subgraph pattern matching. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms

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

Jain, Ayushi. “Parallel algorithms for subgraph pattern matching.” 2014. Masters Thesis, University of Georgia. Accessed July 19, 2019. http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms.

MLA Handbook (7^{th} Edition):

Jain, Ayushi. “Parallel algorithms for subgraph pattern matching.” 2014. Web. 19 Jul 2019.

Vancouver:

Jain A. Parallel algorithms for subgraph pattern matching. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2019 Jul 19]. Available from: http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms.

Council of Science Editors:

Jain A. Parallel algorithms for subgraph pattern matching. [Masters Thesis]. University of Georgia; 2014. Available from: http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms

Penn State University

2. Slota, George Michael. Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems.

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

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

► Graph analysis is the study of real-world interaction data, be it through biological or chemical interaction networks, human social or communication networks, or other graph-representable…
(more)

Subjects/Keywords: graph mining; high performance computing; graph partitioning; subgraph isomorphism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Slota, G. M. (2016). Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/28925

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

Slota, George Michael. “Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems.” 2016. Doctoral Dissertation, Penn State University. Accessed July 19, 2019. https://etda.libraries.psu.edu/catalog/28925.

MLA Handbook (7^{th} Edition):

Slota, George Michael. “Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems.” 2016. Web. 19 Jul 2019.

Vancouver:

Slota GM. Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2019 Jul 19]. Available from: https://etda.libraries.psu.edu/catalog/28925.

Council of Science Editors:

Slota GM. Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/28925

University of Georgia

3. Bernaola Ibarra, Luis Anggelo. Improving the dual cardinality simulation algorithms.

Degree: MS, Computer Science, 2018, University of Georgia

URL: http://hdl.handle.net/10724/38281

► Graph pattern matching is typically defined in terms of *subgraph* *isomorphism*, which makes it an NP-complete/NP-hard problem. *Isomorphism* algorithms requires bijective functions which can be…
(more)

Subjects/Keywords: Subgraph Isomorphism; Cardinality; Graph Database; Graph Simulation; Pattern matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bernaola Ibarra, L. A. (2018). Improving the dual cardinality simulation algorithms. (Masters Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/38281

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

Bernaola Ibarra, Luis Anggelo. “Improving the dual cardinality simulation algorithms.” 2018. Masters Thesis, University of Georgia. Accessed July 19, 2019. http://hdl.handle.net/10724/38281.

MLA Handbook (7^{th} Edition):

Bernaola Ibarra, Luis Anggelo. “Improving the dual cardinality simulation algorithms.” 2018. Web. 19 Jul 2019.

Vancouver:

Bernaola Ibarra LA. Improving the dual cardinality simulation algorithms. [Internet] [Masters thesis]. University of Georgia; 2018. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/10724/38281.

Council of Science Editors:

Bernaola Ibarra LA. Improving the dual cardinality simulation algorithms. [Masters Thesis]. University of Georgia; 2018. Available from: http://hdl.handle.net/10724/38281

Université Catholique de Louvain

4.
Zampelli, Stéphane.
A constraint programming approach to *subgraph* * isomorphism*.

Degree: 2008, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/12737

►

This thesis proposes an expressive yet efficient declarative framework for graph matching in constraint programming (CP), and focuses on efficient algorithms to solve the *subgraph*…
(more)

Subjects/Keywords: Isomorphism; Matching; Graph; Constraint programming; Subgraph isomorphism; Graph matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zampelli, S. (2008). A constraint programming approach to subgraph isomorphism. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/12737

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

Zampelli, Stéphane. “A constraint programming approach to subgraph isomorphism.” 2008. Thesis, Université Catholique de Louvain. Accessed July 19, 2019. http://hdl.handle.net/2078.1/12737.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zampelli, Stéphane. “A constraint programming approach to subgraph isomorphism.” 2008. Web. 19 Jul 2019.

Vancouver:

Zampelli S. A constraint programming approach to subgraph isomorphism. [Internet] [Thesis]. Université Catholique de Louvain; 2008. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2078.1/12737.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zampelli S. A constraint programming approach to subgraph isomorphism. [Thesis]. Université Catholique de Louvain; 2008. Available from: http://hdl.handle.net/2078.1/12737

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

5. Kasiviswanathan, Shiva Prasad. Approximation Algorithms For Graph Problems.

Degree: PhD, Computer Science, 2008, Penn State University

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

► This thesis studies approximation algorithms for two fundamental problems arising in graph theory: counting copies of one graph in another graph and estimating distances in…
(more)

Subjects/Keywords: Geometric Disk Graph; Perfect Matching; Subgraph Isomorphism; Approximation Algorithm; Graph theory; Graph Spanner

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kasiviswanathan, S. P. (2008). Approximation Algorithms For Graph Problems. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8897

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

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Doctoral Dissertation, Penn State University. Accessed July 19, 2019. https://etda.libraries.psu.edu/catalog/8897.

MLA Handbook (7^{th} Edition):

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Web. 19 Jul 2019.

Vancouver:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2019 Jul 19]. Available from: https://etda.libraries.psu.edu/catalog/8897.

Council of Science Editors:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Doctoral Dissertation]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8897

6.
Nabti, Chems Eddine.
*Subgraph**Isomorphism* Search In Massive Graph Data : Isomorphisme de Sous-Graphes dans les graphes de données massifs.

Degree: Docteur es, Informatique, 2017, Lyon

URL: http://www.theses.fr/2017LYSE1293

►

L'interrogation de graphes de données est un problème fondamental qui connait un grand intérêt, en particulier pour les données structurées massives où les graphes constituent… (more)

Subjects/Keywords: Isomorphisme de sous-graphe; Graphes de données massifs; Subgraph Isomorphism Search; Massive Graph Data; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nabti, C. E. (2017). Subgraph Isomorphism Search In Massive Graph Data : Isomorphisme de Sous-Graphes dans les graphes de données massifs. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSE1293

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

Nabti, Chems Eddine. “Subgraph Isomorphism Search In Massive Graph Data : Isomorphisme de Sous-Graphes dans les graphes de données massifs.” 2017. Doctoral Dissertation, Lyon. Accessed July 19, 2019. http://www.theses.fr/2017LYSE1293.

MLA Handbook (7^{th} Edition):

Nabti, Chems Eddine. “Subgraph Isomorphism Search In Massive Graph Data : Isomorphisme de Sous-Graphes dans les graphes de données massifs.” 2017. Web. 19 Jul 2019.

Vancouver:

Nabti CE. Subgraph Isomorphism Search In Massive Graph Data : Isomorphisme de Sous-Graphes dans les graphes de données massifs. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2019 Jul 19]. Available from: http://www.theses.fr/2017LYSE1293.

Council of Science Editors:

Nabti CE. Subgraph Isomorphism Search In Massive Graph Data : Isomorphisme de Sous-Graphes dans les graphes de données massifs. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSE1293

University of Edinburgh

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

Degree: PhD, 2017, University of Edinburgh

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

Tian, Chao. “Towards effective analysis of big graphs : from scalability to quality.” 2017. Web. 19 Jul 2019.

Vancouver:

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

Council of Science Editors:

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

8. Kelenc, Aleksander. Problem izomorfizma podgrafov ravninskih grafov.

Degree: 2013, Univerza v Mariboru

URL: https://dk.um.si/IzpisGradiva.php?id=41208 ; https://dk.um.si/Dokument.php?id=56846&dn= ; https://plus.si.cobiss.net/opac7/bib/20051208?lang=sl

►

V problemu izomorfizma podgrafov imamo podana dva grafa G in H. Za njiju je potrebno ugotoviti, ali graf G vsebuje podgraf, ki je izomorfen grafu… (more)

Subjects/Keywords: izomorfizem podgrafov; ravninski graf; drevesna dekompozicija; dinamično programiranje; subgraph isomorphism; planar graph; tree decomposition; dynamic programming; info:eu-repo/classification/udc/519.172.2(043.2)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kelenc, A. (2013). Problem izomorfizma podgrafov ravninskih grafov. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=41208 ; https://dk.um.si/Dokument.php?id=56846&dn= ; https://plus.si.cobiss.net/opac7/bib/20051208?lang=sl

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

Kelenc, Aleksander. “Problem izomorfizma podgrafov ravninskih grafov.” 2013. Masters Thesis, Univerza v Mariboru. Accessed July 19, 2019. https://dk.um.si/IzpisGradiva.php?id=41208 ; https://dk.um.si/Dokument.php?id=56846&dn= ; https://plus.si.cobiss.net/opac7/bib/20051208?lang=sl.

MLA Handbook (7^{th} Edition):

Kelenc, Aleksander. “Problem izomorfizma podgrafov ravninskih grafov.” 2013. Web. 19 Jul 2019.

Vancouver:

Kelenc A. Problem izomorfizma podgrafov ravninskih grafov. [Internet] [Masters thesis]. Univerza v Mariboru; 2013. [cited 2019 Jul 19]. Available from: https://dk.um.si/IzpisGradiva.php?id=41208 ; https://dk.um.si/Dokument.php?id=56846&dn= ; https://plus.si.cobiss.net/opac7/bib/20051208?lang=sl.

Council of Science Editors:

Kelenc A. Problem izomorfizma podgrafov ravninskih grafov. [Masters Thesis]. Univerza v Mariboru; 2013. Available from: https://dk.um.si/IzpisGradiva.php?id=41208 ; https://dk.um.si/Dokument.php?id=56846&dn= ; https://plus.si.cobiss.net/opac7/bib/20051208?lang=sl

Brno University of Technology

9. Ševčík, Ivan. Systém pro vyhledávání chemických struktur .

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/84919

► Táto práca sa zaoberá problémom vyhľadávania štruktúr vo veľkých databázach chemických látok. Cieľom je návrh a implementácia efektívneho systému podporujúceho dva základné typy vyhľadávania, ktorými…
(more)

Subjects/Keywords: databáza chemických látok; systém pre vyhľadávanie; chemické štruktúry; izomorfizmus grafov a podgrafov; molekulárne odtlačky; chemical compounds database; search engine; chemical structures; graph and subgraph isomorphism; molecular fingerprints

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ševčík, I. (2018). Systém pro vyhledávání chemických struktur . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/84919

Not specified: Masters Thesis or Doctoral Dissertation

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

Ševčík, Ivan. “Systém pro vyhledávání chemických struktur .” 2018. Thesis, Brno University of Technology. Accessed July 19, 2019. http://hdl.handle.net/11012/84919.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ševčík, Ivan. “Systém pro vyhledávání chemických struktur .” 2018. Web. 19 Jul 2019.

Vancouver:

Ševčík I. Systém pro vyhledávání chemických struktur . [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/11012/84919.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ševčík I. Systém pro vyhledávání chemických struktur . [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/84919

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

10. Li, Jie. Data integration for biological network databases: MetNetDB labeled graph model and graph matching algorithm.

Degree: 2008, Iowa State University

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

► To understand the cellular functions of genes requires investigating a variety of biological data, including experimental data, annotation from online databases and literatures, information about…
(more)

Subjects/Keywords: Arabidopsis; biological data integration; biological network database; graph query; MetNetDB; subgraph isomorphism; Cell and Developmental Biology; Genetics and Genomics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, J. (2008). Data integration for biological network databases: MetNetDB labeled graph model and graph matching algorithm. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/10921

Not specified: Masters Thesis or Doctoral Dissertation

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

Li, Jie. “Data integration for biological network databases: MetNetDB labeled graph model and graph matching algorithm.” 2008. Thesis, Iowa State University. Accessed July 19, 2019. https://lib.dr.iastate.edu/etd/10921.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Jie. “Data integration for biological network databases: MetNetDB labeled graph model and graph matching algorithm.” 2008. Web. 19 Jul 2019.

Vancouver:

Li J. Data integration for biological network databases: MetNetDB labeled graph model and graph matching algorithm. [Internet] [Thesis]. Iowa State University; 2008. [cited 2019 Jul 19]. Available from: https://lib.dr.iastate.edu/etd/10921.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li J. Data integration for biological network databases: MetNetDB labeled graph model and graph matching algorithm. [Thesis]. Iowa State University; 2008. Available from: https://lib.dr.iastate.edu/etd/10921

Not specified: Masters Thesis or Doctoral Dissertation

11.
[No author].
* Subgraph* Search for Dynamic Graphs
.

Degree: 2014, Washington State University

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

► *Subgraph* search is the problem of searching a data graph for the occurrences of another graph, typically referred to as the query or pattern graph.…
(more)

Subjects/Keywords: Computer science; graph database; graph search; query optimization; streaming graph; subgraph isomorphism

…4
2.1
Illustration of the search process for *Subgraph* *Isomorphism*… …areas. The first one, *subgraph*
*isomorphism*, requires finding a *subgraph* in the query graph… …*subgraph* *isomorphism*. For
example, graph homomorphism relaxes the bijective mapping criteria… …defines *subgraph* query
or *subgraph* search as pertaining to *subgraph* *isomorphism*. *Subgraph*… …*Isomorphism* Given the query graph Q and a *subgraph* G
0
of G, an *isomorphism* between Q and G…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2014). Subgraph Search for Dynamic Graphs . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/5114

Not specified: Masters Thesis or Doctoral Dissertation

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

author], [No. “Subgraph Search for Dynamic Graphs .” 2014. Thesis, Washington State University. Accessed July 19, 2019. http://hdl.handle.net/2376/5114.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Subgraph Search for Dynamic Graphs .” 2014. Web. 19 Jul 2019.

Vancouver:

author] [. Subgraph Search for Dynamic Graphs . [Internet] [Thesis]. Washington State University; 2014. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2376/5114.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Subgraph Search for Dynamic Graphs . [Thesis]. Washington State University; 2014. Available from: http://hdl.handle.net/2376/5114

Not specified: Masters Thesis or Doctoral Dissertation

12. van der Zanden, Tom Cornelis. Theory and Practical Applications of Treewidth.

Degree: 2019, University Utrecht

URL: http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134

► This thesis studies the theory and practical applications of separator-based dynamic programming (and in particular treewidth) for solving combinatorial problems in graphs. The thesis consists…
(more)

Subjects/Keywords: treewidth; graph theory; exponential time hypothesis; centrality measures; subgraph isomorphism; complexity; algorithms; geometric intersection graphs; Shapley value

Record Details Similar Records

❌

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

APA (6^{th} Edition):

van der Zanden, T. C. (2019). Theory and Practical Applications of Treewidth. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134

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

van der Zanden, Tom Cornelis. “Theory and Practical Applications of Treewidth.” 2019. Doctoral Dissertation, University Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134.

MLA Handbook (7^{th} Edition):

van der Zanden, Tom Cornelis. “Theory and Practical Applications of Treewidth.” 2019. Web. 19 Jul 2019.

Vancouver:

van der Zanden TC. Theory and Practical Applications of Treewidth. [Internet] [Doctoral dissertation]. University Utrecht; 2019. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134.

Council of Science Editors:

van der Zanden TC. Theory and Practical Applications of Treewidth. [Doctoral Dissertation]. University Utrecht; 2019. Available from: http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134

Brno University of Technology

13. Stejskal, Roman. Zjišťování izomorfizmu grafů v databázi .

Degree: 2008, Brno University of Technology

URL: http://hdl.handle.net/11012/53250

► Tato práce seznamuje s historií a základními pojmy teorie grafů. Popisuje problémy teorie grafů, možnou reprezentaci grafů a praktickou správu grafů v databázích. Zaměřuje se…
(more)

Subjects/Keywords: Teorie grafů; reprezentace grafů; problémy teorie grafů; problém izomorfizmu; správa grafů v databázi; izomorfizmus podgrafů a grafů v databázi; Graph theory; graph theory problems; isomorphism problem; management graphs in database; subgraph and graph isomorphism in database

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stejskal, R. (2008). Zjišťování izomorfizmu grafů v databázi . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53250

Not specified: Masters Thesis or Doctoral Dissertation

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

Stejskal, Roman. “Zjišťování izomorfizmu grafů v databázi .” 2008. Thesis, Brno University of Technology. Accessed July 19, 2019. http://hdl.handle.net/11012/53250.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Stejskal, Roman. “Zjišťování izomorfizmu grafů v databázi .” 2008. Web. 19 Jul 2019.

Vancouver:

Stejskal R. Zjišťování izomorfizmu grafů v databázi . [Internet] [Thesis]. Brno University of Technology; 2008. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/11012/53250.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stejskal R. Zjišťování izomorfizmu grafů v databázi . [Thesis]. Brno University of Technology; 2008. Available from: http://hdl.handle.net/11012/53250

Not specified: Masters Thesis or Doctoral Dissertation

14. Ray, Baishakhi. Analysis of cross-system porting and porting errors in software projects.

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

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

► Software forking – creating a variant product by copying and modifying an existing project – is often considered an ad hoc, low cost alternative to principled product…
(more)

Subjects/Keywords: Software evolution; Forking; Porting; Repetitive changes; Code clones; Static analysis; Subgraph isomorphism; Bug; Error detection; Copy-paste error

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ray, B. (2013). Analysis of cross-system porting and porting errors in software projects. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/22103

Not specified: Masters Thesis or Doctoral Dissertation

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

Ray, Baishakhi. “Analysis of cross-system porting and porting errors in software projects.” 2013. Thesis, University of Texas – Austin. Accessed July 19, 2019. http://hdl.handle.net/2152/22103.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ray, Baishakhi. “Analysis of cross-system porting and porting errors in software projects.” 2013. Web. 19 Jul 2019.

Vancouver:

Ray B. Analysis of cross-system porting and porting errors in software projects. [Internet] [Thesis]. University of Texas – Austin; 2013. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2152/22103.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ray B. Analysis of cross-system porting and porting errors in software projects. [Thesis]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/22103

Not specified: Masters Thesis or Doctoral Dissertation