Advanced search options

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

You searched for `subject:(hypergraph)`

.
Showing records 1 – 30 of
78 total matches.

▼ Search Limiters

Western Michigan University

1. English, Sean. Probabilistic and Extremal Problems in Combinatorics.

Degree: PhD, Mathematics, 2018, Western Michigan University

URL: https://scholarworks.wmich.edu/dissertations/3319

► Graph theory as a mathematical branch has been studied rigorously for almost three centuries. In the past century, many new branches of graph theory…
(more)

Subjects/Keywords: Graph theory; combinatorics; hypergraph; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

English, S. (2018). Probabilistic and Extremal Problems in Combinatorics. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3319

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

English, Sean. “Probabilistic and Extremal Problems in Combinatorics.” 2018. Doctoral Dissertation, Western Michigan University. Accessed October 01, 2020. https://scholarworks.wmich.edu/dissertations/3319.

MLA Handbook (7^{th} Edition):

English, Sean. “Probabilistic and Extremal Problems in Combinatorics.” 2018. Web. 01 Oct 2020.

Vancouver:

English S. Probabilistic and Extremal Problems in Combinatorics. [Internet] [Doctoral dissertation]. Western Michigan University; 2018. [cited 2020 Oct 01]. Available from: https://scholarworks.wmich.edu/dissertations/3319.

Council of Science Editors:

English S. Probabilistic and Extremal Problems in Combinatorics. [Doctoral Dissertation]. Western Michigan University; 2018. Available from: https://scholarworks.wmich.edu/dissertations/3319

Queens University

2. Sawilla, Reginald Elias. Ranks and Partial Cuts in Forward Hypergraphs .

Degree: Computing, 2011, Queens University

URL: http://hdl.handle.net/1974/6484

► Many real-world relations are networks that can be modelled with a kind of directed *hypergraph* named a forward *hypergraph* (F-graph). F-graphs capture the semantics of…
(more)

Subjects/Keywords: Hypergraph Ranks ; Hypergraph Cuts ; Cyber Security ; Decision Support

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sawilla, R. E. (2011). Ranks and Partial Cuts in Forward Hypergraphs . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/6484

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Sawilla, Reginald Elias. “Ranks and Partial Cuts in Forward Hypergraphs .” 2011. Thesis, Queens University. Accessed October 01, 2020. http://hdl.handle.net/1974/6484.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sawilla, Reginald Elias. “Ranks and Partial Cuts in Forward Hypergraphs .” 2011. Web. 01 Oct 2020.

Vancouver:

Sawilla RE. Ranks and Partial Cuts in Forward Hypergraphs . [Internet] [Thesis]. Queens University; 2011. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1974/6484.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sawilla RE. Ranks and Partial Cuts in Forward Hypergraphs . [Thesis]. Queens University; 2011. Available from: http://hdl.handle.net/1974/6484

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

3. Chiniforooshan, Ehsan Jay. Intersperse Coloring.

Degree: 2007, University of Waterloo

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

► In this thesis, we introduce the intersperse coloring problem, which is a generalized version of the *hypergraph* coloring problem. In the intersperse coloring problem, we…
(more)

Subjects/Keywords: Graph Coloring; Hypergraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chiniforooshan, E. J. (2007). Intersperse Coloring. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3331

Not specified: Masters Thesis or Doctoral Dissertation

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

Chiniforooshan, Ehsan Jay. “Intersperse Coloring.” 2007. Thesis, University of Waterloo. Accessed October 01, 2020. http://hdl.handle.net/10012/3331.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chiniforooshan, Ehsan Jay. “Intersperse Coloring.” 2007. Web. 01 Oct 2020.

Vancouver:

Chiniforooshan EJ. Intersperse Coloring. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10012/3331.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiniforooshan EJ. Intersperse Coloring. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3331

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

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

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

URL: http://etd.iisc.ac.in/handle/2005/2947

► *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 Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2018. Web. 01 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 01]. 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

5. Xu, Chao. Cuts and connectivity in graphs and hypergraphs.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

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

► In this thesis, we consider cut and connectivity problems on graphs, digraphs, hypergraphs and hedgegraphs. The main results are the following: - We introduce a…
(more)

Subjects/Keywords: hypergraph; cuts

…*hypergraph* H = (V , E) has a set of hyperedges E, where each hyperedge
e is a subset of… …The size of a *hypergraph* is e∈E |e|. The rank of a *hypergraph*, denoted by r, is
maxe∈E |e… …We note that graphs are hypergraphs of rank 2. A *hypergraph* H 0 = (V 0 , E 0 ) is… …*hypergraph*/hedgegraph) H = (V , E), we define the function δH : 2V → E
with δH (… …digraph/*hypergraph*/hedgegraph) is capacitated if there is a non-negative capacity function…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xu, C. (2018). Cuts and connectivity in graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101009

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

Xu, Chao. “Cuts and connectivity in graphs and hypergraphs.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 01, 2020. http://hdl.handle.net/2142/101009.

MLA Handbook (7^{th} Edition):

Xu, Chao. “Cuts and connectivity in graphs and hypergraphs.” 2018. Web. 01 Oct 2020.

Vancouver:

Xu C. Cuts and connectivity in graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2142/101009.

Council of Science Editors:

