Advanced search options

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

You searched for `subject:( m Best Graph Matching)`

.
Showing records 1 – 30 of
13991 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (4507)
- 2011 – 2015 (5584)
- 2006 – 2010 (2824)
- 2001 – 2005 (784)
- 1996 – 2000 (309)
- 1991 – 1995 (176)
- 1986 – 1990 (132)
- 1981 – 1985 (91)
- 1976 – 1980 (56)
- 1971 – 1975 (51)

Universities

- Università di Bologna (571)
- Brno University of Technology (515)
- Università Cattolica del Sacro Cuore (387)
- University of Huddersfield (269)
- University of Trento (208)
- University of Waterloo (207)
- Università degli Studi di Milano (206)
- Texas A&M University (201)
- Delft University of Technology (184)
- Virginia Tech (173)
- NSYSU (169)
- University of Florida (167)
- Georgia Tech (158)
- The Ohio State University (154)
- University of Illinois – Urbana-Champaign (145)

Department

- Computer Science (326)
- Informatique (293)
- Mathematics (281)
- Electrical and Computer Engineering (149)
- Electrical Engineering (111)
- Economics (88)
- Mathematical Sciences (83)
- Computer Science and Engineering (81)
- College of Arts & Law (76)
- Psychology (55)
- Mechanical Engineering (53)
- English (42)
- Physics (42)
- Social Work (41)
- Statistics (40)

Degrees

- PhD (2744)
- MS (894)
- Docteur es (785)
- Master (241)
- MA (188)
- Mestrado (76)
- d_ph (48)
- M. Arch. (31)
- MS(M.S.) (30)
- EdD (28)
- MAin Mathematics (15)
- MSin Engineering (15)
- MSc (13)
- MSs (12)
- Thesis (D.Mus.) (12)

Levels

- doctoral (4871)
- masters (2184)
- thesis (202)
- d_ph (48)
- mmus(r) (36)
- doctor of philosophy ph.d. (35)
- doctor of philosophy (ph.d.) (14)
- m_mmus (12)
- 1 (11)
- m_ph (11)

Languages

Country

- US (4059)
- Italy (1692)
- UK (1198)
- Canada (1025)
- France (785)
- Sweden (703)
- Brazil (641)
- Czech Republic (520)
- Netherlands (386)
- South Africa (342)
- Australia (338)
- Greece (262)
- India (254)
- Portugal (247)
- Taiwan (169)

▼ Search Limiters

1. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

URL: http://hdl.handle.net/10045/98110

