Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(bipartite graph). Showing records 1 – 30 of 51 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

▼ Search Limiters


Virginia Tech

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Ye J. Computing Exact Bottleneck Distance on Random Point Sets. [Internet] [Masters thesis]. Virginia Tech; 2020. [cited 2020 Aug 08]. 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


NSYSU

2. Chang, Chia-Jung. Triangle-free subcubic graphs with small bipartite density.

Degree: Master, Applied Mathematics, 2008, NSYSU

 Suppose G is a graph with n vertices and m edges. Let nâ² be the maximum number of vertices in an induced bipartite subgraph of… (more)

Subjects/Keywords: planar graph; triangle-free; subcubic; bipartite density; bipartite ratio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, C. (2008). Triangle-free subcubic graphs with small bipartite density. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chang, Chia-Jung. “Triangle-free subcubic graphs with small bipartite density.” 2008. Thesis, NSYSU. Accessed August 08, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chang, Chia-Jung. “Triangle-free subcubic graphs with small bipartite density.” 2008. Web. 08 Aug 2020.

Vancouver:

Chang C. Triangle-free subcubic graphs with small bipartite density. [Internet] [Thesis]. NSYSU; 2008. [cited 2020 Aug 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chang C. Triangle-free subcubic graphs with small bipartite density. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Sandhya, S S. Harmonic mean labelings of graphs;.

Degree: 2015, Manonmaniam Sundaranar University

Graph theory has had a tremendous development in recent times newlineit is a delightful ground for the exploration of proof techniques in newlinediscrete mathematics and… (more)

Subjects/Keywords: bipartite graph; Harmonic; labelings of graphs; terminology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sandhya, S. S. (2015). Harmonic mean labelings of graphs;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/40795

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sandhya, S S. “Harmonic mean labelings of graphs;.” 2015. Thesis, Manonmaniam Sundaranar University. Accessed August 08, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/40795.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sandhya, S S. “Harmonic mean labelings of graphs;.” 2015. Web. 08 Aug 2020.

Vancouver:

Sandhya SS. Harmonic mean labelings of graphs;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2015. [cited 2020 Aug 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/40795.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sandhya SS. Harmonic mean labelings of graphs;. [Thesis]. Manonmaniam Sundaranar University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/40795

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Louisville

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

Degree: PhD, 2012, University of Louisville

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Caragianis, Christopher James 1. Connected matchings in special families of graphs. [Internet] [Doctoral dissertation]. University of Louisville; 2012. [cited 2020 Aug 08]. 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 Waikato

5. Lim, Jin Sean. Star Decompositions of Bipartite Graphs .

Degree: 2015, University of Waikato

 In Chapter 1, we will introduce the definitions and the notations used throughout this thesis. We will also survey some prior research pertaining to graph(more)

Subjects/Keywords: Graph Decomposition; Bipartite; Star Graphs; Multipartite

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lim, J. S. (2015). Star Decompositions of Bipartite Graphs . (Masters Thesis). University of Waikato. Retrieved from http://hdl.handle.net/10289/9303

Chicago Manual of Style (16th Edition):

Lim, Jin Sean. “Star Decompositions of Bipartite Graphs .” 2015. Masters Thesis, University of Waikato. Accessed August 08, 2020. http://hdl.handle.net/10289/9303.

MLA Handbook (7th Edition):

Lim, Jin Sean. “Star Decompositions of Bipartite Graphs .” 2015. Web. 08 Aug 2020.

Vancouver:

Lim JS. Star Decompositions of Bipartite Graphs . [Internet] [Masters thesis]. University of Waikato; 2015. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10289/9303.

Council of Science Editors:

Lim JS. Star Decompositions of Bipartite Graphs . [Masters Thesis]. University of Waikato; 2015. Available from: http://hdl.handle.net/10289/9303


California State University – Northridge

6. Sparks, Athena C. The cylindrical crossing number of the complete bipartite graph.

Degree: MS, Department of Mathematics, 2014, California State University – Northridge

 A cylindrical drawing of the complete bipartite graph Km,n is a drawing with two disjoint sets of vertices placed on the top and bottom rims… (more)

Subjects/Keywords: Complete Bipartite Graph; Dissertations, Academic  – CSUN  – Mathematics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sparks, A. C. (2014). The cylindrical crossing number of the complete bipartite graph. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.3/121549

Chicago Manual of Style (16th Edition):

Sparks, Athena C. “The cylindrical crossing number of the complete bipartite graph.” 2014. Masters Thesis, California State University – Northridge. Accessed August 08, 2020. http://hdl.handle.net/10211.3/121549.

MLA Handbook (7th Edition):

Sparks, Athena C. “The cylindrical crossing number of the complete bipartite graph.” 2014. Web. 08 Aug 2020.

Vancouver:

Sparks AC. The cylindrical crossing number of the complete bipartite graph. [Internet] [Masters thesis]. California State University – Northridge; 2014. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10211.3/121549.

Council of Science Editors:

Sparks AC. The cylindrical crossing number of the complete bipartite graph. [Masters Thesis]. California State University – Northridge; 2014. Available from: http://hdl.handle.net/10211.3/121549


University of Windsor

7. Srivastava, Aayushi. Generating Chordal Graphs with few Fill-in Edges: An Experimental Study.

Degree: MS, Computer Science, 2020, University of Windsor

Graph Generation aids in analysis of graphs and their properties while insinuating conjectures via counterexamples and even generating test instances for other algorithms. In certain… (more)

Subjects/Keywords: Bipartite graph; Chordal Graph; Nearly Chordal Graph; Triangulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srivastava, A. (2020). Generating Chordal Graphs with few Fill-in Edges: An Experimental Study. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/8401

Chicago Manual of Style (16th Edition):

Srivastava, Aayushi. “Generating Chordal Graphs with few Fill-in Edges: An Experimental Study.” 2020. Masters Thesis, University of Windsor. Accessed August 08, 2020. https://scholar.uwindsor.ca/etd/8401.

MLA Handbook (7th Edition):

Srivastava, Aayushi. “Generating Chordal Graphs with few Fill-in Edges: An Experimental Study.” 2020. Web. 08 Aug 2020.

Vancouver:

Srivastava A. Generating Chordal Graphs with few Fill-in Edges: An Experimental Study. [Internet] [Masters thesis]. University of Windsor; 2020. [cited 2020 Aug 08]. Available from: https://scholar.uwindsor.ca/etd/8401.

Council of Science Editors:

Srivastava A. Generating Chordal Graphs with few Fill-in Edges: An Experimental Study. [Masters Thesis]. University of Windsor; 2020. Available from: https://scholar.uwindsor.ca/etd/8401


University of Illinois – Chicago

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

Degree: 2019, University of Illinois – Chicago

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Commonwealth University

9. Puffenberger, Owen. Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs.

Degree: MS, Mathematical Sciences, 2013, Virginia Commonwealth University

 While it has been known for some time that connected non-bipartite graphs have unique prime factorizations over the direct product, the same cannot be said… (more)

Subjects/Keywords: Graph direct product; Bipartite graph; Graph prime factorization; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Puffenberger, O. (2013). Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs. (Thesis). Virginia Commonwealth University. Retrieved from https://doi.org/10.25772/73B4-5J80 ; https://scholarscompass.vcu.edu/etd/3017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Puffenberger, Owen. “Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs.” 2013. Thesis, Virginia Commonwealth University. Accessed August 08, 2020. https://doi.org/10.25772/73B4-5J80 ; https://scholarscompass.vcu.edu/etd/3017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Puffenberger, Owen. “Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs.” 2013. Web. 08 Aug 2020.

Vancouver:

Puffenberger O. Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs. [Internet] [Thesis]. Virginia Commonwealth University; 2013. [cited 2020 Aug 08]. Available from: https://doi.org/10.25772/73B4-5J80 ; https://scholarscompass.vcu.edu/etd/3017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Puffenberger O. Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs. [Thesis]. Virginia Commonwealth University; 2013. Available from: https://doi.org/10.25772/73B4-5J80 ; https://scholarscompass.vcu.edu/etd/3017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

10. Czarneski, Debra. Zeta functions of finite graphs.

Degree: PhD, Applied Mathematics, 2005, Louisiana State University

 Ihara introduced the zeta function of a finite graph in 1966 in the context of <i>p</i>-adic matrix groups. The idea was generalized to all finite… (more)

Subjects/Keywords: zeta function; spectrum; biregular-bipartite graph; bipartite graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Czarneski, D. (2005). Zeta functions of finite graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07072005-121013 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1814

Chicago Manual of Style (16th Edition):

Czarneski, Debra. “Zeta functions of finite graphs.” 2005. Doctoral Dissertation, Louisiana State University. Accessed August 08, 2020. etd-07072005-121013 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1814.

MLA Handbook (7th Edition):

Czarneski, Debra. “Zeta functions of finite graphs.” 2005. Web. 08 Aug 2020.

Vancouver:

Czarneski D. Zeta functions of finite graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2005. [cited 2020 Aug 08]. Available from: etd-07072005-121013 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1814.

Council of Science Editors:

Czarneski D. Zeta functions of finite graphs. [Doctoral Dissertation]. Louisiana State University; 2005. Available from: etd-07072005-121013 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1814


Virginia Commonwealth University

11. Crenshaw, Cameron M. Edge-Transitive Bipartite Direct Products.

Degree: MS, Mathematical Sciences, 2017, Virginia Commonwealth University

  In their recent paper ``Edge-transitive products," Hammack, Imrich, and Klavzar showed that the direct product of connected, non-bipartite graphs is edge-transitive if and only… (more)

Subjects/Keywords: graph bipartite edge-transitive direct product; Discrete Mathematics and Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Crenshaw, C. M. (2017). Edge-Transitive Bipartite Direct Products. (Thesis). Virginia Commonwealth University. Retrieved from https://doi.org/10.25772/K6SD-EF93 ; https://scholarscompass.vcu.edu/etd/4801

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Crenshaw, Cameron M. “Edge-Transitive Bipartite Direct Products.” 2017. Thesis, Virginia Commonwealth University. Accessed August 08, 2020. https://doi.org/10.25772/K6SD-EF93 ; https://scholarscompass.vcu.edu/etd/4801.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Crenshaw, Cameron M. “Edge-Transitive Bipartite Direct Products.” 2017. Web. 08 Aug 2020.

Vancouver:

Crenshaw CM. Edge-Transitive Bipartite Direct Products. [Internet] [Thesis]. Virginia Commonwealth University; 2017. [cited 2020 Aug 08]. Available from: https://doi.org/10.25772/K6SD-EF93 ; https://scholarscompass.vcu.edu/etd/4801.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Crenshaw CM. Edge-Transitive Bipartite Direct Products. [Thesis]. Virginia Commonwealth University; 2017. Available from: https://doi.org/10.25772/K6SD-EF93 ; https://scholarscompass.vcu.edu/etd/4801

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

12. Jiao, Chongze (author). Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis.

Degree: 2017, Delft University of Technology

 Recent years, recommender systems are more and more important for solving information overload problem. They sort through massive data to provide users with personalized content… (more)

Subjects/Keywords: Recommender System; Collaborative Filtering; Weighted Bipartite Graph; U-I Matrix Property

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jiao, C. (. (2017). Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052

Chicago Manual of Style (16th Edition):

Jiao, Chongze (author). “Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis.” 2017. Masters Thesis, Delft University of Technology. Accessed August 08, 2020. http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052.

MLA Handbook (7th Edition):

Jiao, Chongze (author). “Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis.” 2017. Web. 08 Aug 2020.

Vancouver:

Jiao C(. Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2020 Aug 08]. Available from: http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052.

Council of Science Editors:

Jiao C(. Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052


University of New Mexico

13. Jeffries, Tanya. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.

Degree: Department of Computer Science, 2016, University of New Mexico

 The one-sided bipartite graph drawing problem has been extensively studied in the graph drawing literature, with numerous papers appearing over the years showing novel algorithms… (more)

Subjects/Keywords: bipartite; graph; drawing; crossing; minimization; stochastic; weighted; bottleneck

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jeffries, T. (2016). Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/32250

Chicago Manual of Style (16th Edition):

Jeffries, Tanya. “Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.” 2016. Masters Thesis, University of New Mexico. Accessed August 08, 2020. http://hdl.handle.net/1928/32250.

MLA Handbook (7th Edition):

Jeffries, Tanya. “Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.” 2016. Web. 08 Aug 2020.

Vancouver:

Jeffries T. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. [Internet] [Masters thesis]. University of New Mexico; 2016. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/1928/32250.

Council of Science Editors:

Jeffries T. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. [Masters Thesis]. University of New Mexico; 2016. Available from: http://hdl.handle.net/1928/32250


Université Paris-Sud – Paris XI

14. Hamzaoui, Amel. Shared-Neighbours methods for visual content structuring and mining : Structuration et découverte de contenus visuels par des méthodes basées sur les voisins partagés.

Degree: Docteur es, Informatique, 2012, Université Paris-Sud – Paris XI

Cette thèse étudie les méthodes de regroupement basées sur le principe des plus proches voisins partagés (SNN). Comme la plupart des autres approches de clustering… (more)

Subjects/Keywords: Voisins partagés; Regroupement; Multi-source; Bipartite; Graphe; Suggestion visuelle; Shared-neighbours; Clustering; Multi-source; Bipartite; Graph; Visuel suggestion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamzaoui, A. (2012). Shared-Neighbours methods for visual content structuring and mining : Structuration et découverte de contenus visuels par des méthodes basées sur les voisins partagés. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2012PA112079

Chicago Manual of Style (16th Edition):

Hamzaoui, Amel. “Shared-Neighbours methods for visual content structuring and mining : Structuration et découverte de contenus visuels par des méthodes basées sur les voisins partagés.” 2012. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed August 08, 2020. http://www.theses.fr/2012PA112079.

MLA Handbook (7th Edition):

Hamzaoui, Amel. “Shared-Neighbours methods for visual content structuring and mining : Structuration et découverte de contenus visuels par des méthodes basées sur les voisins partagés.” 2012. Web. 08 Aug 2020.

Vancouver:

Hamzaoui A. Shared-Neighbours methods for visual content structuring and mining : Structuration et découverte de contenus visuels par des méthodes basées sur les voisins partagés. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2012. [cited 2020 Aug 08]. Available from: http://www.theses.fr/2012PA112079.

Council of Science Editors:

Hamzaoui A. Shared-Neighbours methods for visual content structuring and mining : Structuration et découverte de contenus visuels par des méthodes basées sur les voisins partagés. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2012. Available from: http://www.theses.fr/2012PA112079

15. Wiselet, D. A study on e cordial labelling of graphs;.

Degree: 2014, Manonmaniam Sundaranar University

newline

Advisors/Committee Members: Nicholas, T.

Subjects/Keywords: bipartite graph; ECordial; Graphs; Regular graph; Wheel graph

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wiselet, D. (2014). A study on e cordial labelling of graphs;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26791

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wiselet, D. “A study on e cordial labelling of graphs;.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed August 08, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/26791.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wiselet, D. “A study on e cordial labelling of graphs;.” 2014. Web. 08 Aug 2020.

Vancouver:

Wiselet D. A study on e cordial labelling of graphs;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Aug 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26791.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wiselet D. A study on e cordial labelling of graphs;. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26791

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Bian, Jingyun. Grammar-Based Representations of Large Sparse Binary Matrices.

Degree: 2016, University of Waterloo

 Large sparse matrices representation is a fundamental problem in big data processing and analysis. In some applications dealing with large sparse matrices, the I/O of… (more)

Subjects/Keywords: Sparse Matrix; Grammar; Bipartite Graph

…4.2 (a) A bipartite graph B; (b) the biadjacency matrix of B… …x28;3, 3)}; (b) bipartite graph B3 − (3, 2) indicated by label… …ordered edge set of a bipartite graph. We will introduce the definition of CFBG and provide an… …5.5 Statistics of Context-free Bipartite Grammar (CFBG)… …30 4.1 Structure of a bipartite grammar coder . . . . . . . . . . . . . . . . . . . . 32… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bian, J. (2016). Grammar-Based Representations of Large Sparse Binary Matrices. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11025

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bian, Jingyun. “Grammar-Based Representations of Large Sparse Binary Matrices.” 2016. Thesis, University of Waterloo. Accessed August 08, 2020. http://hdl.handle.net/10012/11025.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bian, Jingyun. “Grammar-Based Representations of Large Sparse Binary Matrices.” 2016. Web. 08 Aug 2020.

Vancouver:

Bian J. Grammar-Based Representations of Large Sparse Binary Matrices. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10012/11025.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bian J. Grammar-Based Representations of Large Sparse Binary Matrices. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/11025

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Washington

17. Harris, Kameron Decker. This Brain Is a Mess: Inference, Random Graphs, and Biophysics to Disentangle Neuronal Networks.

Degree: PhD, 2018, University of Washington

 At first glance, the neuronal network seems like a tangled web in many areas throughout the nervous system. Often, our best guess is that such… (more)

Subjects/Keywords: Bipartite; Graph theory; Inference; Networks; Neuroscience; Rhythms; Mathematics; Neurosciences; Statistics; Applied mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harris, K. D. (2018). This Brain Is a Mess: Inference, Random Graphs, and Biophysics to Disentangle Neuronal Networks. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/40831

Chicago Manual of Style (16th Edition):

Harris, Kameron Decker. “This Brain Is a Mess: Inference, Random Graphs, and Biophysics to Disentangle Neuronal Networks.” 2018. Doctoral Dissertation, University of Washington. Accessed August 08, 2020. http://hdl.handle.net/1773/40831.

MLA Handbook (7th Edition):

Harris, Kameron Decker. “This Brain Is a Mess: Inference, Random Graphs, and Biophysics to Disentangle Neuronal Networks.” 2018. Web. 08 Aug 2020.

Vancouver:

Harris KD. This Brain Is a Mess: Inference, Random Graphs, and Biophysics to Disentangle Neuronal Networks. [Internet] [Doctoral dissertation]. University of Washington; 2018. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/1773/40831.

Council of Science Editors:

Harris KD. This Brain Is a Mess: Inference, Random Graphs, and Biophysics to Disentangle Neuronal Networks. [Doctoral Dissertation]. University of Washington; 2018. Available from: http://hdl.handle.net/1773/40831

18. Topart, Hélène. Etude d’une nouvelle classe de graphes : les graphes hypotriangulés : A class of graphs : hypochordal graphs.

Degree: Docteur es, Informatique, 2011, Paris, CNAM

Dans cette thèse, nous définissons une nouvelle classe de graphes : les graphes hypotriangulés. Les graphes hypotriangulés vérifient que pour tout chemin de longueur deux,… (more)

Subjects/Keywords: Graphe; Biparti; Arbre; Chemins disjoints; Complexité; Graph; Bipartite; Tree; Disjoint paths; Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Topart, H. (2011). Etude d’une nouvelle classe de graphes : les graphes hypotriangulés : A class of graphs : hypochordal graphs. (Doctoral Dissertation). Paris, CNAM. Retrieved from http://www.theses.fr/2011CNAM0776

Chicago Manual of Style (16th Edition):

Topart, Hélène. “Etude d’une nouvelle classe de graphes : les graphes hypotriangulés : A class of graphs : hypochordal graphs.” 2011. Doctoral Dissertation, Paris, CNAM. Accessed August 08, 2020. http://www.theses.fr/2011CNAM0776.

MLA Handbook (7th Edition):

Topart, Hélène. “Etude d’une nouvelle classe de graphes : les graphes hypotriangulés : A class of graphs : hypochordal graphs.” 2011. Web. 08 Aug 2020.

Vancouver:

Topart H. Etude d’une nouvelle classe de graphes : les graphes hypotriangulés : A class of graphs : hypochordal graphs. [Internet] [Doctoral dissertation]. Paris, CNAM; 2011. [cited 2020 Aug 08]. Available from: http://www.theses.fr/2011CNAM0776.

Council of Science Editors:

Topart H. Etude d’une nouvelle classe de graphes : les graphes hypotriangulés : A class of graphs : hypochordal graphs. [Doctoral Dissertation]. Paris, CNAM; 2011. Available from: http://www.theses.fr/2011CNAM0776


University of Southern California

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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


East Tennessee State University

20. Xia, Yan. Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge.

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

  In this thesis, we consider packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and… (more)

Subjects/Keywords: graph theory; packing; covering; bipartite graph; decomposition; 4-cycle; Discrete Mathematics and Combinatorics; Other Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, Y. (2013). Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1173

Chicago Manual of Style (16th Edition):

Xia, Yan. “Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge.” 2013. Masters Thesis, East Tennessee State University. Accessed August 08, 2020. https://dc.etsu.edu/etd/1173.

MLA Handbook (7th Edition):

Xia, Yan. “Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge.” 2013. Web. 08 Aug 2020.

Vancouver:

Xia Y. Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge. [Internet] [Masters thesis]. East Tennessee State University; 2013. [cited 2020 Aug 08]. Available from: https://dc.etsu.edu/etd/1173.

Council of Science Editors:

Xia Y. Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge. [Masters Thesis]. East Tennessee State University; 2013. Available from: https://dc.etsu.edu/etd/1173


Univerzitet u Beogradu

21. Koledin, Tamara D. Neke klase spektralno ograničenih grafova.

Degree: Matematički fakultet, 2014, Univerzitet u Beogradu

Matematika-Algebarska teorija grafova / Mathematics-Algebraic graph theory

Spektralna teorija grafova je grana matematike koja je nastala pedesetih godina pro²log veka i od tada se neprestano… (more)

Subjects/Keywords: adjacency matrix; signless Laplace matrix; graph spectrum; signless La- place spectrum; second largest eigenvalue; regular graph; bipartite graph; nested graph; balanced incomplete block design; partially balanced incomplete block de- sign

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koledin, T. D. (2014). Neke klase spektralno ograničenih grafova. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Koledin, Tamara D. “Neke klase spektralno ograničenih grafova.” 2014. Thesis, Univerzitet u Beogradu. Accessed August 08, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Koledin, Tamara D. “Neke klase spektralno ograničenih grafova.” 2014. Web. 08 Aug 2020.

Vancouver:

Koledin TD. Neke klase spektralno ograničenih grafova. [Internet] [Thesis]. Univerzitet u Beogradu; 2014. [cited 2020 Aug 08]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koledin TD. Neke klase spektralno ograničenih grafova. [Thesis]. Univerzitet u Beogradu; 2014. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia State University

22. Bush, Albert. Two Problems on Bipartite Graphs.

Degree: MS, Mathematics and Statistics, 2009, Georgia State University

 Erdos proved the well-known result that every graph has a spanning, bipartite subgraph such that every vertex has degree at least half of its original… (more)

Subjects/Keywords: Graph theory; Regularity Lemma; Graph tiling; Graph packing; Bipartite Graphs; Bipartite subgraphs; Blow up Lemma; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bush, A. (2009). Two Problems on Bipartite Graphs. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_theses/72

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bush, Albert. “Two Problems on Bipartite Graphs.” 2009. Thesis, Georgia State University. Accessed August 08, 2020. https://scholarworks.gsu.edu/math_theses/72.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bush, Albert. “Two Problems on Bipartite Graphs.” 2009. Web. 08 Aug 2020.

Vancouver:

Bush A. Two Problems on Bipartite Graphs. [Internet] [Thesis]. Georgia State University; 2009. [cited 2020 Aug 08]. Available from: https://scholarworks.gsu.edu/math_theses/72.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bush A. Two Problems on Bipartite Graphs. [Thesis]. Georgia State University; 2009. Available from: https://scholarworks.gsu.edu/math_theses/72

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Phan, Huu Tho. An Investigation of the Steven Eker's Approach to Associative-Commutative Matching [課題研究報告書].

Degree: Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学

Supervisor:緒方 和博

先端科学技術研究科

修士(情報科学)

Subjects/Keywords: AC Matching Problem; Bipartite Graph Matching; Associativity; Commutativity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phan, H. T. (n.d.). An Investigation of the Steven Eker's Approach to Associative-Commutative Matching [課題研究報告書]. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/15197

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 (16th Edition):

Phan, Huu Tho. “An Investigation of the Steven Eker's Approach to Associative-Commutative Matching [課題研究報告書].” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed August 08, 2020. http://hdl.handle.net/10119/15197.

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 (7th Edition):

Phan, Huu Tho. “An Investigation of the Steven Eker's Approach to Associative-Commutative Matching [課題研究報告書].” Web. 08 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Phan HT. An Investigation of the Steven Eker's Approach to Associative-Commutative Matching [課題研究報告書]. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10119/15197.

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:

Phan HT. An Investigation of the Steven Eker's Approach to Associative-Commutative Matching [課題研究報告書]. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/15197

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

24. Pravas K; Dr. A. Vijayakumar. Studies on the root graphs of some graph operators.

Degree: 2016, Cochin University of Science and Technology

Subjects/Keywords: Graph Theory; Bipartite graphs; Root line graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vijayakumar, P. K. D. A. (2016). Studies on the root graphs of some graph operators. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/5218

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vijayakumar, Pravas K; Dr. A.. “Studies on the root graphs of some graph operators.” 2016. Thesis, Cochin University of Science and Technology. Accessed August 08, 2020. http://dyuthi.cusat.ac.in/purl/5218.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vijayakumar, Pravas K; Dr. A.. “Studies on the root graphs of some graph operators.” 2016. Web. 08 Aug 2020.

Vancouver:

Vijayakumar PKDA. Studies on the root graphs of some graph operators. [Internet] [Thesis]. Cochin University of Science and Technology; 2016. [cited 2020 Aug 08]. Available from: http://dyuthi.cusat.ac.in/purl/5218.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vijayakumar PKDA. Studies on the root graphs of some graph operators. [Thesis]. Cochin University of Science and Technology; 2016. Available from: http://dyuthi.cusat.ac.in/purl/5218

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Viana do Espírito Santo, Ilísio. Inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle : une approche exploitant le modèle CAO : Automated inspection of mechanical parts by computer vision : an approach based on CAD model.

Degree: Docteur es, Informatique et Robotique, 2016, Ecole nationale des Mines d'Albi-Carmaux

Les travaux présentés dans ce manuscrit s’inscrivent dans le contexte de l’inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle. Il s’agit de décider si l’assemblage… (more)

Subjects/Keywords: Inspection; Appariement de graphes; Extraction de primitives; Graphe biparti; Transformée en distance; Recalage d'images; Modèle CAO; Inspection; Graph matching; Primitive extraction; Bipartite graph; Distance transform; Image registration; CAD model; 620

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Viana do Espírito Santo, I. (2016). Inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle : une approche exploitant le modèle CAO : Automated inspection of mechanical parts by computer vision : an approach based on CAD model. (Doctoral Dissertation). Ecole nationale des Mines d'Albi-Carmaux. Retrieved from http://www.theses.fr/2016EMAC0022

Chicago Manual of Style (16th Edition):

Viana do Espírito Santo, Ilísio. “Inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle : une approche exploitant le modèle CAO : Automated inspection of mechanical parts by computer vision : an approach based on CAD model.” 2016. Doctoral Dissertation, Ecole nationale des Mines d'Albi-Carmaux. Accessed August 08, 2020. http://www.theses.fr/2016EMAC0022.

MLA Handbook (7th Edition):

Viana do Espírito Santo, Ilísio. “Inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle : une approche exploitant le modèle CAO : Automated inspection of mechanical parts by computer vision : an approach based on CAD model.” 2016. Web. 08 Aug 2020.

Vancouver:

Viana do Espírito Santo I. Inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle : une approche exploitant le modèle CAO : Automated inspection of mechanical parts by computer vision : an approach based on CAD model. [Internet] [Doctoral dissertation]. Ecole nationale des Mines d'Albi-Carmaux; 2016. [cited 2020 Aug 08]. Available from: http://www.theses.fr/2016EMAC0022.

Council of Science Editors:

Viana do Espírito Santo I. Inspection automatisée d’assemblages mécaniques aéronautiques par vision artificielle : une approche exploitant le modèle CAO : Automated inspection of mechanical parts by computer vision : an approach based on CAD model. [Doctoral Dissertation]. Ecole nationale des Mines d'Albi-Carmaux; 2016. Available from: http://www.theses.fr/2016EMAC0022


California State University – San Bernardino

26. Rocha, Mário. The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth.

Degree: MAin Mathematics, Mathematics, 2003, California State University – San Bernardino

Algorithms will be domonstrated for how to embed complete bipartite graphs onto 2xn type grids, where the imimum grid cutwidth is attained.

Subjects/Keywords: Bipartite graphs; Graph theory; Algorithms; Graph methods; Parameter estimation; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rocha, M. (2003). The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2311

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rocha, Mário. “The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth.” 2003. Thesis, California State University – San Bernardino. Accessed August 08, 2020. http://scholarworks.lib.csusb.edu/etd-project/2311.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rocha, Mário. “The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth.” 2003. Web. 08 Aug 2020.

Vancouver:

Rocha M. The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth. [Internet] [Thesis]. California State University – San Bernardino; 2003. [cited 2020 Aug 08]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2311.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rocha M. The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth. [Thesis]. California State University – San Bernardino; 2003. Available from: http://scholarworks.lib.csusb.edu/etd-project/2311

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. [No author]. Bipartite Network Community Detection: Algorithms and Applications .

Degree: 2018, Washington State University

 Methods to efficiently uncover and extract community structures are required in a vast number of applications where networked data and their interactions can be modeled… (more)

Subjects/Keywords: Computer science; Bioinformatics; bipartite modularity; bipartite networks; clustering; community detection; graph algorithms; heterogeneous biological data

Bipartite Spectral Graph Partitioning . 17 2.4 Hypergraphs… …bipartite graph G(V1 ∪ V2 , E, ω). . . . . . . . . . . . . . 10 2.2 Hypergraph… …biLouvain. a) The input bipartite graph. Vertices of the two different types are shown in two… …x28;a) Southern Women Bipartite Graph. Circles - women and diamonds - events by dates… …has the weight of the connection between them. Figure 2.1 Example of a bipartite graph G… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2018). Bipartite Network Community Detection: Algorithms and Applications . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/16377

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

