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:(Hypergraphs). Showing records 1 – 30 of 78 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


Rutgers University

1. Hamm, Arran. On Erdős-Ko-Rado for random hypergraphs.

Degree: PhD, Mathematics, 2014, Rutgers University

On Erdős-Ko-Rado for Random Hypergraphs o by Arran Hamm Dissertation Director: Jeff Kahn Denote by Hk (n, p) the random k-graph in which each k-subset… (more)

Subjects/Keywords: Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamm, A. (2014). On Erdős-Ko-Rado for random hypergraphs. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/45287/

Chicago Manual of Style (16th Edition):

Hamm, Arran. “On Erdős-Ko-Rado for random hypergraphs.” 2014. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/45287/.

MLA Handbook (7th Edition):

Hamm, Arran. “On Erdős-Ko-Rado for random hypergraphs.” 2014. Web. 28 Oct 2020.

Vancouver:

Hamm A. On Erdős-Ko-Rado for random hypergraphs. [Internet] [Doctoral dissertation]. Rutgers University; 2014. [cited 2020 Oct 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/45287/.

Council of Science Editors:

Hamm A. On Erdős-Ko-Rado for random hypergraphs. [Doctoral Dissertation]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/45287/


University of Alberta

2. Hare, Donovan Ross. Color-critical hypergraphs.

Degree: MS, Department of Mathematics, 1987, University of Alberta

Subjects/Keywords: Hypergraphs.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hare, D. R. (1987). Color-critical hypergraphs. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/qr46r292d

Chicago Manual of Style (16th Edition):

Hare, Donovan Ross. “Color-critical hypergraphs.” 1987. Masters Thesis, University of Alberta. Accessed October 28, 2020. https://era.library.ualberta.ca/files/qr46r292d.

MLA Handbook (7th Edition):

Hare, Donovan Ross. “Color-critical hypergraphs.” 1987. Web. 28 Oct 2020.

Vancouver:

Hare DR. Color-critical hypergraphs. [Internet] [Masters thesis]. University of Alberta; 1987. [cited 2020 Oct 28]. Available from: https://era.library.ualberta.ca/files/qr46r292d.

Council of Science Editors:

Hare DR. Color-critical hypergraphs. [Masters Thesis]. University of Alberta; 1987. Available from: https://era.library.ualberta.ca/files/qr46r292d


University of Waterloo

3. Ruiz-Vargas, Andres J. On the orientation of hypergraphs.

Degree: 2011, University of Waterloo

 This is an expository thesis. In this thesis we study out-orientations of hypergraphs, where every hyperarc has one tail vertex. We study hypergraphs that admit… (more)

Subjects/Keywords: hypergraphs; orientations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruiz-Vargas, A. J. (2011). On the orientation of hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5711

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

Ruiz-Vargas, Andres J. “On the orientation of hypergraphs.” 2011. Thesis, University of Waterloo. Accessed October 28, 2020. http://hdl.handle.net/10012/5711.

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

MLA Handbook (7th Edition):

Ruiz-Vargas, Andres J. “On the orientation of hypergraphs.” 2011. Web. 28 Oct 2020.

Vancouver:

Ruiz-Vargas AJ. On the orientation of hypergraphs. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10012/5711.

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

Council of Science Editors:

Ruiz-Vargas AJ. On the orientation of hypergraphs. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5711

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


Rutgers University

4. Khan, Imdadullah, 1980-. Spanning subgraphs in graphs and hypergraphs.

Degree: PhD, Computer Science, 2011, Rutgers University

This thesis consists of three new fundamental results on the existence of spanning subgraphs in graphs and hypergraphs. Cycle Factors in Graphs: A classical conjecture… (more)

Subjects/Keywords: Graph theory; Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, Imdadullah, 1. (2011). Spanning subgraphs in graphs and hypergraphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Chicago Manual of Style (16th Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

MLA Handbook (7th Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Web. 28 Oct 2020.

Vancouver:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2020 Oct 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

Council of Science Editors:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299


Mahatma Gandhi University

5. Jose, Bibin K. Domination in hypergraphs;.

Degree: Mathematics, 2014, Mahatma Gandhi University

newline

Bibliography p. 99-104

Advisors/Committee Members: Arumugam, S.

Subjects/Keywords: Domination; Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jose, B. K. (2014). Domination in hypergraphs;. (Thesis). Mahatma Gandhi University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/25947

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

Jose, Bibin K. “Domination in hypergraphs;.” 2014. Thesis, Mahatma Gandhi University. Accessed October 28, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/25947.

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

MLA Handbook (7th Edition):

Jose, Bibin K. “Domination in hypergraphs;.” 2014. Web. 28 Oct 2020.

Vancouver:

Jose BK. Domination in hypergraphs;. [Internet] [Thesis]. Mahatma Gandhi University; 2014. [cited 2020 Oct 28]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/25947.

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

Council of Science Editors:

Jose BK. Domination in hypergraphs;. [Thesis]. Mahatma Gandhi University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/25947

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


University of Illinois – Chicago

6. Cameron, Alexander M. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.

Degree: 2018, University of Illinois – Chicago

 Let a 2 to 1 directed hypergraph be a 3-uniform hypergraph where every edge has two tail vertices and one head vertex. For any such… (more)

Subjects/Keywords: combinatorics; graph theory; hypergraphs; extremal problems; directed hypergraphs; Ramsey's theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cameron, A. M. (2018). Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23148

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

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Thesis, University of Illinois – Chicago. Accessed October 28, 2020. http://hdl.handle.net/10027/23148.

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

MLA Handbook (7th Edition):

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Web. 28 Oct 2020.

Vancouver:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10027/23148.

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

Council of Science Editors:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/23148

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


University of South Carolina

7. Javidian, Mohammad Ali. Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs.

Degree: PhD, Computer Science and Engineering, 2019, University of South Carolina

  Probabilistic graphical models (PGMs) use graphs, either undirected, directed, or mixed, to represent possible dependencies among the variables of a multivariate probability distri- bution.… (more)

Subjects/Keywords: Computer Sciences; Engineering; learning algorithms; Hypergraphs; Chain Graphs; Bayesian Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Javidian, M. A. (2019). Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/5558

Chicago Manual of Style (16th Edition):

Javidian, Mohammad Ali. “Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs.” 2019. Doctoral Dissertation, University of South Carolina. Accessed October 28, 2020. https://scholarcommons.sc.edu/etd/5558.

MLA Handbook (7th Edition):

Javidian, Mohammad Ali. “Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs.” 2019. Web. 28 Oct 2020.

Vancouver:

Javidian MA. Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2019. [cited 2020 Oct 28]. Available from: https://scholarcommons.sc.edu/etd/5558.

Council of Science Editors:

Javidian MA. Properties, Learning Algorithms, and Applications of Chain Graphs and Bayesian Hypergraphs. [Doctoral Dissertation]. University of South Carolina; 2019. Available from: https://scholarcommons.sc.edu/etd/5558

8. Beckenbach, Isabel Leonie. Matchings and Flows in Hypergraphs.

Degree: 2019, Freie Universität Berlin

 Diese Arbeit untersucht Matchings und Flüsse in Hypergraphen mit Hilfe kombinatorischer Methoden. In Graphen gehören diese Probleme zu den grundlegendsten der kombinatorischen Optimierung. Viele Resultate… (more)

Subjects/Keywords: Matchings; Balanced Hypergraphs; Normal Hypergraphs; Mengerian Hypergraphs; Factors; Tight Cuts; Network Flows; 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beckenbach, I. L. (2019). Matchings and Flows in Hypergraphs. (Thesis). Freie Universität Berlin. Retrieved from http://dx.doi.org/10.17169/refubium-2157

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

Beckenbach, Isabel Leonie. “Matchings and Flows in Hypergraphs.” 2019. Thesis, Freie Universität Berlin. Accessed October 28, 2020. http://dx.doi.org/10.17169/refubium-2157.

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

MLA Handbook (7th Edition):

Beckenbach, Isabel Leonie. “Matchings and Flows in Hypergraphs.” 2019. Web. 28 Oct 2020.

Vancouver:

Beckenbach IL. Matchings and Flows in Hypergraphs. [Internet] [Thesis]. Freie Universität Berlin; 2019. [cited 2020 Oct 28]. Available from: http://dx.doi.org/10.17169/refubium-2157.

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

Council of Science Editors:

Beckenbach IL. Matchings and Flows in Hypergraphs. [Thesis]. Freie Universität Berlin; 2019. Available from: http://dx.doi.org/10.17169/refubium-2157

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


University of Hong Kong

9. 陳智斌. On various packing and covering problems.

Degree: 2009, University of Hong Kong

Subjects/Keywords: Combinatorial optimization.; Hypergraphs.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

陳智斌. (2009). On various packing and covering problems. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/56587

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

Chicago Manual of Style (16th Edition):

陳智斌. “On various packing and covering problems.” 2009. Thesis, University of Hong Kong. Accessed October 28, 2020. http://hdl.handle.net/10722/56587.

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

MLA Handbook (7th Edition):

陳智斌. “On various packing and covering problems.” 2009. Web. 28 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

陳智斌. On various packing and covering problems. [Internet] [Thesis]. University of Hong Kong; 2009. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10722/56587.

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

Council of Science Editors:

陳智斌. On various packing and covering problems. [Thesis]. University of Hong Kong; 2009. Available from: http://hdl.handle.net/10722/56587

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


Indian Institute of Science

10. Ghoshdastidar, Debarghya. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is… (more)

Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghoshdastidar, D. (2018). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2947

Chicago Manual of Style (16th Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed October 28, 2020. http://etd.iisc.ac.in/handle/2005/2947.

MLA Handbook (7th Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2018. Web. 28 Oct 2020.

Vancouver:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Oct 28]. Available from: http://etd.iisc.ac.in/handle/2005/2947.

Council of Science Editors:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/2947


Iowa State University

11. Morrison, Beth Ann Bjorkman. Variations on the power domination problem: Hypergraphs and robustness.

Degree: 2020, Iowa State University

 The power domination problem seeks to find the minimum number of sensors called phasor measurement units (PMUs) to monitor an electric power network. In this… (more)

Subjects/Keywords: domination; hypergraphs; infection number; power domination

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morrison, B. A. B. (2020). Variations on the power domination problem: Hypergraphs and robustness. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17931

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

Morrison, Beth Ann Bjorkman. “Variations on the power domination problem: Hypergraphs and robustness.” 2020. Thesis, Iowa State University. Accessed October 28, 2020. https://lib.dr.iastate.edu/etd/17931.

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

MLA Handbook (7th Edition):

Morrison, Beth Ann Bjorkman. “Variations on the power domination problem: Hypergraphs and robustness.” 2020. Web. 28 Oct 2020.

Vancouver:

Morrison BAB. Variations on the power domination problem: Hypergraphs and robustness. [Internet] [Thesis]. Iowa State University; 2020. [cited 2020 Oct 28]. Available from: https://lib.dr.iastate.edu/etd/17931.

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

Council of Science Editors:

Morrison BAB. Variations on the power domination problem: Hypergraphs and robustness. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17931

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


Delft University of Technology

12. Dekker, F.W. (author). Privacy-Preserving Data Aggregation with Probabilistic Range Validation.

Degree: 2020, Delft University of Technology

 Privacy-preserving data aggregation protocols have been researched widely, but usually cannot guarantee correctness of the aggregate if users are malicious. These protocols can be extended… (more)

Subjects/Keywords: Privacy; Data aggregation; Applied cryptography; Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dekker, F. W. (. (2020). Privacy-Preserving Data Aggregation with Probabilistic Range Validation. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268

Chicago Manual of Style (16th Edition):

Dekker, F W (author). “Privacy-Preserving Data Aggregation with Probabilistic Range Validation.” 2020. Masters Thesis, Delft University of Technology. Accessed October 28, 2020. http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268.

MLA Handbook (7th Edition):

Dekker, F W (author). “Privacy-Preserving Data Aggregation with Probabilistic Range Validation.” 2020. Web. 28 Oct 2020.

Vancouver:

Dekker FW(. Privacy-Preserving Data Aggregation with Probabilistic Range Validation. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2020 Oct 28]. Available from: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268.

Council of Science Editors:

Dekker FW(. Privacy-Preserving Data Aggregation with Probabilistic Range Validation. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:5d769bad-a615-41b1-908e-2b52dd10e268


Dalhousie University

13. Mol, Lucas. The Uniformity Space of Hypergraphs.

Degree: MS, Department of Mathematics & Statistics - Math Division, 2012, Dalhousie University

 For a hypergraph H=(V,E) and a field F, a weighting of H is a map f:V ?F. A weighting is called stable if there is… (more)

Subjects/Keywords: Hypergraphs; Weightings; Stable Weightings; Uniformity Space; Uniformity Dimension

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mol, L. (2012). The Uniformity Space of Hypergraphs. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/15232

Chicago Manual of Style (16th Edition):

Mol, Lucas. “The Uniformity Space of Hypergraphs.” 2012. Masters Thesis, Dalhousie University. Accessed October 28, 2020. http://hdl.handle.net/10222/15232.

MLA Handbook (7th Edition):

Mol, Lucas. “The Uniformity Space of Hypergraphs.” 2012. Web. 28 Oct 2020.

Vancouver:

Mol L. The Uniformity Space of Hypergraphs. [Internet] [Masters thesis]. Dalhousie University; 2012. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10222/15232.

Council of Science Editors:

Mol L. The Uniformity Space of Hypergraphs. [Masters Thesis]. Dalhousie University; 2012. Available from: http://hdl.handle.net/10222/15232

14. John, Arul Singh J. Hydrodomination in hypergraphs; -.

Degree: Mathematics, 2014, Manonmaniam Sundaranar University

None

Reference P. 127-128

Advisors/Committee Members: Kala, R.

Subjects/Keywords: Graphs; Hydrodomination; hypergraphs; Spaces; Topological

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

John, A. S. J. (2014). Hydrodomination in hypergraphs; -. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/21024

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

John, Arul Singh J. “Hydrodomination in hypergraphs; -.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed October 28, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/21024.

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

MLA Handbook (7th Edition):

John, Arul Singh J. “Hydrodomination in hypergraphs; -.” 2014. Web. 28 Oct 2020.

Vancouver:

John ASJ. Hydrodomination in hypergraphs; -. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Oct 28]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/21024.

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

Council of Science Editors:

John ASJ. Hydrodomination in hypergraphs; -. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/21024

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

15. Mota, Guilherme Oliveira. Dois resultados em combinatória contemporânea.

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

Dois problemas combinatórios são estudados: (i) determinar a quantidade de cópias de um hipergrafo fixo em um hipergrafo uniforme pseudoaleatório, e (ii) estimar números de… (more)

Subjects/Keywords: embedding; hipergrafos; hypergraphs; imersão; Pseudoaleatoriedade; Pseudorandomness; Ramsey; Ramsey; regularidade.; regularity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mota, G. O. (2013). Dois resultados em combinatória contemporânea. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102013-110457/ ;

Chicago Manual of Style (16th Edition):

Mota, Guilherme Oliveira. “Dois resultados em combinatória contemporânea.” 2013. Doctoral Dissertation, University of São Paulo. Accessed October 28, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102013-110457/ ;.

MLA Handbook (7th Edition):

Mota, Guilherme Oliveira. “Dois resultados em combinatória contemporânea.” 2013. Web. 28 Oct 2020.

Vancouver:

Mota GO. Dois resultados em combinatória contemporânea. [Internet] [Doctoral dissertation]. University of São Paulo; 2013. [cited 2020 Oct 28]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102013-110457/ ;.

Council of Science Editors:

Mota GO. Dois resultados em combinatória contemporânea. [Doctoral Dissertation]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102013-110457/ ;

16. Karageorgos, Theodoros. Analytic properties of sparse graphs and hypergraphs.

Degree: 2018, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

The aim of this dissertation is threefold. At first, we develop a technique that provides regularity results for Lp and Lp regular random variables. Next,… (more)

Subjects/Keywords: Γραφήματα, Υπεργραφήματα; Graphs, hypergraphs; Rergularity lemma; Counting lemma; Removal lemma

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karageorgos, T. (2018). Analytic properties of sparse graphs and hypergraphs. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/43236

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

Karageorgos, Theodoros. “Analytic properties of sparse graphs and hypergraphs.” 2018. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed October 28, 2020. http://hdl.handle.net/10442/hedi/43236.

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

MLA Handbook (7th Edition):

Karageorgos, Theodoros. “Analytic properties of sparse graphs and hypergraphs.” 2018. Web. 28 Oct 2020.

Vancouver:

Karageorgos T. Analytic properties of sparse graphs and hypergraphs. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10442/hedi/43236.

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

Council of Science Editors:

Karageorgos T. Analytic properties of sparse graphs and hypergraphs. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. Available from: http://hdl.handle.net/10442/hedi/43236

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


University of Waterloo

17. Jay, Andrew. Santa Claus, Machine Scheduling and Bipartite Hypergraphs.

Degree: 2020, University of Waterloo

 Here we discuss two related discrete optimization problems, a prominent problem in scheduling theory, makespan minimization on unrelated parallel machines, and the other a fair… (more)

Subjects/Keywords: machine scheduling; bipartite hypergraphs; makespan; Santa Claus problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jay, A. (2020). Santa Claus, Machine Scheduling and Bipartite Hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15438

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

Jay, Andrew. “Santa Claus, Machine Scheduling and Bipartite Hypergraphs.” 2020. Thesis, University of Waterloo. Accessed October 28, 2020. http://hdl.handle.net/10012/15438.

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

MLA Handbook (7th Edition):

Jay, Andrew. “Santa Claus, Machine Scheduling and Bipartite Hypergraphs.” 2020. Web. 28 Oct 2020.

Vancouver:

Jay A. Santa Claus, Machine Scheduling and Bipartite Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10012/15438.

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

Council of Science Editors:

Jay A. Santa Claus, Machine Scheduling and Bipartite Hypergraphs. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15438

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


Western Michigan University

18. Helenius, Laars C. Edge Induced Weightings of Uniform Hypergraphs and Related Problems.

Degree: PhD, Mathematics, 2018, Western Michigan University

  The starting point of the research is the so called 1-2-3 Conjecture formulated in 2004 by Karoński, Luczak, and Thomason. Roughly speaking it says… (more)

Subjects/Keywords: 123 conjecture; hypergraphs; strong weighting; weak weighting; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Helenius, L. C. (2018). Edge Induced Weightings of Uniform Hypergraphs and Related Problems. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3227

Chicago Manual of Style (16th Edition):

Helenius, Laars C. “Edge Induced Weightings of Uniform Hypergraphs and Related Problems.” 2018. Doctoral Dissertation, Western Michigan University. Accessed October 28, 2020. https://scholarworks.wmich.edu/dissertations/3227.

MLA Handbook (7th Edition):

Helenius, Laars C. “Edge Induced Weightings of Uniform Hypergraphs and Related Problems.” 2018. Web. 28 Oct 2020.

Vancouver:

Helenius LC. Edge Induced Weightings of Uniform Hypergraphs and Related Problems. [Internet] [Doctoral dissertation]. Western Michigan University; 2018. [cited 2020 Oct 28]. Available from: https://scholarworks.wmich.edu/dissertations/3227.

Council of Science Editors:

Helenius LC. Edge Induced Weightings of Uniform Hypergraphs and Related Problems. [Doctoral Dissertation]. Western Michigan University; 2018. Available from: https://scholarworks.wmich.edu/dissertations/3227


Hong Kong University of Science and Technology

19. Du, Zilin. Decomposition on relational databases.

Degree: 2000, Hong Kong University of Science and Technology

 Hypergraph has been proven to be a very useful structure in relational database theory. The family of relational schemes or join dependencies can be divided… (more)

Subjects/Keywords: Relational databases ; Hypergraphs ; Decomposition (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Du, Z. (2000). Decomposition on relational databases. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5102 ; https://doi.org/10.14711/thesis-b672602 ; http://repository.ust.hk/ir/bitstream/1783.1-5102/1/th_redirect.html

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

Du, Zilin. “Decomposition on relational databases.” 2000. Thesis, Hong Kong University of Science and Technology. Accessed October 28, 2020. http://repository.ust.hk/ir/Record/1783.1-5102 ; https://doi.org/10.14711/thesis-b672602 ; http://repository.ust.hk/ir/bitstream/1783.1-5102/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Du, Zilin. “Decomposition on relational databases.” 2000. Web. 28 Oct 2020.

Vancouver:

Du Z. Decomposition on relational databases. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2000. [cited 2020 Oct 28]. Available from: http://repository.ust.hk/ir/Record/1783.1-5102 ; https://doi.org/10.14711/thesis-b672602 ; http://repository.ust.hk/ir/bitstream/1783.1-5102/1/th_redirect.html.

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

Council of Science Editors:

Du Z. Decomposition on relational databases. [Thesis]. Hong Kong University of Science and Technology; 2000. Available from: http://repository.ust.hk/ir/Record/1783.1-5102 ; https://doi.org/10.14711/thesis-b672602 ; http://repository.ust.hk/ir/bitstream/1783.1-5102/1/th_redirect.html

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


Michigan State University

20. Siu, Wai-Cheong. Hypertrees in d-uniform hypergraphs.

Degree: PhD, Department of Mathematics, 2002, Michigan State University

Subjects/Keywords: Trees (Graph theory); Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Siu, W. (2002). Hypertrees in d-uniform hypergraphs. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:31579

Chicago Manual of Style (16th Edition):

Siu, Wai-Cheong. “Hypertrees in d-uniform hypergraphs.” 2002. Doctoral Dissertation, Michigan State University. Accessed October 28, 2020. http://etd.lib.msu.edu/islandora/object/etd:31579.

MLA Handbook (7th Edition):

Siu, Wai-Cheong. “Hypertrees in d-uniform hypergraphs.” 2002. Web. 28 Oct 2020.

Vancouver:

Siu W. Hypertrees in d-uniform hypergraphs. [Internet] [Doctoral dissertation]. Michigan State University; 2002. [cited 2020 Oct 28]. Available from: http://etd.lib.msu.edu/islandora/object/etd:31579.

Council of Science Editors:

Siu W. Hypertrees in d-uniform hypergraphs. [Doctoral Dissertation]. Michigan State University; 2002. Available from: http://etd.lib.msu.edu/islandora/object/etd:31579


University of Illinois – Urbana-Champaign

21. Kim, Jaehoon. Extremal problems involving forbidden subgraphs.

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

 In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family… (more)

Subjects/Keywords: Extremal Graph Theory; Graphs; Graph Coloring; Hypergraphs; Forbidden Subgraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, J. (2014). Extremal problems involving forbidden subgraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49480

Chicago Manual of Style (16th Edition):

Kim, Jaehoon. “Extremal problems involving forbidden subgraphs.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 28, 2020. http://hdl.handle.net/2142/49480.

MLA Handbook (7th Edition):

Kim, Jaehoon. “Extremal problems involving forbidden subgraphs.” 2014. Web. 28 Oct 2020.

Vancouver:

Kim J. Extremal problems involving forbidden subgraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/2142/49480.

Council of Science Editors:

Kim J. Extremal problems involving forbidden subgraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49480


Clemson University

22. Lipman, Drew J. Normal Domains Arising from Graph Theory.

Degree: PhD, Mathematics, 2017, Clemson University

 Determining whether an arbitrary subring R of k[x1<sup>±1</sup>,...,xn<sup>±1</sup>] is a normal domain is, in general, a nontrivial problem, even in the special case of a… (more)

Subjects/Keywords: Graph Theory; Hypergraphs; Normal Domains; Normalization; Serre's Conditions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lipman, D. J. (2017). Normal Domains Arising from Graph Theory. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1920

Chicago Manual of Style (16th Edition):

Lipman, Drew J. “Normal Domains Arising from Graph Theory.” 2017. Doctoral Dissertation, Clemson University. Accessed October 28, 2020. https://tigerprints.clemson.edu/all_dissertations/1920.

MLA Handbook (7th Edition):

Lipman, Drew J. “Normal Domains Arising from Graph Theory.” 2017. Web. 28 Oct 2020.

Vancouver:

Lipman DJ. Normal Domains Arising from Graph Theory. [Internet] [Doctoral dissertation]. Clemson University; 2017. [cited 2020 Oct 28]. Available from: https://tigerprints.clemson.edu/all_dissertations/1920.

Council of Science Editors:

Lipman DJ. Normal Domains Arising from Graph Theory. [Doctoral Dissertation]. Clemson University; 2017. Available from: https://tigerprints.clemson.edu/all_dissertations/1920


Georgia Tech

23. Cohen, Emma. Problems in catalan mixing and matchings in regular hypergraphs.

Degree: PhD, Mathematics, 2016, Georgia Tech

 This dissertation consists of two parts, falling under the closely related fields of counting and sampling. In the first part, we explore the relationships between… (more)

Subjects/Keywords: Markov chains; Catalan structures; Matchings; Independent sets; Upper matching conjecture; Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cohen, E. (2016). Problems in catalan mixing and matchings in regular hypergraphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56271

Chicago Manual of Style (16th Edition):

Cohen, Emma. “Problems in catalan mixing and matchings in regular hypergraphs.” 2016. Doctoral Dissertation, Georgia Tech. Accessed October 28, 2020. http://hdl.handle.net/1853/56271.

MLA Handbook (7th Edition):

Cohen, Emma. “Problems in catalan mixing and matchings in regular hypergraphs.” 2016. Web. 28 Oct 2020.

Vancouver:

Cohen E. Problems in catalan mixing and matchings in regular hypergraphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/1853/56271.

Council of Science Editors:

Cohen E. Problems in catalan mixing and matchings in regular hypergraphs. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56271


University of South Carolina

24. Bai, Shuliang. Turán Problems and Spectral Theory on Hypergraphs and Tensors.

Degree: PhD, Mathematics, 2018, University of South Carolina

  Turán problems on uniform hypergraphs have been actively studied for many decades. However, on non-uniform hypergraphs, these problems are rarely considered. We refer a… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Turán Problems; Spectral Theory; Hypergraphs; Tensors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bai, S. (2018). Turán Problems and Spectral Theory on Hypergraphs and Tensors. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/4799

Chicago Manual of Style (16th Edition):

Bai, Shuliang. “Turán Problems and Spectral Theory on Hypergraphs and Tensors.” 2018. Doctoral Dissertation, University of South Carolina. Accessed October 28, 2020. https://scholarcommons.sc.edu/etd/4799.

MLA Handbook (7th Edition):

Bai, Shuliang. “Turán Problems and Spectral Theory on Hypergraphs and Tensors.” 2018. Web. 28 Oct 2020.

Vancouver:

Bai S. Turán Problems and Spectral Theory on Hypergraphs and Tensors. [Internet] [Doctoral dissertation]. University of South Carolina; 2018. [cited 2020 Oct 28]. Available from: https://scholarcommons.sc.edu/etd/4799.

Council of Science Editors:

Bai S. Turán Problems and Spectral Theory on Hypergraphs and Tensors. [Doctoral Dissertation]. University of South Carolina; 2018. Available from: https://scholarcommons.sc.edu/etd/4799


University of Waterloo

25. Szestopalow, Michael. Matchings and Covers in Hypergraphs.

Degree: 2016, University of Waterloo

 In this thesis, we study three variations of matching and covering problems in hypergraphs. The first is motivated by an old conjecture of Ryser which… (more)

Subjects/Keywords: Graph Theory; Hypergraphs; Matchings; Covers; Fractional stable matchings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Szestopalow, M. (2016). Matchings and Covers in Hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10497

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

Szestopalow, Michael. “Matchings and Covers in Hypergraphs.” 2016. Thesis, University of Waterloo. Accessed October 28, 2020. http://hdl.handle.net/10012/10497.

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

MLA Handbook (7th Edition):

Szestopalow, Michael. “Matchings and Covers in Hypergraphs.” 2016. Web. 28 Oct 2020.

Vancouver:

Szestopalow M. Matchings and Covers in Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10012/10497.

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

Council of Science Editors:

Szestopalow M. Matchings and Covers in Hypergraphs. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10497

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


University of Waterloo

26. Foldes, Stephane. Symmetries.

Degree: 2016, University of Waterloo

 Automorphisms of graphs, hypergraphs and disgraphs are investigated. The invariance of the chromatic polynomial in the rotor effect is disproved. New invariance results are obtained.… (more)

Subjects/Keywords: automorphisms of graphs; hypergraphs; disgraphs; chromatic polynomial; rotor effect; automorphism groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foldes, S. (2016). Symmetries. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10975

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

Foldes, Stephane. “Symmetries.” 2016. Thesis, University of Waterloo. Accessed October 28, 2020. http://hdl.handle.net/10012/10975.

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

MLA Handbook (7th Edition):

Foldes, Stephane. “Symmetries.” 2016. Web. 28 Oct 2020.

Vancouver:

Foldes S. Symmetries. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/10012/10975.

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

Council of Science Editors:

Foldes S. Symmetries. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10975

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


University of South Carolina

27. Kay, William. An Overview of the Constructive Local Lemma.

Degree: MA, Mathematics, 2012, University of South Carolina

  The Local Lemma has been a powerful tool in probabilistic combinatorics. Recent advances by Moser and Tardos have provided an algorithmic variant of the… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Algorithms; Hypergraphs; Local Lemma; Pythagorean Triples

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kay, W. (2012). An Overview of the Constructive Local Lemma. (Masters Thesis). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/1602

Chicago Manual of Style (16th Edition):

Kay, William. “An Overview of the Constructive Local Lemma.” 2012. Masters Thesis, University of South Carolina. Accessed October 28, 2020. https://scholarcommons.sc.edu/etd/1602.

MLA Handbook (7th Edition):

Kay, William. “An Overview of the Constructive Local Lemma.” 2012. Web. 28 Oct 2020.

Vancouver:

Kay W. An Overview of the Constructive Local Lemma. [Internet] [Masters thesis]. University of South Carolina; 2012. [cited 2020 Oct 28]. Available from: https://scholarcommons.sc.edu/etd/1602.

Council of Science Editors:

Kay W. An Overview of the Constructive Local Lemma. [Masters Thesis]. University of South Carolina; 2012. Available from: https://scholarcommons.sc.edu/etd/1602


Kansas State University

28. Goeckel, Gregory D. On unimodular hypergraphs.

Degree: MS, 1985, Kansas State University

Subjects/Keywords: Hypergraphs.; Graph theory.; Masters theses

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goeckel, G. D. (1985). On unimodular hypergraphs. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/27443

Chicago Manual of Style (16th Edition):

Goeckel, Gregory D. “On unimodular hypergraphs.” 1985. Masters Thesis, Kansas State University. Accessed October 28, 2020. http://hdl.handle.net/2097/27443.

MLA Handbook (7th Edition):

Goeckel, Gregory D. “On unimodular hypergraphs.” 1985. Web. 28 Oct 2020.

Vancouver:

Goeckel GD. On unimodular hypergraphs. [Internet] [Masters thesis]. Kansas State University; 1985. [cited 2020 Oct 28]. Available from: http://hdl.handle.net/2097/27443.

Council of Science Editors:

Goeckel GD. On unimodular hypergraphs. [Masters Thesis]. Kansas State University; 1985. Available from: http://hdl.handle.net/2097/27443


Rutgers University

29. Huang, Yuchi, 1979-. Hypergraph based visual categorization and segmentation.

Degree: PhD, Computer Science, 2010, Rutgers University

This dissertation explores original techniques for the construction of hypergraph models for computer vision applications. A hypergraph is a generalization of a pairwise simple graph,… (more)

Subjects/Keywords: Hypergraphs; Computer vision – Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, Yuchi, 1. (2010). Hypergraph based visual categorization and segmentation. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056373

Chicago Manual of Style (16th Edition):

Huang, Yuchi, 1979-. “Hypergraph based visual categorization and segmentation.” 2010. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056373.

MLA Handbook (7th Edition):

Huang, Yuchi, 1979-. “Hypergraph based visual categorization and segmentation.” 2010. Web. 28 Oct 2020.

Vancouver:

Huang, Yuchi 1. Hypergraph based visual categorization and segmentation. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Oct 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056373.

Council of Science Editors:

Huang, Yuchi 1. Hypergraph based visual categorization and segmentation. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056373


Rutgers University

30. Ilinca, Liviu, 1980-. Asymptotic enumeration of 2- and 3-SAT functions.

Degree: PhD, Mathematics, 2010, Rutgers University

We are interested in the number, G(k,n), of Boolean functions of n variables definable by k-SAT formulae. First, in Chapter 2, we give an alternate… (more)

Subjects/Keywords: Combinatorial analysis; Graph theory; Hypergraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ilinca, Liviu, 1. (2010). Asymptotic enumeration of 2- and 3-SAT functions. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609

Chicago Manual of Style (16th Edition):

Ilinca, Liviu, 1980-. “Asymptotic enumeration of 2- and 3-SAT functions.” 2010. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609.

MLA Handbook (7th Edition):

Ilinca, Liviu, 1980-. “Asymptotic enumeration of 2- and 3-SAT functions.” 2010. Web. 28 Oct 2020.

Vancouver:

Ilinca, Liviu 1. Asymptotic enumeration of 2- and 3-SAT functions. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Oct 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609.

Council of Science Editors:

Ilinca, Liviu 1. Asymptotic enumeration of 2- and 3-SAT functions. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000053609

[1] [2] [3]

.