Xu C. Cuts and connectivity in graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101009

University of Montana

6. Khormali, Omid. Extremal Problems for Forests in Graphs and Hypergraphs.

Degree: PhD, 2019, University of Montana

URL: https://scholarworks.umt.edu/etd/11483

► The Turan number, ex_r(n; F), of an r-uniform *hypergraph* F is the maximum number of hyperedges in an n-vertex r-uniform *hypergraph* which does not…
(more)

Subjects/Keywords: Graph Forest; Hypergraph Forest; Turan Number

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khormali, O. (2019). Extremal Problems for Forests in Graphs and Hypergraphs. (Doctoral Dissertation). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/11483

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

Khormali, Omid. “Extremal Problems for Forests in Graphs and Hypergraphs.” 2019. Doctoral Dissertation, University of Montana. Accessed October 01, 2020. https://scholarworks.umt.edu/etd/11483.

MLA Handbook (7^{th} Edition):

Khormali, Omid. “Extremal Problems for Forests in Graphs and Hypergraphs.” 2019. Web. 01 Oct 2020.

Vancouver:

Khormali O. Extremal Problems for Forests in Graphs and Hypergraphs. [Internet] [Doctoral dissertation]. University of Montana; 2019. [cited 2020 Oct 01]. Available from: https://scholarworks.umt.edu/etd/11483.

Council of Science Editors:

Khormali O. Extremal Problems for Forests in Graphs and Hypergraphs. [Doctoral Dissertation]. University of Montana; 2019. Available from: https://scholarworks.umt.edu/etd/11483

University of Illinois – Urbana-Champaign

7. Reiniger, Benjamin M. Coloring and constructing (hyper)graphs with restrictions.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

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

► We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs…
(more)

Subjects/Keywords: graph coloring; hypergraph coloring; critical graphs; list coloring; hypergraph degrees; poset dimension

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Reiniger, B. M. (2015). Coloring and constructing (hyper)graphs with restrictions. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/87975

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

Reiniger, Benjamin M. “Coloring and constructing (hyper)graphs with restrictions.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 01, 2020. http://hdl.handle.net/2142/87975.

MLA Handbook (7^{th} Edition):

Reiniger, Benjamin M. “Coloring and constructing (hyper)graphs with restrictions.” 2015. Web. 01 Oct 2020.

Vancouver:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2142/87975.

Council of Science Editors:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/87975

University of Cincinnati

8. HARROD, STEVEN S. RAILWAY CAPACITY MANAGEMENT AND PLANNING.

Degree: PhD, Business Administration : Quantitative Analysis, 2007, University of Cincinnati

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

► This research presents a novel model of the railway master scheduling problem, applies it to a theoretical study of railway line capacity under representative conditions,…
(more)

Subjects/Keywords: Transportation; Railway Transportation; Railroad Scheduling; Network Optimization; Hypergraph; Service Pricing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

HARROD, S. S. (2007). RAILWAY CAPACITY MANAGEMENT AND PLANNING. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1186181286

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

HARROD, STEVEN S. “RAILWAY CAPACITY MANAGEMENT AND PLANNING.” 2007. Doctoral Dissertation, University of Cincinnati. Accessed October 01, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1186181286.

MLA Handbook (7^{th} Edition):

HARROD, STEVEN S. “RAILWAY CAPACITY MANAGEMENT AND PLANNING.” 2007. Web. 01 Oct 2020.

Vancouver:

HARROD SS. RAILWAY CAPACITY MANAGEMENT AND PLANNING. [Internet] [Doctoral dissertation]. University of Cincinnati; 2007. [cited 2020 Oct 01]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1186181286.

Council of Science Editors:

HARROD SS. RAILWAY CAPACITY MANAGEMENT AND PLANNING. [Doctoral Dissertation]. University of Cincinnati; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1186181286

University of Washington

9.
Taylor, Jair Patrick.
Formal group laws and *hypergraph* colorings.

Degree: PhD, 2016, University of Washington

URL: http://hdl.handle.net/1773/36757

► This thesis demonstrates a connection between formal group laws and chromatic symmetric functions of hypergraphs, two seemingly unrelated topics in the theory of symmetric functions.…
(more)

Subjects/Keywords: Combinatorics; Formal group laws; Hypergraph coloring; Symmetric functions; Mathematics; mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taylor, J. P. (2016). Formal group laws and hypergraph colorings. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/36757

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

Taylor, Jair Patrick. “Formal group laws and hypergraph colorings.” 2016. Doctoral Dissertation, University of Washington. Accessed October 01, 2020. http://hdl.handle.net/1773/36757.

MLA Handbook (7^{th} Edition):

Taylor, Jair Patrick. “Formal group laws and hypergraph colorings.” 2016. Web. 01 Oct 2020.

Vancouver:

Taylor JP. Formal group laws and hypergraph colorings. [Internet] [Doctoral dissertation]. University of Washington; 2016. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1773/36757.

Council of Science Editors:

Taylor JP. Formal group laws and hypergraph colorings. [Doctoral Dissertation]. University of Washington; 2016. Available from: http://hdl.handle.net/1773/36757

University of Melbourne

10.
Jiang, Wenkai.
Highly efficient distributed *hypergraph* analysis: real-time partitioning and quantized learning.

Degree: 2018, University of Melbourne