► In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and *graph* (global) similarity. Concerning node…
(more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

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

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed July 14, 2020. http://hdl.handle.net/10045/98110.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 14 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10045/98110.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

2. Ye, Jiacheng. Computing Exact Bottleneck Distance on Random Point Sets.

Degree: MS, Computer Science and Applications, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/98669

► Consider the problem of *matching* taxis to an equal number of requests. While *matching* them, one objective is to minimize the largest distance between a…
(more)

Subjects/Keywords: bipartite graph; bottleneck matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ye, J. (2020). Computing Exact Bottleneck Distance on Random Point Sets. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/98669

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

Ye, Jiacheng. “Computing Exact Bottleneck Distance on Random Point Sets.” 2020. Masters Thesis, Virginia Tech. Accessed July 14, 2020. http://hdl.handle.net/10919/98669.

MLA Handbook (7^{th} Edition):

Ye, Jiacheng. “Computing Exact Bottleneck Distance on Random Point Sets.” 2020. Web. 14 Jul 2020.

Vancouver:

Ye J. Computing Exact Bottleneck Distance on Random Point Sets. [Internet] [Masters thesis]. Virginia Tech; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10919/98669.

Council of Science Editors:

Ye J. Computing Exact Bottleneck Distance on Random Point Sets. [Masters Thesis]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/98669

University of Edinburgh

3.
Wu, Yinghui.
Extending *graph* homomorphism and simulation for real life *graph* * matching*.

Degree: PhD, 2011, University of Edinburgh

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

► Among the vital problems in a variety of emerging applications is the *graph* *matching* problem, which is to determine whether two graphs are similar, and…
(more)

Subjects/Keywords: 005.3; graph matching; homomorphism; simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, Y. (2011). Extending graph homomorphism and simulation for real life graph matching. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5022

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

Wu, Yinghui. “Extending graph homomorphism and simulation for real life graph matching.” 2011. Doctoral Dissertation, University of Edinburgh. Accessed July 14, 2020. http://hdl.handle.net/1842/5022.

MLA Handbook (7^{th} Edition):

Wu, Yinghui. “Extending graph homomorphism and simulation for real life graph matching.” 2011. Web. 14 Jul 2020.

Vancouver:

Wu Y. Extending graph homomorphism and simulation for real life graph matching. [Internet] [Doctoral dissertation]. University of Edinburgh; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1842/5022.

Council of Science Editors:

Wu Y. Extending graph homomorphism and simulation for real life graph matching. [Doctoral Dissertation]. University of Edinburgh; 2011. Available from: http://hdl.handle.net/1842/5022

Case Western Reserve University

4.
Yang, Cheng.
* Graph* by Example: an Exploratory

Degree: MSs, EECS - Computer and Information Sciences, 2016, Case Western Reserve University

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

► Query interface is an important tool in accessing *graph* databases. Traditional text-based query interfaces only provide access to databases through text queries and results, without…
(more)

Subjects/Keywords: Computer Science; RDF Query, Graph Template Matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, C. (2016). Graph by Example: an Exploratory Graph Query Interface for RDF Databases. (Masters Thesis). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1445863762

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

Yang, Cheng. “Graph by Example: an Exploratory Graph Query Interface for RDF Databases.” 2016. Masters Thesis, Case Western Reserve University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1445863762.

MLA Handbook (7^{th} Edition):

Yang, Cheng. “Graph by Example: an Exploratory Graph Query Interface for RDF Databases.” 2016. Web. 14 Jul 2020.

Vancouver:

Yang C. Graph by Example: an Exploratory Graph Query Interface for RDF Databases. [Internet] [Masters thesis]. Case Western Reserve University; 2016. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1445863762.

Council of Science Editors:

Yang C. Graph by Example: an Exploratory Graph Query Interface for RDF Databases. [Masters Thesis]. Case Western Reserve University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1445863762

Case Western Reserve University

5.
Zhang, Shijie.
Index-based *Graph* Querying and *Matching* in Large
Graphs.

Degree: PhD, EECS - Computer and Information Sciences, 2010, Case Western Reserve University

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

► Currently, a huge amount data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The size of an application *graph*…
(more)

Subjects/Keywords: Computer Science; graph indexing matching subgraph serach

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, S. (2010). Index-based Graph Querying and Matching in Large Graphs. (Doctoral Dissertation). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028

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

Zhang, Shijie. “Index-based Graph Querying and Matching in Large Graphs.” 2010. Doctoral Dissertation, Case Western Reserve University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.

MLA Handbook (7^{th} Edition):

Zhang, Shijie. “Index-based Graph Querying and Matching in Large Graphs.” 2010. Web. 14 Jul 2020.

Vancouver:

Zhang S. Index-based Graph Querying and Matching in Large Graphs. [Internet] [Doctoral dissertation]. Case Western Reserve University; 2010. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.

Council of Science Editors:

Zhang S. Index-based Graph Querying and Matching in Large Graphs. [Doctoral Dissertation]. Case Western Reserve University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028

University of Louisville

6. Caragianis, Christopher James, 1980-. Connected matchings in special families of graphs.

Degree: PhD, 2012, University of Louisville

URL: 10.18297/etd/206 ; https://ir.library.louisville.edu/etd/206

► A connected *matching* in a *graph* is a set of disjoint edges such that, for any pair of these edges, there is another edge of…
(more)

Subjects/Keywords: Connected; Hadwiger; matching; independence; graph; chordal bipartite

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Caragianis, Christopher James, 1. (2012). Connected matchings in special families of graphs. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/206 ; https://ir.library.louisville.edu/etd/206

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

Caragianis, Christopher James, 1980-. “Connected matchings in special families of graphs.” 2012. Doctoral Dissertation, University of Louisville. Accessed July 14, 2020. 10.18297/etd/206 ; https://ir.library.louisville.edu/etd/206.

MLA Handbook (7^{th} Edition):

Caragianis, Christopher James, 1980-. “Connected matchings in special families of graphs.” 2012. Web. 14 Jul 2020.

Vancouver:

Caragianis, Christopher James 1. Connected matchings in special families of graphs. [Internet] [Doctoral dissertation]. University of Louisville; 2012. [cited 2020 Jul 14]. Available from: 10.18297/etd/206 ; https://ir.library.louisville.edu/etd/206.

Council of Science Editors:

Caragianis, Christopher James 1. Connected matchings in special families of graphs. [Doctoral Dissertation]. University of Louisville; 2012. Available from: 10.18297/etd/206 ; https://ir.library.louisville.edu/etd/206

University of New South Wales

7.
Zhu, Gaoping.
Efficient algorithms for *graph* all-*matching* and containment search.

Degree: Computer Science & Engineering, 2012, University of New South Wales

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

► Recent advances in database research have shown the potential of *graph* in modellingcomplicated data. *Graph* data have pervaded many modern applicationsincluding bio-informatics, chem-informatics, semantic webs,…
(more)

Subjects/Keywords: Similarity All-Matching; Graph Database; Containment Search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhu, G. (2012). Efficient algorithms for graph all-matching and containment search. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true

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

Zhu, Gaoping. “Efficient algorithms for graph all-matching and containment search.” 2012. Doctoral Dissertation, University of New South Wales. Accessed July 14, 2020. http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Zhu, Gaoping. “Efficient algorithms for graph all-matching and containment search.” 2012. Web. 14 Jul 2020.

Vancouver:

Zhu G. Efficient algorithms for graph all-matching and containment search. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2020 Jul 14]. Available from: http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true.