author], [No. “Bipartite Network Community Detection: Algorithms and Applications .” 2018. Thesis, Washington State University. Accessed August 08, 2020. http://hdl.handle.net/2376/16377.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

author], [No. “Bipartite Network Community Detection: Algorithms and Applications .” 2018. Web. 08 Aug 2020.

Vancouver:

author] [. Bipartite Network Community Detection: Algorithms and Applications . [Internet] [Thesis]. Washington State University; 2018. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2376/16377.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Bipartite Network Community Detection: Algorithms and Applications . [Thesis]. Washington State University; 2018. Available from: http://hdl.handle.net/2376/16377

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Honda, Willian Yukio. Rotulação de símbolos matemáticos manuscritos via casamento de expressões.

Degree: Mestrado, Ciência da Computação, 2013, University of São Paulo

O problema de reconhecimento de expressões matemáticas manuscritas envolve três subproblemas importantes: segmentação de símbolos, reconhecimento de símbolos e análise estrutural de expressões. Para avaliar… (more)

Subjects/Keywords: bipartite graph matching; casamento de expressões matemáticas; emparelhamento de grafos bipartidos; expressões matemáticas manuscritas; handwritten mathematical expressions; mathematical expressions matching; mathematical symbols annotation; mathematical symbols labeling; rotulação de símbolos matemáticos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Honda, W. Y. (2013). Rotulação de símbolos matemáticos manuscritos via casamento de expressões. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22022013-120830/ ;

Chicago Manual of Style (16th Edition):

Honda, Willian Yukio. “Rotulação de símbolos matemáticos manuscritos via casamento de expressões.” 2013. Masters Thesis, University of São Paulo. Accessed August 08, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22022013-120830/ ;.

MLA Handbook (7th Edition):

Honda, Willian Yukio. “Rotulação de símbolos matemáticos manuscritos via casamento de expressões.” 2013. Web. 08 Aug 2020.

Vancouver:

Honda WY. Rotulação de símbolos matemáticos manuscritos via casamento de expressões. [Internet] [Masters thesis]. University of São Paulo; 2013. [cited 2020 Aug 08]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22022013-120830/ ;.

Council of Science Editors:

Honda WY. Rotulação de símbolos matemáticos manuscritos via casamento de expressões. [Masters Thesis]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22022013-120830/ ;


Mahatma Gandhi University

29. Thavamani, J P. Edge product graphs;.

Degree: Mathematics, 2015, Mahatma Gandhi University

newline

Bibliography p. 124-126, Publications p. 127, Index p. 128-129

Advisors/Committee Members: Kuriakose, A Sunny.

Subjects/Keywords: Bipartite graphs; Edge product graphs; Edge product number; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thavamani, J. P. (2015). Edge product graphs;. (Thesis). Mahatma Gandhi University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/35282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Thavamani, J P. “Edge product graphs;.” 2015. Thesis, Mahatma Gandhi University. Accessed August 08, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/35282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Thavamani, J P. “Edge product graphs;.” 2015. Web. 08 Aug 2020.

Vancouver:

Thavamani JP. Edge product graphs;. [Internet] [Thesis]. Mahatma Gandhi University; 2015. [cited 2020 Aug 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/35282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thavamani JP. Edge product graphs;. [Thesis]. Mahatma Gandhi University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/35282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of the Western Cape

30. Mumba, Nephtale Bvalamanja. Codes, graphs and designs from maximal subgroups of alternating groups .

Degree: 2018, University of the Western Cape

 The main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first… (more)

Subjects/Keywords: Alternating groups; Automorphism groups; Antipodal graphs; Bipartite graphs; Designs; Graphs; Graph covers; Incidence design; Linear code; Maximal subgroups; Neighbourhood design; Permutation decoding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mumba, N. B. (2018). Codes, graphs and designs from maximal subgroups of alternating groups . (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/6165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mumba, Nephtale Bvalamanja. “Codes, graphs and designs from maximal subgroups of alternating groups .” 2018. Thesis, University of the Western Cape. Accessed August 08, 2020. http://hdl.handle.net/11394/6165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mumba, Nephtale Bvalamanja. “Codes, graphs and designs from maximal subgroups of alternating groups .” 2018. Web. 08 Aug 2020.

Vancouver:

Mumba NB. Codes, graphs and designs from maximal subgroups of alternating groups . [Internet] [Thesis]. University of the Western Cape; 2018. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/11394/6165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mumba NB. Codes, graphs and designs from maximal subgroups of alternating groups . [Thesis]. University of the Western Cape; 2018. Available from: http://hdl.handle.net/11394/6165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2]

.