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:(Disjoint Paths). Showing records 1 – 11 of 11 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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


Georgia Tech

2. Xie, Shijie. 6-connected graphs are two-three linked.

Degree: PhD, Mathematics, 2019, Georgia Tech

 Let G be a graph and a0, a1, a2, b1, and b2 be distinct vertices of G. Motivated by their work on Four Color Theorem,… (more)

Subjects/Keywords: Graph theory; Disjoint paths in graphs; Two-three linked graphs; 6-connected graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, S. (2019). 6-connected graphs are two-three linked. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62273

Chicago Manual of Style (16th Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Doctoral Dissertation, Georgia Tech. Accessed July 14, 2020. http://hdl.handle.net/1853/62273.

MLA Handbook (7th Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Web. 14 Jul 2020.

Vancouver:

Xie S. 6-connected graphs are two-three linked. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1853/62273.

Council of Science Editors:

Xie S. 6-connected graphs are two-three linked. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62273


Brock University

3. Motevallibashi, Nafiseh. Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes .

Degree: Department of Computer Science, Brock University

 The (n, k)-arrangement graph was first introduced in 1992 as a generalization of the star graph topology. Choosing an arrangement topology is more efficient in… (more)

Subjects/Keywords: augmented cubes; (n, k)-arrangement graph; disjoint shortest paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Motevallibashi, N. (n.d.). Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/13154

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

Chicago Manual of Style (16th Edition):

Motevallibashi, Nafiseh. “Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes .” Thesis, Brock University. Accessed July 14, 2020. http://hdl.handle.net/10464/13154.

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

MLA Handbook (7th Edition):

Motevallibashi, Nafiseh. “Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes .” Web. 14 Jul 2020.

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

Vancouver:

Motevallibashi N. Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes . [Internet] [Thesis]. Brock University; [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10464/13154.

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

Council of Science Editors:

Motevallibashi N. Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes . [Thesis]. Brock University; Available from: http://hdl.handle.net/10464/13154

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

4. Franco, Álvaro Junio Pereira. Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia.

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

Neste trabalho consideramos um problema da Antropologia. A modelagem de sociedades e casamentos de indivíduos é feita com grafos mistos e encontrar caminhos disjuntos é… (more)

Subjects/Keywords: acyclic digraph; algorithms for junctions; algoritmos para junções; antropologia estrutural; caminhos disjuntos; complexidade computacional; computational complexity; digrafos acíclicos; disjoint paths; structural anthropology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Franco, . J. P. (2013). Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13022014-083516/ ;

Chicago Manual of Style (16th Edition):

Franco, Álvaro Junio Pereira. “Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia.” 2013. Doctoral Dissertation, University of São Paulo. Accessed July 14, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13022014-083516/ ;.

MLA Handbook (7th Edition):

Franco, Álvaro Junio Pereira. “Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia.” 2013. Web. 14 Jul 2020.

Vancouver:

Franco JP. Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia. [Internet] [Doctoral dissertation]. University of São Paulo; 2013. [cited 2020 Jul 14]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13022014-083516/ ;.

Council of Science Editors:

Franco JP. Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia. [Doctoral Dissertation]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13022014-083516/ ;

5. Arroyo Guevara, Alan Marcelo. On 2-crossing-critical graphs with a V8-minor.

Degree: 2014, University of Waterloo

 The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of a graph. A graph G is k-crossing-critical… (more)

Subjects/Keywords: graph theory; crossing numbers; disjoint paths; crossing critical

…is an x1 y1 -path and an x2 y2 -path disjoint paths in G. Any such pair of paths constitute… …identified to a path in G using some vertices in K. Since two disjoint paths in G cannot both have… …strongly reduced. We concluded from Menger’s Theorem that there are four disjoint T X-paths… …Label the vertices of X as x1 , x2 , y1 , y2 so that there are disjoint paths P1 , P2 , P3… …edges e,f in a graph G are separated by cycles if there is a pair of disjoint cycles C1 , C2… 

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

Arroyo Guevara, A. M. (2014). On 2-crossing-critical graphs with a V8-minor. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8494

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

Arroyo Guevara, Alan Marcelo. “On 2-crossing-critical graphs with a V8-minor.” 2014. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/8494.

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

MLA Handbook (7th Edition):

Arroyo Guevara, Alan Marcelo. “On 2-crossing-critical graphs with a V8-minor.” 2014. Web. 14 Jul 2020.

Vancouver:

Arroyo Guevara AM. On 2-crossing-critical graphs with a V8-minor. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/8494.

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

Council of Science Editors:

Arroyo Guevara AM. On 2-crossing-critical graphs with a V8-minor. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8494

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

6. Daouda, Ahmat mahamat. Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants : Definition of a security and mobility infrastructure for peer-to-peer overlay networks.

Degree: Docteur es, Informatique, 2014, Bordeaux

La sécurisation inhérente aux échanges dans les environnements dynamiques et distribués, dépourvus d’une coordination centrale et dont la topologie change perpétuellement, est un défi majeur.… (more)

Subjects/Keywords: P2P; DHT; VPN mobile; Chemins disjoints; Diffie-Hellman; Schéma à seuil (k, n); P2P; (k, n) threshold scheme; Diffie-Hellman; Disjoint paths; Mobile VPN; DHT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daouda, A. m. (2014). Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants : Definition of a security and mobility infrastructure for peer-to-peer overlay networks. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2014BORD0186

Chicago Manual of Style (16th Edition):

Daouda, Ahmat mahamat. “Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants : Definition of a security and mobility infrastructure for peer-to-peer overlay networks.” 2014. Doctoral Dissertation, Bordeaux. Accessed July 14, 2020. http://www.theses.fr/2014BORD0186.

MLA Handbook (7th Edition):

Daouda, Ahmat mahamat. “Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants : Definition of a security and mobility infrastructure for peer-to-peer overlay networks.” 2014. Web. 14 Jul 2020.

Vancouver:

Daouda Am. Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants : Definition of a security and mobility infrastructure for peer-to-peer overlay networks. [Internet] [Doctoral dissertation]. Bordeaux; 2014. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2014BORD0186.

Council of Science Editors:

Daouda Am. Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants : Definition of a security and mobility infrastructure for peer-to-peer overlay networks. [Doctoral Dissertation]. Bordeaux; 2014. Available from: http://www.theses.fr/2014BORD0186

7. Rojas d'Onofrio, Jorge. Capacité opérative des réseaux de transfert de pétrole : Operative capacity of crude oil local transportation networks.

Degree: Docteur es, Automatique, 2011, INSA Lyon

Cette thèse étudie des systèmes locaux de gestion de transfert de pétrole ayant une architecture de réseau de canalisation. Pour leur représentativité, deux systèmes localisés… (more)

Subjects/Keywords: Génie industriel; Prise de décision; Recherche opérationnelle; Algorithmes de graphes; Chemins disjoints; Capacité opérative; Transport de pétrole; Réseau de canalisation; Engineering; Decision making; Operational research; Graph algorithms; Disjoint paths; Operative capacity; Crude oil transportation; Pipe networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rojas d'Onofrio, J. (2011). Capacité opérative des réseaux de transfert de pétrole : Operative capacity of crude oil local transportation networks. (Doctoral Dissertation). INSA Lyon. Retrieved from http://www.theses.fr/2011ISAL0021

Chicago Manual of Style (16th Edition):

Rojas d'Onofrio, Jorge. “Capacité opérative des réseaux de transfert de pétrole : Operative capacity of crude oil local transportation networks.” 2011. Doctoral Dissertation, INSA Lyon. Accessed July 14, 2020. http://www.theses.fr/2011ISAL0021.

MLA Handbook (7th Edition):

Rojas d'Onofrio, Jorge. “Capacité opérative des réseaux de transfert de pétrole : Operative capacity of crude oil local transportation networks.” 2011. Web. 14 Jul 2020.

Vancouver:

Rojas d'Onofrio J. Capacité opérative des réseaux de transfert de pétrole : Operative capacity of crude oil local transportation networks. [Internet] [Doctoral dissertation]. INSA Lyon; 2011. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2011ISAL0021.

Council of Science Editors:

Rojas d'Onofrio J. Capacité opérative des réseaux de transfert de pétrole : Operative capacity of crude oil local transportation networks. [Doctoral Dissertation]. INSA Lyon; 2011. Available from: http://www.theses.fr/2011ISAL0021

8. Sitanayah, Lanny. Planning the deployment of fault-tolerant wireless sensor networks.

Degree: 2013, University College Cork

 Since Wireless Sensor Networks (WSNs) are subject to failures, fault-tolerance becomes an important requirement for many WSN applications. Fault-tolerance can be enabled in different areas… (more)

Subjects/Keywords: MAC protocol; Network deployment planning; Node-disjoint paths; Centrality; Wireless sensor networks

…Sreenan. Fault-Tolerant Relay Deployment for k Node-Disjoint Paths in Wireless Sensor Networks… …LAND Localised Algorithm for Finding Node-Disjoint Paths LCL Low Contention Level LPL… …134 5 Fault-Tolerant Relay Deployment for k Vertex-Disjoint Paths 137 5.1 Introduction… …Tolerant Relay Deployment for k Vertex-Disjoint Paths 261 9.1.3 Fault-Tolerant Relay Deployment… …Disjoint Path Algorithms 273 B.1 Shortest Vertex-Disjoint Paths with Modified Dijkstra by… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sitanayah, L. (2013). Planning the deployment of fault-tolerant wireless sensor networks. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/905

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

Sitanayah, Lanny. “Planning the deployment of fault-tolerant wireless sensor networks.” 2013. Thesis, University College Cork. Accessed July 14, 2020. http://hdl.handle.net/10468/905.

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

MLA Handbook (7th Edition):

Sitanayah, Lanny. “Planning the deployment of fault-tolerant wireless sensor networks.” 2013. Web. 14 Jul 2020.

Vancouver:

Sitanayah L. Planning the deployment of fault-tolerant wireless sensor networks. [Internet] [Thesis]. University College Cork; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10468/905.

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

Council of Science Editors:

Sitanayah L. Planning the deployment of fault-tolerant wireless sensor networks. [Thesis]. University College Cork; 2013. Available from: http://hdl.handle.net/10468/905

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

9. Mahjoub, Meriem. The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms : Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes.

Degree: Docteur es, Informatique, 2017, Paris Sciences et Lettres; Université de Tunis El Manar

Dans un graphe non orienté, le problème du sous-graphe k-sommet connexe consiste à déterminer un sous-graphe de poids minimum tel que entre chaque paires de… (more)

Subjects/Keywords: Conception de réseaux; Polytope; Facette; Séparation; Algorithme de Coupes et Branchements; Algorithme de Génération de Colonnes et Branchements; K-Node-Connected graph; K-Node-Disjoint hop-Constrained paths; Survivable Network; Polytope; Facets; Separation; Branch-And-Cut; Branch-And-Cut-And-Price; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mahjoub, M. (2017). The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms : Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes. (Doctoral Dissertation). Paris Sciences et Lettres; Université de Tunis El Manar. Retrieved from http://www.theses.fr/2017PSLED046

Chicago Manual of Style (16th Edition):

Mahjoub, Meriem. “The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms : Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes.” 2017. Doctoral Dissertation, Paris Sciences et Lettres; Université de Tunis El Manar. Accessed July 14, 2020. http://www.theses.fr/2017PSLED046.

MLA Handbook (7th Edition):

Mahjoub, Meriem. “The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms : Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes.” 2017. Web. 14 Jul 2020.

Vancouver:

Mahjoub M. The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms : Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; Université de Tunis El Manar; 2017. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2017PSLED046.

Council of Science Editors:

Mahjoub M. The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms : Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes. [Doctoral Dissertation]. Paris Sciences et Lettres; Université de Tunis El Manar; 2017. Available from: http://www.theses.fr/2017PSLED046


Curtin University of Technology

10. Loh, Ruen Chze. Using edge-disjoint paths to improve the QoS in computer communications .

Degree: 2010, Curtin University of Technology

 Most of today’s computer communications use only a single (s,t) path to transmit a message from a source node s to a destination node t.… (more)

Subjects/Keywords: Lagrange Relaxation; computer communications; t) communications; edge-disjoint paths; Binary Integer Programming (BIP); Quality-of-Service (QoS); multi (s

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loh, R. C. (2010). Using edge-disjoint paths to improve the QoS in computer communications . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/2222

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

Loh, Ruen Chze. “Using edge-disjoint paths to improve the QoS in computer communications .” 2010. Thesis, Curtin University of Technology. Accessed July 14, 2020. http://hdl.handle.net/20.500.11937/2222.

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

MLA Handbook (7th Edition):

Loh, Ruen Chze. “Using edge-disjoint paths to improve the QoS in computer communications .” 2010. Web. 14 Jul 2020.

Vancouver:

Loh RC. Using edge-disjoint paths to improve the QoS in computer communications . [Internet] [Thesis]. Curtin University of Technology; 2010. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/20.500.11937/2222.

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

Council of Science Editors:

Loh RC. Using edge-disjoint paths to improve the QoS in computer communications . [Thesis]. Curtin University of Technology; 2010. Available from: http://hdl.handle.net/20.500.11937/2222

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

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

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

 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

disjoint paths and using routes on a per-packet basis. [8] examines selection of paths… …based on reliability in a MANET. The authors propose selecting a set of edge-disjoint paths… …selection problem. Specifically, using disjoint paths has been an intriguing approach in multipath… …proposed solutions to the problem of finding k-disjoint paths between two nodes in a graph. In… …k = 4, 6, 8, 10, 12, 14, 16, all disjoint paths and 8-disjoint paths. It was found that… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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

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.

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

MLA Handbook (7th 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.

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

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

.