URL: http://hdl.handle.net/11343/220744

► Hypergraphs have been shown to be highly effective when modeling a wide range of applications where high-order relationships are of interest, such as social network…
(more)

Subjects/Keywords: Hypergraph; graph framework; graph partitioning; deep neural network training; quantized learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jiang, W. (2018). Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/220744

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

Jiang, Wenkai. “Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning.” 2018. Masters Thesis, University of Melbourne. Accessed October 01, 2020. http://hdl.handle.net/11343/220744.

MLA Handbook (7^{th} Edition):

Jiang, Wenkai. “Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning.” 2018. Web. 01 Oct 2020.

Vancouver:

Jiang W. Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning. [Internet] [Masters thesis]. University of Melbourne; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/11343/220744.

Council of Science Editors:

Jiang W. Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning. [Masters Thesis]. University of Melbourne; 2018. Available from: http://hdl.handle.net/11343/220744

Louisiana State University

11. Alvin, Christopher Thomas. Synthesis With Hypergraphs.

Degree: PhD, Computer Sciences, 2015, Louisiana State University

URL: etd-06182015-152532 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2633

► Many problems related to synthesis with intelligent tutoring may be phrased as program synthesis problems using AI-style search and formal reasoning techniques. The _x000C_first two…
(more)

Subjects/Keywords: synthesis; hypergraph; problem synthesis; solution synthesis; molecular synthesis; knowledge representation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alvin, C. T. (2015). Synthesis With Hypergraphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06182015-152532 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2633

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

Alvin, Christopher Thomas. “Synthesis With Hypergraphs.” 2015. Doctoral Dissertation, Louisiana State University. Accessed October 01, 2020. etd-06182015-152532 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2633.

MLA Handbook (7^{th} Edition):

Alvin, Christopher Thomas. “Synthesis With Hypergraphs.” 2015. Web. 01 Oct 2020.

Vancouver:

Alvin CT. Synthesis With Hypergraphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2015. [cited 2020 Oct 01]. Available from: etd-06182015-152532 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2633.

Council of Science Editors:

Alvin CT. Synthesis With Hypergraphs. [Doctoral Dissertation]. Louisiana State University; 2015. Available from: etd-06182015-152532 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2633

Louisiana State University

12. Tohid (Rastegar Tohid, Mohammed), M. Analysis and Optimization of Scientific Applications through Set and Relation Abstractions.

Degree: PhD, Electrical and Computer Engineering, 2017, Louisiana State University

URL: etd-04102017-155003 ; https://digitalcommons.lsu.edu/gradschool_dissertations/4404

► Writing high performance code has steadily become more challenging since the design of computing systems has moved toward parallel processors in forms of multi and…
(more)

Subjects/Keywords: Partitioning; Overlapped Tiling; Hypergraph; Irregular applications; Compiler optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tohid (Rastegar Tohid, Mohammed), M. (2017). Analysis and Optimization of Scientific Applications through Set and Relation Abstractions. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04102017-155003 ; https://digitalcommons.lsu.edu/gradschool_dissertations/4404

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

Tohid (Rastegar Tohid, Mohammed), M. “Analysis and Optimization of Scientific Applications through Set and Relation Abstractions.” 2017. Doctoral Dissertation, Louisiana State University. Accessed October 01, 2020. etd-04102017-155003 ; https://digitalcommons.lsu.edu/gradschool_dissertations/4404.

MLA Handbook (7^{th} Edition):

Tohid (Rastegar Tohid, Mohammed), M. “Analysis and Optimization of Scientific Applications through Set and Relation Abstractions.” 2017. Web. 01 Oct 2020.

Vancouver:

Tohid (Rastegar Tohid, Mohammed) M. Analysis and Optimization of Scientific Applications through Set and Relation Abstractions. [Internet] [Doctoral dissertation]. Louisiana State University; 2017. [cited 2020 Oct 01]. Available from: etd-04102017-155003 ; https://digitalcommons.lsu.edu/gradschool_dissertations/4404.

Council of Science Editors:

Tohid (Rastegar Tohid, Mohammed) M. Analysis and Optimization of Scientific Applications through Set and Relation Abstractions. [Doctoral Dissertation]. Louisiana State University; 2017. Available from: etd-04102017-155003 ; https://digitalcommons.lsu.edu/gradschool_dissertations/4404

University of South Carolina

13. Johnston, Jeremy Travis. Turán Problems on Non-uniform Hypergraphs.

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

URL: https://scholarcommons.sc.edu/etd/2580

► A non-uniform *hypergraph* H = (V, E) consists of a vertex set V and an edge set E ⊆ 2 V; the edges in…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; extremal combinatorics; hypergraph jumps; Turán density

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Johnston, J. T. (2014). Turán Problems on Non-uniform Hypergraphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/2580

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

Johnston, Jeremy Travis. “Turán Problems on Non-uniform Hypergraphs.” 2014. Doctoral Dissertation, University of South Carolina. Accessed October 01, 2020. https://scholarcommons.sc.edu/etd/2580.

MLA Handbook (7^{th} Edition):

Johnston, Jeremy Travis. “Turán Problems on Non-uniform Hypergraphs.” 2014. Web. 01 Oct 2020.

Vancouver:

Johnston JT. Turán Problems on Non-uniform Hypergraphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2014. [cited 2020 Oct 01]. Available from: https://scholarcommons.sc.edu/etd/2580.

Council of Science Editors:

Johnston JT. Turán Problems on Non-uniform Hypergraphs. [Doctoral Dissertation]. University of South Carolina; 2014. Available from: https://scholarcommons.sc.edu/etd/2580

University of South Carolina

14. Dutle, Aaron Michael. Spectra of Hypergraphs.

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

URL: https://scholarcommons.sc.edu/etd/1593

► We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A number of developments building upon classical work has led…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Eigenvalue; Hypergraph; Spectrum

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dutle, A. M. (2012). Spectra of Hypergraphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/1593

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

Dutle, Aaron Michael. “Spectra of Hypergraphs.” 2012. Doctoral Dissertation, University of South Carolina. Accessed October 01, 2020. https://scholarcommons.sc.edu/etd/1593.

MLA Handbook (7^{th} Edition):

Dutle, Aaron Michael. “Spectra of Hypergraphs.” 2012. Web. 01 Oct 2020.

Vancouver:

Dutle AM. Spectra of Hypergraphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2012. [cited 2020 Oct 01]. Available from: https://scholarcommons.sc.edu/etd/1593.

Council of Science Editors:

Dutle AM. Spectra of Hypergraphs. [Doctoral Dissertation]. University of South Carolina; 2012. Available from: https://scholarcommons.sc.edu/etd/1593

Georgia State University

15. Lightcap, Andrew. Minimum Degree Conditions for Tilings in Graphs and Hypergraphs.

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

URL: https://scholarworks.gsu.edu/math_theses/111

► We consider tiling problems for graphs and hypergraphs. For two graphs and , an -tiling of is a subgraph of consisting of only vertex…
(more)

Subjects/Keywords: Graph tiling; Graph packing; Absorbing method; Hypergraph Codegree; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lightcap, A. (2011). Minimum Degree Conditions for Tilings in Graphs and Hypergraphs. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_theses/111

Not specified: Masters Thesis or Doctoral Dissertation

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

Lightcap, Andrew. “Minimum Degree Conditions for Tilings in Graphs and Hypergraphs.” 2011. Thesis, Georgia State University. Accessed October 01, 2020. https://scholarworks.gsu.edu/math_theses/111.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lightcap, Andrew. “Minimum Degree Conditions for Tilings in Graphs and Hypergraphs.” 2011. Web. 01 Oct 2020.

Vancouver:

Lightcap A. Minimum Degree Conditions for Tilings in Graphs and Hypergraphs. [Internet] [Thesis]. Georgia State University; 2011. [cited 2020 Oct 01]. Available from: https://scholarworks.gsu.edu/math_theses/111.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lightcap A. Minimum Degree Conditions for Tilings in Graphs and Hypergraphs. [Thesis]. Georgia State University; 2011. Available from: https://scholarworks.gsu.edu/math_theses/111

Not specified: Masters Thesis or Doctoral Dissertation

University of Minnesota

16.
Sharma, Ankit.
* Hypergraph* Analytics: Modeling Higher-Order Structures And Probabilities.

Degree: PhD, Computer Science, 2020, University of Minnesota

URL: http://hdl.handle.net/11299/215085

► Data structured in the form of overlapping or non-overlapping sets are found in a variety of domains, sometimes explicitly but often subtly. For example, teams,…
(more)

Subjects/Keywords: Data Mining; Hypergraph; Machine Learning; Network Science; Tensors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sharma, A. (2020). Hypergraph Analytics: Modeling Higher-Order Structures And Probabilities. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/215085

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

Sharma, Ankit. “Hypergraph Analytics: Modeling Higher-Order Structures And Probabilities.” 2020. Doctoral Dissertation, University of Minnesota. Accessed October 01, 2020. http://hdl.handle.net/11299/215085.

MLA Handbook (7^{th} Edition):

Sharma, Ankit. “Hypergraph Analytics: Modeling Higher-Order Structures And Probabilities.” 2020. Web. 01 Oct 2020.

Vancouver:

Sharma A. Hypergraph Analytics: Modeling Higher-Order Structures And Probabilities. [Internet] [Doctoral dissertation]. University of Minnesota; 2020. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/11299/215085.

Council of Science Editors:

Sharma A. Hypergraph Analytics: Modeling Higher-Order Structures And Probabilities. [Doctoral Dissertation]. University of Minnesota; 2020. Available from: http://hdl.handle.net/11299/215085

Ohio University

17.
Chokkalingam, Selvameenal.
Database and Query Analysis Tools for MySQL: Exploiting
Hypertree and *Hypergraph* Decompositions.

Degree: MS, Computer Science (Engineering), 2006, Ohio University

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

► A database is an organized collection of data. Database systems are widely used and have a broad range of applications. It is thus essential…
(more)

Subjects/Keywords: Computer Science; hypergraph; hypergraph decomposition; acyclic; acyclicity; SQL parser; cyclic; degrees of acyclicity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chokkalingam, S. (2006). Database and Query Analysis Tools for MySQL: Exploiting Hypertree and Hypergraph Decompositions. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1163694650

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