Council of Science Editors:

Zhu G. Efficient algorithms for graph all-matching and containment search. [Doctoral Dissertation]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true

Virginia Tech

8.
Lahn, Nathaniel Adam.
A Separator-Based Framework for *Graph* *Matching* Problems.

Degree: PhD, Computer Science and Applications, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/98618

► Assume we are given a list of objects, and a list of compatible pairs of these objects. A *matching* consists of a chosen subset of…
(more)

Subjects/Keywords: Matching; graphs; graph separators; combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lahn, N. A. (2020). A Separator-Based Framework for Graph Matching Problems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/98618

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

Lahn, Nathaniel Adam. “A Separator-Based Framework for Graph Matching Problems.” 2020. Doctoral Dissertation, Virginia Tech. Accessed July 14, 2020. http://hdl.handle.net/10919/98618.

MLA Handbook (7^{th} Edition):

Lahn, Nathaniel Adam. “A Separator-Based Framework for Graph Matching Problems.” 2020. Web. 14 Jul 2020.

Vancouver:

Lahn NA. A Separator-Based Framework for Graph Matching Problems. [Internet] [Doctoral dissertation]. Virginia Tech; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10919/98618.

Council of Science Editors:

Lahn NA. A Separator-Based Framework for Graph Matching Problems. [Doctoral Dissertation]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/98618

University of Illinois – Urbana-Champaign

9.
Singhal, Kushagra.
Understanding the importance of side information in *graph* *matching* problem.

Degree: MS, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/95467

► *Graph* *matching* algorithms rely on the availability of seed vertex pairs as side information to deanonymize users across networks. Although such algorithms work well in…
(more)

Subjects/Keywords: graph matching; privacy; deanonymization; side information

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Singhal, K. (2016). Understanding the importance of side information in graph matching problem. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95467

Not specified: Masters Thesis or Doctoral Dissertation

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

Singhal, Kushagra. “Understanding the importance of side information in graph matching problem.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/95467.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Singhal, Kushagra. “Understanding the importance of side information in graph matching problem.” 2016. Web. 14 Jul 2020.

Vancouver:

Singhal K. Understanding the importance of side information in graph matching problem. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/95467.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Singhal K. Understanding the importance of side information in graph matching problem. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95467

Not specified: Masters Thesis or Doctoral Dissertation

California State University – Sacramento

10.
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 July 14, 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. 14 Jul 2020.

Vancouver:

Meyer AG. Canonical forms, over-coloring, and polytime graph isomorphism. [Internet] [Masters thesis]. California State University – Sacramento; 2019. [cited 2020 Jul 14]. 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 Cincinnati

11.
Dunham, Brandan.
Mutually Exclusive Weighted *Graph* *Matching* Algorithm for
Protein-Protein Interaction Network Alignment.

