Advanced search options

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

You searched for `subject:(Random regular graph)`

.
Showing records 1 – 4 of
4 total matches.

▼ Search Limiters

ETH Zürich

1. Kamčev, Nina. Colourings of Graphs and Words.

Degree: 2018, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/282692

► Extremal *graph* theory is concerned with the extreme values of a *graph* parameter over various classes of graphs. Randomised constructions have played a major role…
(more)

Subjects/Keywords: random graphs; Ramsey theory; Graph theory; Random regular graph; Random processes; Hales-Jewett theorem; Local lemma; info:eu-repo/classification/ddc/510; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kamčev, N. (2018). Colourings of Graphs and Words. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/282692

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

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Doctoral Dissertation, ETH Zürich. Accessed July 14, 2020. http://hdl.handle.net/20.500.11850/282692.

MLA Handbook (7^{th} Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Web. 14 Jul 2020.

Vancouver:

Kamčev N. Colourings of Graphs and Words. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/20.500.11850/282692.

Council of Science Editors:

Kamčev N. Colourings of Graphs and Words. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/282692

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

Degree: 2018, University of Alicante

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

3. Delcourt, Michelle Jeannette. Viewing extremal and structural problems through a probabilistic lens.

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

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

► This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the…
(more)

Subjects/Keywords: Small subgraph conditioning method; Random regular graph; Intersecting families; Star decomposition; Structural graph theory; Extremal combinatorcs

…*random* 4-*regular* *graph* on n vertices has an orientation with out-degrees 0 or 3
asymptotically… …Decompositions of *Random* *Regular* Graphs
As Barát and Thomassen [11] note, decompositions of… …with certain requirements. For instance, given a 4-*regular* planar
*graph* G, an orientation in… …asked if every 4-edge-connected, 4-*regular* *graph*
has an orientation with out-degrees 0 or 3… …Conjecture 3.1.7. Every 4-edge-connected, 4-*regular* planar *graph* has an orientation with out…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Delcourt, M. J. (2017). Viewing extremal and structural problems through a probabilistic lens. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97669

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

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/97669.

MLA Handbook (7^{th} Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Web. 14 Jul 2020.

Vancouver:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/97669.

Council of Science Editors:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97669

4. Sharma, Abhishek. High throughput path selection for unstructured data center networks.

Degree: MS, 0112, 2013, University of Illinois – Urbana-Champaign

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

► The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work…
(more)

Subjects/Keywords: Data Center; Multipath Transmission Control Protocol (MPTCP); Jellyfish; Shortest Paths; Disjoint Paths; Throughput; Random Regular Graph (RRG); Random Permutation Matrix; Switches; Servers; Ports; Network Density

…computed once the *random* *regular* *graph* and traffic matrix
has been constructed.
We tested and… …are all conducted on the Jellyfish topology. The topology
is essentially a *random* *regular*… …proposed solutions to the problem of
finding k-disjoint paths between two nodes in a *graph*. In… …Chapter 3
Simulation Setup
3.1
*Graph* construction
The experiments conducted in this paper… …*graph* constructed at the top-of-rack (ToR) switch layer. Each switch
consists of p…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sharma, A. (2013). High throughput path selection for unstructured data center networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45451

Not specified: Masters Thesis or Doctoral Dissertation

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

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/45451.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Web. 14 Jul 2020.

Vancouver:

Sharma A. High throughput path selection for unstructured data center networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/45451.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sharma A. High throughput path selection for unstructured data center networks. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45451

Not specified: Masters Thesis or Doctoral Dissertation