Chokkalingam, Selvameenal. “Database and Query Analysis Tools for MySQL: Exploiting Hypertree and Hypergraph Decompositions.” 2006. Masters Thesis, Ohio University. Accessed October 01, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1163694650.

MLA Handbook (7^{th} Edition):

Chokkalingam, Selvameenal. “Database and Query Analysis Tools for MySQL: Exploiting Hypertree and Hypergraph Decompositions.” 2006. Web. 01 Oct 2020.

Vancouver:

Chokkalingam S. Database and Query Analysis Tools for MySQL: Exploiting Hypertree and Hypergraph Decompositions. [Internet] [Masters thesis]. Ohio University; 2006. [cited 2020 Oct 01]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1163694650.

Council of Science Editors:

Chokkalingam S. Database and Query Analysis Tools for MySQL: Exploiting Hypertree and Hypergraph Decompositions. [Masters Thesis]. Ohio University; 2006. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1163694650

RMIT University

18. Sadri, A. Improved image analysis by maximised statistical use of geometry-shape constraints.

Degree: 2017, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:162467

► Identifying the underlying models in a set of data points contaminated by noise and outliers, leads to a highly complex multi-model fitting problem. This problem…
(more)

Subjects/Keywords: Fields of Research; Robust Statistics; Data Segmentation; Hypergraph clustering; Model fitting; Geometric constraints

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sadri, A. (2017). Improved image analysis by maximised statistical use of geometry-shape constraints. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162467

Not specified: Masters Thesis or Doctoral Dissertation

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

Sadri, A. “Improved image analysis by maximised statistical use of geometry-shape constraints.” 2017. Thesis, RMIT University. Accessed October 01, 2020. http://researchbank.rmit.edu.au/view/rmit:162467.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sadri, A. “Improved image analysis by maximised statistical use of geometry-shape constraints.” 2017. Web. 01 Oct 2020.

Vancouver:

Sadri A. Improved image analysis by maximised statistical use of geometry-shape constraints. [Internet] [Thesis]. RMIT University; 2017. [cited 2020 Oct 01]. Available from: http://researchbank.rmit.edu.au/view/rmit:162467.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sadri A. Improved image analysis by maximised statistical use of geometry-shape constraints. [Thesis]. RMIT University; 2017. Available from: http://researchbank.rmit.edu.au/view/rmit:162467

Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

19. Wang, Zhiyu. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.

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

URL: https://scholarcommons.sc.edu/etd/5771

► This thesis studies some problems in extremal and probabilistic combinatorics, Ricci curvature of graphs, spectral *hypergraph* theory and the interplay between these areas. The…
(more)

Subjects/Keywords: Mathematics; extremal combinatorics; graph theory; probabilistic methods; Ricci curvature; spectral hypergraph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Z. (2020). Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/5771

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

Wang, Zhiyu. “Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.” 2020. Doctoral Dissertation, University of South Carolina. Accessed October 01, 2020. https://scholarcommons.sc.edu/etd/5771.

MLA Handbook (7^{th} Edition):

Wang, Zhiyu. “Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.” 2020. Web. 01 Oct 2020.

Vancouver:

Wang Z. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. [Internet] [Doctoral dissertation]. University of South Carolina; 2020. [cited 2020 Oct 01]. Available from: https://scholarcommons.sc.edu/etd/5771.

Council of Science Editors:

Wang Z. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. [Doctoral Dissertation]. University of South Carolina; 2020. Available from: https://scholarcommons.sc.edu/etd/5771

Univerzitet u Beogradu

20. Stojadinović, Tanja B., 1977-. Комбинаторне Хопфове алгребре.

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

URL: https://fedorabg.bg.ac.rs/fedora/get/o:12905/bdef:Content/get

►

Математика - Алгебра, комбинаторика / Mathematics - Algebra, combinatorics

Над многим класама комбинаторних објеката природно се могу увести множење и комножење који задају структуру Хопфове… (more)

Subjects/Keywords: Hopf algebra; hypergraph; building set; clutter; simplicial complex; quasisymmetric function; symmetric function; Dehn-Sommerville relations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stojadinović, Tanja B., 1. (2016). Комбинаторне Хопфове алгребре. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:12905/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

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

Stojadinović, Tanja B., 1977-. “Комбинаторне Хопфове алгребре.” 2016. Thesis, Univerzitet u Beogradu. Accessed October 01, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:12905/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Stojadinović, Tanja B., 1977-. “Комбинаторне Хопфове алгребре.” 2016. Web. 01 Oct 2020.

Vancouver:

Stojadinović, Tanja B. 1. Комбинаторне Хопфове алгребре. [Internet] [Thesis]. Univerzitet u Beogradu; 2016. [cited 2020 Oct 01]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:12905/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stojadinović, Tanja B. 1. Комбинаторне Хопфове алгребре. [Thesis]. Univerzitet u Beogradu; 2016. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:12905/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

21. Plant, Lachlan. Maximum Clique Search in Circulant k-Hypergraphs .

Degree: 2018, University of Ottawa

URL: http://hdl.handle.net/10393/38464

► The search for max-cliques in graphs is a well established NP-complete problem in graph theory and algorithm design, with many algorithms designed to make use…
(more)

Subjects/Keywords: max-clique; hypergraph; circulant; algorithm