Degree: MS, Engineering and Applied Science: Computer Science, 2016, University of Cincinnati

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

► Motivation: Understanding and analyzing proteins interacting within a species is atopic of interest in various biological studies. These interactions can be aligned as a fullnetwork,…
(more)

Subjects/Keywords: Computer Science; protein interaction; weighted graph matching; Mutual Exclusion Matching; subisomorphism; graph alignment

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dunham, B. (2016). Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019

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

Dunham, Brandan. “Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment.” 2016. Masters Thesis, University of Cincinnati. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019.

MLA Handbook (7^{th} Edition):

Dunham, Brandan. “Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment.” 2016. Web. 14 Jul 2020.

Vancouver:

Dunham B. Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment. [Internet] [Masters thesis]. University of Cincinnati; 2016. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019.

Council of Science Editors:

Dunham B. Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment. [Masters Thesis]. University of Cincinnati; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019

12. Rebai, Salma. Resource allocation in Cloud federation : Allocation et fédération des ressources informatiques dans le Cloud.

Degree: Docteur es, Informatique et télécommunications, 2017, Evry, Institut national des télécommunications

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

► L'informatique en nuage (Cloud Computing) est un modèle à grande échelle et en évolution continue, permettant le provisionnement et l'utilisation des ressources informatiques à la…
(more)

Subjects/Keywords: Fédération de clouds; Optimisation du profit; Allocation distribuée; Partitionnement de graphes; Programme linéaire en nombre entiers; Décomposition des graphes; Arbre de Gomory-Hu; Stratégie de meilleur ajustement; Cloud federation; Profit optimization; Distributed allocation; Request splitting; Linear integer programming; Graph decomposition; Gomory-Hu tree; Best-Fit matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rebai, S. (2017). Resource allocation in Cloud federation : Allocation et fédération des ressources informatiques dans le Cloud. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2017TELE0006

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

Rebai, Salma. “Resource allocation in Cloud federation : Allocation et fédération des ressources informatiques dans le Cloud.” 2017. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed July 14, 2020. http://www.theses.fr/2017TELE0006.

MLA Handbook (7^{th} Edition):

Rebai, Salma. “Resource allocation in Cloud federation : Allocation et fédération des ressources informatiques dans le Cloud.” 2017. Web. 14 Jul 2020.

Vancouver:

Rebai S. Resource allocation in Cloud federation : Allocation et fédération des ressources informatiques dans le Cloud. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2017. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2017TELE0006.

Council of Science Editors:

Rebai S. Resource allocation in Cloud federation : Allocation et fédération des ressources informatiques dans le Cloud. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2017. Available from: http://www.theses.fr/2017TELE0006

University of Georgia

13. 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 14, 2020. http://hdl.handle.net/10724/38281.

MLA Handbook (7^{th} Edition):

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

Vancouver:

Bernaola Ibarra LA. Improving the dual cardinality simulation algorithms. [Internet] [Masters thesis]. University of Georgia; 2018. [cited 2020 Jul 14]. 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

University of Illinois – Chicago

14. Xu, Jian. Fair Resource Allocation in a Constrained Network.

Degree: 2019, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/23634

► This dissertation focuses on the properties of the fairest semi-matchings in bipartite graphs. The previous works related to the semi-*matching* problem, mainly focus on the…
(more)

Subjects/Keywords: Resource Allocation; Fairness; Semi-Matching; Bipartite Graph; Edge Classification; Graph Partition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xu, J. (2019). Fair Resource Allocation in a Constrained Network. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23634

Not specified: Masters Thesis or Doctoral Dissertation

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

Xu, Jian. “Fair Resource Allocation in a Constrained Network.” 2019. Thesis, University of Illinois – Chicago. Accessed July 14, 2020. http://hdl.handle.net/10027/23634.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xu, Jian. “Fair Resource Allocation in a Constrained Network.” 2019. Web. 14 Jul 2020.

Vancouver:

Xu J. Fair Resource Allocation in a Constrained Network. [Internet] [Thesis]. University of Illinois – Chicago; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10027/23634.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu J. Fair Resource Allocation in a Constrained Network. [Thesis]. University of Illinois – Chicago; 2019. Available from: http://hdl.handle.net/10027/23634

Not specified: Masters Thesis or Doctoral Dissertation