…the same number k of vertices, then it is a k -*hypergraph*. The concept of a clique
extends… …*hypergraph*, which contains
many cliques of the same maximum size. Most search algorithms will…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Plant, L. (2018). Maximum Clique Search in Circulant k-Hypergraphs . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/38464

Not specified: Masters Thesis or Doctoral Dissertation

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

Plant, Lachlan. “Maximum Clique Search in Circulant k-Hypergraphs .” 2018. Thesis, University of Ottawa. Accessed October 01, 2020. http://hdl.handle.net/10393/38464.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Plant, Lachlan. “Maximum Clique Search in Circulant k-Hypergraphs .” 2018. Web. 01 Oct 2020.

Vancouver:

Plant L. Maximum Clique Search in Circulant k-Hypergraphs . [Internet] [Thesis]. University of Ottawa; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10393/38464.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Plant L. Maximum Clique Search in Circulant k-Hypergraphs . [Thesis]. University of Ottawa; 2018. Available from: http://hdl.handle.net/10393/38464

Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

22. Sybrandt, Justin George. Exploiting Latent Features of Text and Graphs.

Degree: PhD, School of Computing, 2020, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/2592

► As the size and scope of online data continues to grow, new machine learning techniques become necessary to best capitalize on the wealth of…
(more)

Subjects/Keywords: Conditional Text Generation; Graph Embedding; Hypergraph Partitioning; Hypothesis Generation; Literature-based Discovery; Text Embedding

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sybrandt, J. G. (2020). Exploiting Latent Features of Text and Graphs. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2592

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

Sybrandt, Justin George. “Exploiting Latent Features of Text and Graphs.” 2020. Doctoral Dissertation, Clemson University. Accessed October 01, 2020. https://tigerprints.clemson.edu/all_dissertations/2592.

MLA Handbook (7^{th} Edition):

Sybrandt, Justin George. “Exploiting Latent Features of Text and Graphs.” 2020. Web. 01 Oct 2020.

Vancouver:

Sybrandt JG. Exploiting Latent Features of Text and Graphs. [Internet] [Doctoral dissertation]. Clemson University; 2020. [cited 2020 Oct 01]. Available from: https://tigerprints.clemson.edu/all_dissertations/2592.

Council of Science Editors:

Sybrandt JG. Exploiting Latent Features of Text and Graphs. [Doctoral Dissertation]. Clemson University; 2020. Available from: https://tigerprints.clemson.edu/all_dissertations/2592

Uniwersytet im. Adama Mickiewicza w Poznaniu

23. Jackowska-Boryc, Eliza. Liczby Turána i Ramseya dla 3-jednolitych ścieżek .

Degree: 2018, Uniwersytet im. Adama Mickiewicza w Poznaniu

URL: http://hdl.handle.net/10593/24111

► Tematem pracy są liczby Ramseya i Turána dla 3-jednolitej luźnej ścieżki długości 3, oznaczonej jako P. Zaczęliśmy od wprowadzenia terminologii oraz przedstawiliśmy nasze wyniki z…
(more)

Subjects/Keywords: liczba Turána; liczba Ramseya; hipergraf; ścieżka; Turán number; Ramsey number; hypergraph; path

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jackowska-Boryc, E. (2018). Liczby Turána i Ramseya dla 3-jednolitych ścieżek . (Doctoral Dissertation). Uniwersytet im. Adama Mickiewicza w Poznaniu. Retrieved from http://hdl.handle.net/10593/24111

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

Jackowska-Boryc, Eliza. “Liczby Turána i Ramseya dla 3-jednolitych ścieżek .” 2018. Doctoral Dissertation, Uniwersytet im. Adama Mickiewicza w Poznaniu. Accessed October 01, 2020. http://hdl.handle.net/10593/24111.

MLA Handbook (7^{th} Edition):

Jackowska-Boryc, Eliza. “Liczby Turána i Ramseya dla 3-jednolitych ścieżek .” 2018. Web. 01 Oct 2020.

Vancouver:

Jackowska-Boryc E. Liczby Turána i Ramseya dla 3-jednolitych ścieżek . [Internet] [Doctoral dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10593/24111.

Council of Science Editors:

Jackowska-Boryc E. Liczby Turána i Ramseya dla 3-jednolitych ścieżek . [Doctoral Dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2018. Available from: http://hdl.handle.net/10593/24111

University of Georgia

24. Windsor, Aaron Andrew. Parallel algorithms for matching and independence problems in graphs and hypergraphs.

Degree: 2014, University of Georgia

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

► We consider the following problem: Given a greedy graph algorithm that seems to be inherently sequential, to what extent can we expect to speed up…
(more)

Subjects/Keywords: Parallel Algorithms; Maximal Independent Set; Maximal Acyclic Set; Maximal Forest; Graph; Hypergraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Windsor, A. A. (2014). Parallel algorithms for matching and independence problems in graphs and hypergraphs. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/21724

Not specified: Masters Thesis or Doctoral Dissertation

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

Windsor, Aaron Andrew. “Parallel algorithms for matching and independence problems in graphs and hypergraphs.” 2014. Thesis, University of Georgia. Accessed October 01, 2020. http://hdl.handle.net/10724/21724.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Windsor, Aaron Andrew. “Parallel algorithms for matching and independence problems in graphs and hypergraphs.” 2014. Web. 01 Oct 2020.

Vancouver:

Windsor AA. Parallel algorithms for matching and independence problems in graphs and hypergraphs. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10724/21724.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Windsor AA. Parallel algorithms for matching and independence problems in graphs and hypergraphs. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/21724

Not specified: Masters Thesis or Doctoral Dissertation

25. Bois, Rémi. Hypergraphes multimédias dirigés navigables, construction et exploitation : Navigable directed multimedia hypergraphs, construction and exploitation.

Degree: Docteur es, Informatique, 2017, Rennes 1

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

►

Cette thèse en informatique s'intéresse à la structuration et à l'exploration de collections journalistiques. Elle fait appel à plusieurs domaines de recherche : sciences sociales,… (more)

Subjects/Keywords: Recherche d'information multimédia; Traitement automatique des langues; Diversité; Hypergraphe; Multimedia retrieval; Natural language processing; Diversity; Hypergraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bois, R. (2017). Hypergraphes multimédias dirigés navigables, construction et exploitation : Navigable directed multimedia hypergraphs, construction and exploitation. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2017REN1S107

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

Bois, Rémi. “Hypergraphes multimédias dirigés navigables, construction et exploitation : Navigable directed multimedia hypergraphs, construction and exploitation.” 2017. Doctoral Dissertation, Rennes 1. Accessed October 01, 2020. http://www.theses.fr/2017REN1S107.

MLA Handbook (7^{th} Edition):

Bois, Rémi. “Hypergraphes multimédias dirigés navigables, construction et exploitation : Navigable directed multimedia hypergraphs, construction and exploitation.” 2017. Web. 01 Oct 2020.

Vancouver:

Bois R. Hypergraphes multimédias dirigés navigables, construction et exploitation : Navigable directed multimedia hypergraphs, construction and exploitation. [Internet] [Doctoral dissertation]. Rennes 1; 2017. [cited 2020 Oct 01]. Available from: http://www.theses.fr/2017REN1S107.

Council of Science Editors:

Bois R. Hypergraphes multimédias dirigés navigables, construction et exploitation : Navigable directed multimedia hypergraphs, construction and exploitation. [Doctoral Dissertation]. Rennes 1; 2017. Available from: http://www.theses.fr/2017REN1S107

26.
Wang, Guan.
STREAMING *HYPERGRAPH* PARTITION FOR MASSIVE GRAPHS.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2013, Kent State University

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

► In this thesis, a new streaming graph partition problem is studied: the *hypergraph* partition problem for massive graphs, where the goal is to partition the…
(more)

Subjects/Keywords: Computer Science; graph partition; hypergraph; sampling; sparsification

…problem: the *hypergraph*
partition problem for massive graphs. Instead of minimizing the number… …classical
*hypergraph* partition setting [22–25], where the adjacency list (or the… …minimize
the total hyperedge cut cost. In the past, *hypergraph* partition has been used in load… …x5D; and
VLSI computer aided design [22, 24]. The streaming *hypergraph* partition… …processing can be modeled in terms of the total hyperedge cut cost; moreover,
3
*hypergraph*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, G. (2013). STREAMING HYPERGRAPH PARTITION FOR MASSIVE GRAPHS. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1385097649

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

Wang, Guan. “STREAMING HYPERGRAPH PARTITION FOR MASSIVE GRAPHS.” 2013. Masters Thesis, Kent State University. Accessed October 01, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1385097649.

MLA Handbook (7^{th} Edition):

Wang, Guan. “STREAMING HYPERGRAPH PARTITION FOR MASSIVE GRAPHS.” 2013. Web. 01 Oct 2020.

Vancouver:

Wang G. STREAMING HYPERGRAPH PARTITION FOR MASSIVE GRAPHS. [Internet] [Masters thesis]. Kent State University; 2013. [cited 2020 Oct 01]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1385097649.

Council of Science Editors:

Wang G. STREAMING HYPERGRAPH PARTITION FOR MASSIVE GRAPHS. [Masters Thesis]. Kent State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1385097649

27. Huang, Hao. Various Problems in Extremal Combinatorics.

Degree: Mathematics, 2012, UCLA

URL: http://www.escholarship.org/uc/item/282049q8

► Extremal combinatorics is a central theme of discrete mathematics. It deals with the problems of finding the maximum or minimum possible cardinality of a collection…
(more)

Subjects/Keywords: Mathematics; coloring; combinatorics; extremal; hypergraph; matching; probability

…Quasi-randomness of *hypergraph* cut properties . . . . . . . . . . . .
93
6.3
Base case… …A, 119 (2012), 1200-1215.
The size of a *hypergraph* and its matching number… …Manickam-Mikl´
os-Singhi conjecture
and a problem about matchings in dense uniform *hypergraph*. We… …call a *hypergraph* H
r-uniform if all the edges have size r. Denote by ν(H) the… …application, we need the fact
that if a (k − 1)-uniform *hypergraph* on n − 1 vertices has…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, H. (2012). Various Problems in Extremal Combinatorics. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/282049q8

Not specified: Masters Thesis or Doctoral Dissertation

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

Huang, Hao. “Various Problems in Extremal Combinatorics.” 2012. Thesis, UCLA. Accessed October 01, 2020. http://www.escholarship.org/uc/item/282049q8.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Hao. “Various Problems in Extremal Combinatorics.” 2012. Web. 01 Oct 2020.

Vancouver:

Huang H. Various Problems in Extremal Combinatorics. [Internet] [Thesis]. UCLA; 2012. [cited 2020 Oct 01]. Available from: http://www.escholarship.org/uc/item/282049q8.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang H. Various Problems in Extremal Combinatorics. [Thesis]. UCLA; 2012. Available from: http://www.escholarship.org/uc/item/282049q8

Not specified: Masters Thesis or Doctoral Dissertation

28. Pauls, Adam David. Optimal Search Algorithms for Structured Problems in Natural Language Processing.

Degree: Computer Science, 2012, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/4mp9z3bd

► Many tasks in Natural Language Processing (NLP) can be formulated as the assignment of a label to an input. Often, the set of possible labels…
(more)

Subjects/Keywords: Artificial intelligence; A*; hypergraph; optimal search; parsing

…70
v
List of Figures
2.1
Basic *hypergraph* concepts. (a) A simple *hypergraph*… …weighted directed *hypergraph* (Gallo et al.,
1993). Many problems can be formulated in… …In general, optimal search in a *hypergraph* can be done using dynamic programming in time… …that can find the best path without considering all hyperedges in the
*hypergraph*, and hence… …Search
2.1 *Hypergraph* Basics and Problem Statement
A weighted directed *hypergraph* is a…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pauls, A. D. (2012). Optimal Search Algorithms for Structured Problems in Natural Language Processing. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/4mp9z3bd

Not specified: Masters Thesis or Doctoral Dissertation

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

Pauls, Adam David. “Optimal Search Algorithms for Structured Problems in Natural Language Processing.” 2012. Thesis, University of California – Berkeley. Accessed October 01, 2020. http://www.escholarship.org/uc/item/4mp9z3bd.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pauls, Adam David. “Optimal Search Algorithms for Structured Problems in Natural Language Processing.” 2012. Web. 01 Oct 2020.

Vancouver:

Pauls AD. Optimal Search Algorithms for Structured Problems in Natural Language Processing. [Internet] [Thesis]. University of California – Berkeley; 2012. [cited 2020 Oct 01]. Available from: http://www.escholarship.org/uc/item/4mp9z3bd.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pauls AD. Optimal Search Algorithms for Structured Problems in Natural Language Processing. [Thesis]. University of California – Berkeley; 2012. Available from: http://www.escholarship.org/uc/item/4mp9z3bd

Not specified: Masters Thesis or Doctoral Dissertation

Kaunas University of Technology

29. Gudonavičius, Linas. Veiklos procesų vykdymo modeliavimas, taikant UML veiklos grafus.

Degree: Master, Informatics, 2004, Kaunas University of Technology

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2004~D_20040531_142714-31449 ;

► In this thesis are analysed correctness for verification ability of UML activity diagrams by using hypergaphs. There suggested the transformation from UML activity diagram to…
(more)

Subjects/Keywords: Hipergrafas; UML; Information technologies; Informacinės technologijos; Hypergraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gudonavičius, Linas. (2004). Veiklos procesų vykdymo modeliavimas, taikant UML veiklos grafus. (Masters Thesis). Kaunas University of Technology. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2004~D_20040531_142714-31449 ;

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

Author name may be incomplete

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

Gudonavičius, Linas. “Veiklos procesų vykdymo modeliavimas, taikant UML veiklos grafus.” 2004. Masters Thesis, Kaunas University of Technology. Accessed October 01, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2004~D_20040531_142714-31449 ;.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Gudonavičius, Linas. “Veiklos procesų vykdymo modeliavimas, taikant UML veiklos grafus.” 2004. Web. 01 Oct 2020.

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

Author name may be incomplete

Vancouver:

Gudonavičius, Linas. Veiklos procesų vykdymo modeliavimas, taikant UML veiklos grafus. [Internet] [Masters thesis]. Kaunas University of Technology; 2004. [cited 2020 Oct 01]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2004~D_20040531_142714-31449 ;.

Author name may be incomplete

Council of Science Editors:

Gudonavičius, Linas. Veiklos procesų vykdymo modeliavimas, taikant UML veiklos grafus. [Masters Thesis]. Kaunas University of Technology; 2004. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2004~D_20040531_142714-31449 ;

Author name may be incomplete

University of Ottawa

30. Wagner, Andrew. Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts .

Degree: 2019, University of Ottawa

URL: http://hdl.handle.net/10393/39092

► An Euler tour of a *hypergraph* is a closed walk that traverses every edge exactly once; if a *hypergraph* admits such a walk, then it…
(more)

Subjects/Keywords: hypergraph; eulerian; Euler tour; eulerian circuit; incidence graph; Euler family; quasi-eulerian; edge cut; design; covering; triple system; Steiner triple system

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wagner, A. (2019). Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/39092

Not specified: Masters Thesis or Doctoral Dissertation

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

Wagner, Andrew. “Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts .” 2019. Thesis, University of Ottawa. Accessed October 01, 2020. http://hdl.handle.net/10393/39092.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wagner, Andrew. “Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts .” 2019. Web. 01 Oct 2020.

Vancouver:

Wagner A. Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10393/39092.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wagner A. Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/39092

Not specified: Masters Thesis or Doctoral Dissertation