15. Wang, Xiaojing. Constructing Cospectral and Comatching Graphs.

Degree: 2019, University of Waterloo

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

► The *matching* polynomial is a *graph* polynomial that does not only have interesting mathematical properties, but also possesses meaningful applications in physics and chemistry. For…
(more)

Subjects/Keywords: matching polynomial; comatching; cospectral; graph theory; algebraic graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, X. (2019). Constructing Cospectral and Comatching Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14808

Not specified: Masters Thesis or Doctoral Dissertation

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

Wang, Xiaojing. “Constructing Cospectral and Comatching Graphs.” 2019. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/14808.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Xiaojing. “Constructing Cospectral and Comatching Graphs.” 2019. Web. 14 Jul 2020.

Vancouver:

Wang X. Constructing Cospectral and Comatching Graphs. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/14808.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang X. Constructing Cospectral and Comatching Graphs. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14808

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

16.
Bot, Fanny (author).
A *graph*-*matching* approach to indoor localization: using a mobile device and a reference BIM.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000

► Indoor localization provides for a much researched *subject*, as the complexity and size of many public buildings require extensive and properly designed methods to facilitate…
(more)

Subjects/Keywords: Indoor Localization; Spectral Graph Theory; Graph Matching; Mobile Device

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bot, F. (. (2019). A graph-matching approach to indoor localization: using a mobile device and a reference BIM. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000

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

Bot, Fanny (author). “A graph-matching approach to indoor localization: using a mobile device and a reference BIM.” 2019. Masters Thesis, Delft University of Technology. Accessed July 14, 2020. http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000.

MLA Handbook (7^{th} Edition):

Bot, Fanny (author). “A graph-matching approach to indoor localization: using a mobile device and a reference BIM.” 2019. Web. 14 Jul 2020.

Vancouver:

Bot F(. A graph-matching approach to indoor localization: using a mobile device and a reference BIM. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000.

Council of Science Editors:

Bot F(. A graph-matching approach to indoor localization: using a mobile device and a reference BIM. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:08073599-0267-4d85-b7c4-490c297df000

University of Georgia

17.
Ramireddy, Supriya.
Query processing in *graph* databases.

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

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

► *Graph* data are extensively associated with state-of-the-art applications in a variety of domains which include Linked Data and Social Media. This drives the need to…
(more)

Subjects/Keywords: Graph Databases; Graph Query Language; Graph Algebra; Query Processing; Pattern matching; Query optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ramireddy, S. (2017). Query processing in graph databases. (Masters Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/37837

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

Ramireddy, Supriya. “Query processing in graph databases.” 2017. Masters Thesis, University of Georgia. Accessed July 14, 2020. http://hdl.handle.net/10724/37837.

MLA Handbook (7^{th} Edition):

Ramireddy, Supriya. “Query processing in graph databases.” 2017. Web. 14 Jul 2020.

Vancouver:

Ramireddy S. Query processing in graph databases. [Internet] [Masters thesis]. University of Georgia; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10724/37837.

Council of Science Editors:

Ramireddy S. Query processing in graph databases. [Masters Thesis]. University of Georgia; 2017. Available from: http://hdl.handle.net/10724/37837

Penn State University

18.
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 14, 2020. https://etda.libraries.psu.edu/catalog/8897.

MLA Handbook (7^{th} Edition):

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Web. 14 Jul 2020.

Vancouver:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2020 Jul 14]. 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

Washington University in St. Louis

19.
Zhang, Zhen.
Kernel Methods for *Graph*-structured Data Analysis.

Degree: PhD, Electrical & Systems Engineering, 2019, Washington University in St. Louis

URL: https://openscholarship.wustl.edu/eng_etds/505

► Structured data modeled as graphs arise in many application domains, such as computer vision, bioinformatics, and sociology. In this dissertation, we focus on three important…
(more)

Subjects/Keywords: graph embedding; graph kernels; graph matching; kernel methods; network science; Electrical and Electronics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, Z. (2019). Kernel Methods for Graph-structured Data Analysis. (Doctoral Dissertation). Washington University in St. Louis. Retrieved from https://openscholarship.wustl.edu/eng_etds/505

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

Zhang, Zhen. “Kernel Methods for Graph-structured Data Analysis.” 2019. Doctoral Dissertation, Washington University in St. Louis. Accessed July 14, 2020. https://openscholarship.wustl.edu/eng_etds/505.

MLA Handbook (7^{th} Edition):

Zhang, Zhen. “Kernel Methods for Graph-structured Data Analysis.” 2019. Web. 14 Jul 2020.

Vancouver:

Zhang Z. Kernel Methods for Graph-structured Data Analysis. [Internet] [Doctoral dissertation]. Washington University in St. Louis; 2019. [cited 2020 Jul 14]. Available from: https://openscholarship.wustl.edu/eng_etds/505.

Council of Science Editors:

Zhang Z. Kernel Methods for Graph-structured Data Analysis. [Doctoral Dissertation]. Washington University in St. Louis; 2019. Available from: https://openscholarship.wustl.edu/eng_etds/505

Freie Universität Berlin

20. Godau, Michael. Über die Komplexität der Bestimmung der Ähnlichkeit von geometrischen Objekten in höheren Dimensionen.

Degree: 1999, Freie Universität Berlin

URL: http://dx.doi.org/10.17169/refubium-7780

► In der Mustererkennung und der Qualitätskontrolle ist der Vergleich geometrischer Objekte ein oft betrachtetes Problem. Um die Ähnlichkeit zwischen Objekten in Zahlen zu fassen, ist…
(more)

Subjects/Keywords: computational geometry; pattern matching; Fréchet metric; NP; graph drawing; F.2.m; 68Q15; 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Godau, M. (1999). Über die Komplexität der Bestimmung der Ähnlichkeit von geometrischen Objekten in höheren Dimensionen. (Thesis). Freie Universität Berlin. Retrieved from http://dx.doi.org/10.17169/refubium-7780

Not specified: Masters Thesis or Doctoral Dissertation

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

Godau, Michael. “Über die Komplexität der Bestimmung der Ähnlichkeit von geometrischen Objekten in höheren Dimensionen.” 1999. Thesis, Freie Universität Berlin. Accessed July 14, 2020. http://dx.doi.org/10.17169/refubium-7780.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Godau, Michael. “Über die Komplexität der Bestimmung der Ähnlichkeit von geometrischen Objekten in höheren Dimensionen.” 1999. Web. 14 Jul 2020.

Vancouver:

Godau M. Über die Komplexität der Bestimmung der Ähnlichkeit von geometrischen Objekten in höheren Dimensionen. [Internet] [Thesis]. Freie Universität Berlin; 1999. [cited 2020 Jul 14]. Available from: http://dx.doi.org/10.17169/refubium-7780.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Godau M. Über die Komplexität der Bestimmung der Ähnlichkeit von geometrischen Objekten in höheren Dimensionen. [Thesis]. Freie Universität Berlin; 1999. Available from: http://dx.doi.org/10.17169/refubium-7780

Not specified: Masters Thesis or Doctoral Dissertation

21.
Bansal, Mayank.
Disparate View * Matching*.

Degree: 2015, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/1012

► *Matching* of disparate views has gained significance in computer vision due to its role in many novel application areas. Being able to match images of…
(more)

Subjects/Keywords: Computer Vision; Correspondenceless; Geo-localization; Graph Matching; Image Matching; Spectral Correspondence; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bansal, M. (2015). Disparate View Matching. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/1012

Not specified: Masters Thesis or Doctoral Dissertation

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

Bansal, Mayank. “Disparate View Matching.” 2015. Thesis, University of Pennsylvania. Accessed July 14, 2020. https://repository.upenn.edu/edissertations/1012.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bansal, Mayank. “Disparate View Matching.” 2015. Web. 14 Jul 2020.

Vancouver:

Bansal M. Disparate View Matching. [Internet] [Thesis]. University of Pennsylvania; 2015. [cited 2020 Jul 14]. Available from: https://repository.upenn.edu/edissertations/1012.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bansal M. Disparate View Matching. [Thesis]. University of Pennsylvania; 2015. Available from: https://repository.upenn.edu/edissertations/1012

Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

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

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 14, 2020. http://hdl.handle.net/2078.1/12737.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

University of Illinois – Chicago

23.
Hardwick, John.
Graphical Algorithms for Finding the Nucleolus of Binary-Valued *Matching* Games.

Degree: 2017, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21740

► In cooperative game theory, the class of assignment games models a hypothetical market with two groups of people (for instance, buyers and sellers, or men…
(more)

Subjects/Keywords: game theory; cooperative game theory; nucleolus; assignment game; matching; graph theory; directed graph; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hardwick, J. (2017). Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21740

Not specified: Masters Thesis or Doctoral Dissertation

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

Hardwick, John. “Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.” 2017. Thesis, University of Illinois – Chicago. Accessed July 14, 2020. http://hdl.handle.net/10027/21740.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hardwick, John. “Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.” 2017. Web. 14 Jul 2020.

Vancouver:

Hardwick J. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10027/21740.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hardwick J. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21740

Not specified: Masters Thesis or Doctoral Dissertation

24. Zang, Chuanyun. Matchings and Tilings in Hypergraphs.

Degree: PhD, Mathematics and Statistics, 2016, Georgia State University

URL: https://scholarworks.gsu.edu/math_diss/31

► We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of *graph* (k = 2)…
(more)

Subjects/Keywords: Absorbing method; Regularity lemma; Perfect matching; Graph tiling; Graph packing; Minimum degree.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zang, C. (2016). Matchings and Tilings in Hypergraphs. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_diss/31

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

Zang, Chuanyun. “Matchings and Tilings in Hypergraphs.” 2016. Doctoral Dissertation, Georgia State University. Accessed July 14, 2020. https://scholarworks.gsu.edu/math_diss/31.

MLA Handbook (7^{th} Edition):

Zang, Chuanyun. “Matchings and Tilings in Hypergraphs.” 2016. Web. 14 Jul 2020.

Vancouver:

Zang C. Matchings and Tilings in Hypergraphs. [Internet] [Doctoral dissertation]. Georgia State University; 2016. [cited 2020 Jul 14]. Available from: https://scholarworks.gsu.edu/math_diss/31.

Council of Science Editors:

Zang C. Matchings and Tilings in Hypergraphs. [Doctoral Dissertation]. Georgia State University; 2016. Available from: https://scholarworks.gsu.edu/math_diss/31

University of Illinois – Urbana-Champaign

25. Jahanbekam, Sogol. Extremal problems for labelling of graphs and distance in digraphs.

Degree: PhD, 0439, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/45527

► We study several extremal problems in *graph* labelling and in weak diameter of digraphs. In Chapter 2 we apply the Discharging Method to prove the…
(more)

Subjects/Keywords: Graph Coloring; Graph Labelling; Ramsey Numbers; AntiRamsey Graph Theory; Weak Diameter in Digraphs; Matching in Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jahanbekam, S. (2013). Extremal problems for labelling of graphs and distance in digraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45527

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

Jahanbekam, Sogol. “Extremal problems for labelling of graphs and distance in digraphs.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/45527.

MLA Handbook (7^{th} Edition):

Jahanbekam, Sogol. “Extremal problems for labelling of graphs and distance in digraphs.” 2013. Web. 14 Jul 2020.

Vancouver:

Jahanbekam S. Extremal problems for labelling of graphs and distance in digraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/45527.

Council of Science Editors:

Jahanbekam S. Extremal problems for labelling of graphs and distance in digraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45527

26.
Ma, Fei.
Registration of mass-like objects in sequential mammograms using *graph* * matching*.

Degree: Flinders University

URL: http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20090323.155040

► Sequential mammograms contain important information, such as changes of the breast or developments of the masses, for diagnosis of disease. Comparison of sequential mammograms plays…
(more)

Subjects/Keywords: mammography; registration; detection; graph matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ma, F. (n.d.). Registration of mass-like objects in sequential mammograms using graph matching. (Thesis). Flinders University. Retrieved from http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20090323.155040

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

No year of publication.

Not specified: Masters Thesis or Doctoral Dissertation

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

Ma, Fei. “Registration of mass-like objects in sequential mammograms using graph matching.” Thesis, Flinders University. Accessed July 14, 2020. http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20090323.155040.

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

No year of publication.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ma, Fei. “Registration of mass-like objects in sequential mammograms using graph matching.” Web. 14 Jul 2020.

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

No year of publication.

Vancouver:

Ma F. Registration of mass-like objects in sequential mammograms using graph matching. [Internet] [Thesis]. Flinders University; [cited 2020 Jul 14]. Available from: http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20090323.155040.

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

Not specified: Masters Thesis or Doctoral Dissertation

No year of publication.

Council of Science Editors:

Ma F. Registration of mass-like objects in sequential mammograms using graph matching. [Thesis]. Flinders University; Available from: http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20090323.155040

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

Not specified: Masters Thesis or Doctoral Dissertation

No year of publication.

Case Western Reserve University

27.
Li, Shirong.
A FRAMEWORK FOR SAMPLING PATTERN OCCURRENCES IN A HUGE
* GRAPH*.

Degree: MSs, EECS - Computer and Information Sciences, 2010, Case Western Reserve University

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

► In many applications, e.g., computational biology, software engineering, social networks, etc., a large amount of data can be represented as huge graphs. Discovery of occurrences…
(more)

Subjects/Keywords: Computer Science; Graph; subgraph matching; occurrence estimation; occurrence sampling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, S. (2010). A FRAMEWORK FOR SAMPLING PATTERN OCCURRENCES IN A HUGE GRAPH. (Masters Thesis). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1269979693

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

Li, Shirong. “A FRAMEWORK FOR SAMPLING PATTERN OCCURRENCES IN A HUGE GRAPH.” 2010. Masters Thesis, Case Western Reserve University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1269979693.

MLA Handbook (7^{th} Edition):

Li, Shirong. “A FRAMEWORK FOR SAMPLING PATTERN OCCURRENCES IN A HUGE GRAPH.” 2010. Web. 14 Jul 2020.

Vancouver:

Li S. A FRAMEWORK FOR SAMPLING PATTERN OCCURRENCES IN A HUGE GRAPH. [Internet] [Masters thesis]. Case Western Reserve University; 2010. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1269979693.

Council of Science Editors:

Li S. A FRAMEWORK FOR SAMPLING PATTERN OCCURRENCES IN A HUGE GRAPH. [Masters Thesis]. Case Western Reserve University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1269979693

Penn State University

28.
Li, Zhenyao.
Greedy Algorithm for approximating maximum induced
* matching*.

Degree: MS, Computer Science and Engineering, 2014, Penn State University

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

► An induced *matching* in a *graph* G=(V,E) is *M*\subseteq E such that it is a *matching* and also the edge set of an induced subgraph…
(more)

Subjects/Keywords: graph theory; combinatorial problem; approximation algorithms; induced matching; greedy algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Z. (2014). Greedy Algorithm for approximating maximum induced matching. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/22793

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

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Masters Thesis, Penn State University. Accessed July 14, 2020. https://etda.libraries.psu.edu/catalog/22793.

MLA Handbook (7^{th} Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Web. 14 Jul 2020.

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2020 Jul 14]. Available from: https://etda.libraries.psu.edu/catalog/22793.

Council of Science Editors:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/22793

University of California – San Diego

29.
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 July 14, 2020. 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 Jul 2020.

Vancouver:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Jul 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

30.
Sun, Ming.
Data Fusion via Manifold * Matching*.

Degree: 2013, Johns Hopkins University

URL: http://jhir.library.jhu.edu/handle/1774.2/37023

► Data fusion has been an interesting and challenging research topic, which receives intensive investigation in many areas. The theory and practice of data fusion -…
(more)

Subjects/Keywords: manifold matching; cross-language text classification; graph vertex nomination; inferential variability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sun, M. (2013). Data Fusion via Manifold Matching. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37023

Not specified: Masters Thesis or Doctoral Dissertation

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

Sun, Ming. “Data Fusion via Manifold Matching.” 2013. Thesis, Johns Hopkins University. Accessed July 14, 2020. http://jhir.library.jhu.edu/handle/1774.2/37023.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sun, Ming. “Data Fusion via Manifold Matching.” 2013. Web. 14 Jul 2020.

Vancouver:

Sun M. Data Fusion via Manifold Matching. [Internet] [Thesis]. Johns Hopkins University; 2013. [cited 2020 Jul 14]. Available from: http://jhir.library.jhu.edu/handle/1774.2/37023.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sun M. Data Fusion via Manifold Matching. [Thesis]. Johns Hopkins University; 2013. Available from: http://jhir.library.jhu.edu/handle/1774.2/37023

Not specified: Masters Thesis or Doctoral Dissertation