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:(Even hole free graphs). Showing records 1 – 30 of 11926 total matches.

[1] [2] [3] [4] [5] … [398]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Aline Alves da Silva. DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.

Degree: Master, 2007, Universidade Federal do Ceará

Os conceitos de DecomposiÃÃo em Ãrvore e Largura em Ãrvore foram introduzidos por Robertson e Seymour em sua sÃrie de artigos sobre menores de grafos,… (more)

Subjects/Keywords: CIENCIA DA COMPUTACAO; Grafos planares, grafos livres de buracos pares, largura em Ãrvore, teoria de Grafos.; Planar Graphs, even-hole-free graphs, treewidth, graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, A. A. d. (2007). DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;

Chicago Manual of Style (16th Edition):

Silva, Aline Alves da. “DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.” 2007. Masters Thesis, Universidade Federal do Ceará. Accessed January 19, 2021. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;.

MLA Handbook (7th Edition):

Silva, Aline Alves da. “DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.” 2007. Web. 19 Jan 2021.

Vancouver:

Silva AAd. DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. [Internet] [Masters thesis]. Universidade Federal do Ceará 2007. [cited 2021 Jan 19]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;.

Council of Science Editors:

Silva AAd. DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. [Masters Thesis]. Universidade Federal do Ceará 2007. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;

2. Le, Ngoc Khang. Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes.

Degree: Docteur es, Informatique, 2018, Lyon

Les graphes sont des structures mathématiques utilisées pour modéliser les relations par paires entre objets. Malgré leur structure simple, les graphes ont des applications dans… (more)

Subjects/Keywords: Coloration de graphe; Reconnaissance de graphe; Sous-graphes induits; Graphes sans ISK4; Graphes sans trou pair; Coloration gloutonne connexe; Graph coloring; Graph recognition; Induced subgraphs; ISK4-free graphs; Even-hole-free graphs; Connected greedy coloring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le, N. K. (2018). Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2018LYSEN021

Chicago Manual of Style (16th Edition):

Le, Ngoc Khang. “Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes.” 2018. Doctoral Dissertation, Lyon. Accessed January 19, 2021. http://www.theses.fr/2018LYSEN021.

MLA Handbook (7th Edition):

Le, Ngoc Khang. “Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes.” 2018. Web. 19 Jan 2021.

Vancouver:

Le NK. Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes. [Internet] [Doctoral dissertation]. Lyon; 2018. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2018LYSEN021.

Council of Science Editors:

Le NK. Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes. [Doctoral Dissertation]. Lyon; 2018. Available from: http://www.theses.fr/2018LYSEN021


University of Minnesota

3. Stewart, Danielle. Even Harmonious Labelings of Disconnected Graphs.

Degree: MS, Applied and Computational Mathematics, 2015, University of Minnesota

 A graph G with q edges is called it{graceful} if there is an injection from the vertices of G to the set {0,1,…,q} such that… (more)

Subjects/Keywords: Disconnected Graphs; Even Harmonious; Graph Labeling; Graph Theory; Harmonious; Properly Even Harmonious

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stewart, D. (2015). Even Harmonious Labelings of Disconnected Graphs. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/174719

Chicago Manual of Style (16th Edition):

Stewart, Danielle. “Even Harmonious Labelings of Disconnected Graphs.” 2015. Masters Thesis, University of Minnesota. Accessed January 19, 2021. http://hdl.handle.net/11299/174719.

MLA Handbook (7th Edition):

Stewart, Danielle. “Even Harmonious Labelings of Disconnected Graphs.” 2015. Web. 19 Jan 2021.

Vancouver:

Stewart D. Even Harmonious Labelings of Disconnected Graphs. [Internet] [Masters thesis]. University of Minnesota; 2015. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/11299/174719.

Council of Science Editors:

Stewart D. Even Harmonious Labelings of Disconnected Graphs. [Masters Thesis]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/174719


Wilfrid Laurier University

4. Gorbonos, Elizabeth. Separability and Vertex Ordering of Graphs.

Degree: 2019, Wilfrid Laurier University

 Many graph optimization problems, such as finding an optimal coloring, or a largest clique, can be solved by a divide-and-conquer approach. One such well-known technique… (more)

Subjects/Keywords: graph theory; decomposition; clique cutset; simplicial extreme; even-hole; kite; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gorbonos, E. (2019). Separability and Vertex Ordering of Graphs. (Thesis). Wilfrid Laurier University. Retrieved from https://scholars.wlu.ca/etd/2148

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

Gorbonos, Elizabeth. “Separability and Vertex Ordering of Graphs.” 2019. Thesis, Wilfrid Laurier University. Accessed January 19, 2021. https://scholars.wlu.ca/etd/2148.

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

MLA Handbook (7th Edition):

Gorbonos, Elizabeth. “Separability and Vertex Ordering of Graphs.” 2019. Web. 19 Jan 2021.

Vancouver:

Gorbonos E. Separability and Vertex Ordering of Graphs. [Internet] [Thesis]. Wilfrid Laurier University; 2019. [cited 2021 Jan 19]. Available from: https://scholars.wlu.ca/etd/2148.

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

Council of Science Editors:

Gorbonos E. Separability and Vertex Ordering of Graphs. [Thesis]. Wilfrid Laurier University; 2019. Available from: https://scholars.wlu.ca/etd/2148

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


Vanderbilt University

5. Marshall, Emily Abernethy. Hamiltonicity and Structure of Classes of Minor-Free Graphs.

Degree: PhD, Mathematics, 2014, Vanderbilt University

 The main results of this dissertation are Hamiltonicity and structural results for graphs on surfaces and graphs with certain forbidden minors. The first result is… (more)

Subjects/Keywords: minor-free graphs; hamilton cycles; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marshall, E. A. (2014). Hamiltonicity and Structure of Classes of Minor-Free Graphs. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10999

Chicago Manual of Style (16th Edition):

Marshall, Emily Abernethy. “Hamiltonicity and Structure of Classes of Minor-Free Graphs.” 2014. Doctoral Dissertation, Vanderbilt University. Accessed January 19, 2021. http://hdl.handle.net/1803/10999.

MLA Handbook (7th Edition):

Marshall, Emily Abernethy. “Hamiltonicity and Structure of Classes of Minor-Free Graphs.” 2014. Web. 19 Jan 2021.

Vancouver:

Marshall EA. Hamiltonicity and Structure of Classes of Minor-Free Graphs. [Internet] [Doctoral dissertation]. Vanderbilt University; 2014. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1803/10999.

Council of Science Editors:

Marshall EA. Hamiltonicity and Structure of Classes of Minor-Free Graphs. [Doctoral Dissertation]. Vanderbilt University; 2014. Available from: http://hdl.handle.net/1803/10999


University of Windsor

6. Khanduja, Sudiksha. Weakly Chordal Graphs: An Experimental Study.

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

 Graph theory is an important field that enables one to get general ideas about graphs and their properties. There are many situations (such as generating… (more)

Subjects/Keywords: Antihole; Generation Algorithm; Graph Theory; Hole; Weakly Chordal Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khanduja, S. (2020). Weakly Chordal Graphs: An Experimental Study. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/8377

Chicago Manual of Style (16th Edition):

Khanduja, Sudiksha. “Weakly Chordal Graphs: An Experimental Study.” 2020. Masters Thesis, University of Windsor. Accessed January 19, 2021. https://scholar.uwindsor.ca/etd/8377.

MLA Handbook (7th Edition):

Khanduja, Sudiksha. “Weakly Chordal Graphs: An Experimental Study.” 2020. Web. 19 Jan 2021.

Vancouver:

Khanduja S. Weakly Chordal Graphs: An Experimental Study. [Internet] [Masters thesis]. University of Windsor; 2020. [cited 2021 Jan 19]. Available from: https://scholar.uwindsor.ca/etd/8377.

Council of Science Editors:

Khanduja S. Weakly Chordal Graphs: An Experimental Study. [Masters Thesis]. University of Windsor; 2020. Available from: https://scholar.uwindsor.ca/etd/8377


University of Maryland

7. Sharon, Gilad. MODELING THE PHYSICS OF FAILURE FOR ELECTRONIC PACKAGING COMPONENTS SUBJECTED TO THERMAL AND MECHANICAL LOADING.

Degree: Mechanical Engineering, 2011, University of Maryland

 This dissertation presents three separate studies that examined electronic components using numerical modeling approaches. The use of modeling techniques provided a deeper understanding of the… (more)

Subjects/Keywords: Engineering; Capacitor cracking; Lead free; MEMS; Modeling; Plated Through Hole; Solder

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharon, G. (2011). MODELING THE PHYSICS OF FAILURE FOR ELECTRONIC PACKAGING COMPONENTS SUBJECTED TO THERMAL AND MECHANICAL LOADING. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/11937

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

Sharon, Gilad. “MODELING THE PHYSICS OF FAILURE FOR ELECTRONIC PACKAGING COMPONENTS SUBJECTED TO THERMAL AND MECHANICAL LOADING.” 2011. Thesis, University of Maryland. Accessed January 19, 2021. http://hdl.handle.net/1903/11937.

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

MLA Handbook (7th Edition):

Sharon, Gilad. “MODELING THE PHYSICS OF FAILURE FOR ELECTRONIC PACKAGING COMPONENTS SUBJECTED TO THERMAL AND MECHANICAL LOADING.” 2011. Web. 19 Jan 2021.

Vancouver:

Sharon G. MODELING THE PHYSICS OF FAILURE FOR ELECTRONIC PACKAGING COMPONENTS SUBJECTED TO THERMAL AND MECHANICAL LOADING. [Internet] [Thesis]. University of Maryland; 2011. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1903/11937.

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

Council of Science Editors:

Sharon G. MODELING THE PHYSICS OF FAILURE FOR ELECTRONIC PACKAGING COMPONENTS SUBJECTED TO THERMAL AND MECHANICAL LOADING. [Thesis]. University of Maryland; 2011. Available from: http://hdl.handle.net/1903/11937

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


Texas A&M University

8. Pearce, Roger Allan. Scalable Parallel Algorithms for Massive Scale-free Graphs.

Degree: PhD, Computer Science, 2013, Texas A&M University

 Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New… (more)

Subjects/Keywords: parallel algorithms; graph algorithms; scale-free graphs; graph partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151937

Chicago Manual of Style (16th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Doctoral Dissertation, Texas A&M University. Accessed January 19, 2021. http://hdl.handle.net/1969.1/151937.

MLA Handbook (7th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 19 Jan 2021.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1969.1/151937.

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151937


Indian Institute of Science

9. Goyal, Prachi. Parameterized Complexity of Maximum Edge Coloring in Graphs.

Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science

 The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent… (more)

Subjects/Keywords: Graph Theory; Graphs; Graphs - Coloring; Parameterized Complexity; Maximum Edge Coloring (Graphs); Fixed Parameter Tractable Algorithms; Kernelization; Graph Edge Coloring; FPT Algorithm; Polynomial Kernel; C4-free Graphs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goyal, P. (2018). Parameterized Complexity of Maximum Edge Coloring in Graphs. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3255

Chicago Manual of Style (16th Edition):

Goyal, Prachi. “Parameterized Complexity of Maximum Edge Coloring in Graphs.” 2018. Masters Thesis, Indian Institute of Science. Accessed January 19, 2021. http://etd.iisc.ac.in/handle/2005/3255.

MLA Handbook (7th Edition):

Goyal, Prachi. “Parameterized Complexity of Maximum Edge Coloring in Graphs.” 2018. Web. 19 Jan 2021.

Vancouver:

Goyal P. Parameterized Complexity of Maximum Edge Coloring in Graphs. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 Jan 19]. Available from: http://etd.iisc.ac.in/handle/2005/3255.

Council of Science Editors:

Goyal P. Parameterized Complexity of Maximum Edge Coloring in Graphs. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3255


Queen Mary, University of London

10. Ball, Neville. Random Structures.

Degree: PhD, 2015, Queen Mary, University of London

 For many combinatorial objects we can associate a natural probability distribution on the members of the class, and we can then call the resulting class… (more)

Subjects/Keywords: 519.2; random structures; Probabilistic tools; geometric graphs; Sum-Free Sets; combinatorial objects

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ball, N. (2015). Random Structures. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/7902 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658663

Chicago Manual of Style (16th Edition):

Ball, Neville. “Random Structures.” 2015. Doctoral Dissertation, Queen Mary, University of London. Accessed January 19, 2021. http://qmro.qmul.ac.uk/xmlui/handle/123456789/7902 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658663.

MLA Handbook (7th Edition):

Ball, Neville. “Random Structures.” 2015. Web. 19 Jan 2021.

Vancouver:

Ball N. Random Structures. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2015. [cited 2021 Jan 19]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/7902 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658663.

Council of Science Editors:

Ball N. Random Structures. [Doctoral Dissertation]. Queen Mary, University of London; 2015. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/7902 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658663

11. 森本, 真一. 時系列データに基づいた Scale Free Graph モデルに関する研究.

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

Supervisor: 上原隆平

情報科学研究科

修士

Subjects/Keywords: Blog データ, Scale Free Graph, Interval Graph, Max-Tolerance Graph; Blog data, scale free graphs, interval graphs, max-tolerance graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

森本, . (n.d.). 時系列データに基づいた Scale Free Graph モデルに関する研究. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/8101

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

森本, 真一. “時系列データに基づいた Scale Free Graph モデルに関する研究.” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed January 19, 2021. http://hdl.handle.net/10119/8101.

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

森本, 真一. “時系列データに基づいた Scale Free Graph モデルに関する研究.” Web. 19 Jan 2021.

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

Vancouver:

森本 . 時系列データに基づいた Scale Free Graph モデルに関する研究. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10119/8101.

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:

森本 . 時系列データに基づいた Scale Free Graph モデルに関する研究. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/8101

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

12. Arvind, N R. Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.

Degree: Mathematical Science, 2010, INFLIBNET

This thesis deals mainly with two related coloring problems ? forbidden subgraph colorings and oriented colorings. The former deals with proper colorings of vertices or… (more)

Subjects/Keywords: Graphs; Graphs dimensions; Graphs colorings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arvind, N. R. (2010). Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/4726

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

Arvind, N R. “Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.” 2010. Thesis, INFLIBNET. Accessed January 19, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/4726.

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

MLA Handbook (7th Edition):

Arvind, N R. “Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.” 2010. Web. 19 Jan 2021.

Vancouver:

Arvind NR. Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. [Internet] [Thesis]. INFLIBNET; 2010. [cited 2021 Jan 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4726.

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

Council of Science Editors:

Arvind NR. Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. [Thesis]. INFLIBNET; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4726

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


Arizona State University

13. Das, Sayantan. Interfacial and Electrode Modifications in P3HT:PC61BM based Organic Solar Cells: Devices, Processing and Characterization.

Degree: Chemistry, 2015, Arizona State University

 The inexorable upsurge in world’s energy demand has steered the search for newer renewable energy sources and photovoltaics seemed to be one of the best… (more)

Subjects/Keywords: Chemistry; Materials Science; copper iodide hole transport layer; HMDS modified ITO; ITO free electrode; organic solar cells; P3HT:PC61BM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, S. (2015). Interfacial and Electrode Modifications in P3HT:PC61BM based Organic Solar Cells: Devices, Processing and Characterization. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/34828

Chicago Manual of Style (16th Edition):

Das, Sayantan. “Interfacial and Electrode Modifications in P3HT:PC61BM based Organic Solar Cells: Devices, Processing and Characterization.” 2015. Doctoral Dissertation, Arizona State University. Accessed January 19, 2021. http://repository.asu.edu/items/34828.

MLA Handbook (7th Edition):

Das, Sayantan. “Interfacial and Electrode Modifications in P3HT:PC61BM based Organic Solar Cells: Devices, Processing and Characterization.” 2015. Web. 19 Jan 2021.

Vancouver:

Das S. Interfacial and Electrode Modifications in P3HT:PC61BM based Organic Solar Cells: Devices, Processing and Characterization. [Internet] [Doctoral dissertation]. Arizona State University; 2015. [cited 2021 Jan 19]. Available from: http://repository.asu.edu/items/34828.

Council of Science Editors:

Das S. Interfacial and Electrode Modifications in P3HT:PC61BM based Organic Solar Cells: Devices, Processing and Characterization. [Doctoral Dissertation]. Arizona State University; 2015. Available from: http://repository.asu.edu/items/34828


Australian National University

14. Rezvani, Mojtaba. Community Structure in Large-Scale Complex Networks .

Degree: 2019, Australian National University

 Vertices in complex networks can be grouped into communities, where vertices inside communities are densely connected to each other and vertices from one community are… (more)

Subjects/Keywords: complex networks; community structure; community detection; community search; overlapping community detection; structural hole spanners; social networks; large-scale networks; large-scale graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rezvani, M. (2019). Community Structure in Large-Scale Complex Networks . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/187032

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

Rezvani, Mojtaba. “Community Structure in Large-Scale Complex Networks .” 2019. Thesis, Australian National University. Accessed January 19, 2021. http://hdl.handle.net/1885/187032.

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

MLA Handbook (7th Edition):

Rezvani, Mojtaba. “Community Structure in Large-Scale Complex Networks .” 2019. Web. 19 Jan 2021.

Vancouver:

Rezvani M. Community Structure in Large-Scale Complex Networks . [Internet] [Thesis]. Australian National University; 2019. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1885/187032.

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

Council of Science Editors:

Rezvani M. Community Structure in Large-Scale Complex Networks . [Thesis]. Australian National University; 2019. Available from: http://hdl.handle.net/1885/187032

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


McMaster University

15. Mhaskar, Neerja. A Generalization of Square-free Strings.

Degree: PhD, 2016, McMaster University

Our research is in the general area of String Algorithms and Combinatorics on Words. Specifically, we study a generalization of square-free strings, shuffle properties of… (more)

Subjects/Keywords: Strings; Repetitions; Square-free; Thue Morphisms; Formalism for strings; Proof Complexity; String Algorithms; String shuffle; Graphs and string shuffle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mhaskar, N. (2016). A Generalization of Square-free Strings. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/20492

Chicago Manual of Style (16th Edition):

Mhaskar, Neerja. “A Generalization of Square-free Strings.” 2016. Doctoral Dissertation, McMaster University. Accessed January 19, 2021. http://hdl.handle.net/11375/20492.

MLA Handbook (7th Edition):

Mhaskar, Neerja. “A Generalization of Square-free Strings.” 2016. Web. 19 Jan 2021.

Vancouver:

Mhaskar N. A Generalization of Square-free Strings. [Internet] [Doctoral dissertation]. McMaster University; 2016. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/11375/20492.

Council of Science Editors:

Mhaskar N. A Generalization of Square-free Strings. [Doctoral Dissertation]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/20492


University of Dayton

16. Krishnamurthy, Chandra Mohan. The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs.

Degree: Master of Computer Science (M.C.S.), Computer Science, 2009, University of Dayton

 An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge… (more)

Subjects/Keywords: Computer Science; Maximum induced matching; Induced matching; hhd-free graphs; chordal graphs; weakly chordal graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krishnamurthy, C. M. (2009). The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs. (Masters Thesis). University of Dayton. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=dayton1262624006

Chicago Manual of Style (16th Edition):

Krishnamurthy, Chandra Mohan. “The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs.” 2009. Masters Thesis, University of Dayton. Accessed January 19, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1262624006.

MLA Handbook (7th Edition):

Krishnamurthy, Chandra Mohan. “The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs.” 2009. Web. 19 Jan 2021.

Vancouver:

Krishnamurthy CM. The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs. [Internet] [Masters thesis]. University of Dayton; 2009. [cited 2021 Jan 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=dayton1262624006.

Council of Science Editors:

Krishnamurthy CM. The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs. [Masters Thesis]. University of Dayton; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=dayton1262624006


NSYSU

17. Fu, Chien-jung. Design of Various VLSI Sorting Accelerator Architectures.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 In this thesis, various designs of VLSI sorter architectures are proposed. This thesis first presents a baseline serial sorter architecture built on a central memory… (more)

Subjects/Keywords: Sorter; Odd-Even merge sort

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fu, C. (2009). Design of Various VLSI Sorting Accelerator Architectures. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-115655

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

Fu, Chien-jung. “Design of Various VLSI Sorting Accelerator Architectures.” 2009. Thesis, NSYSU. Accessed January 19, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-115655.

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

MLA Handbook (7th Edition):

Fu, Chien-jung. “Design of Various VLSI Sorting Accelerator Architectures.” 2009. Web. 19 Jan 2021.

Vancouver:

Fu C. Design of Various VLSI Sorting Accelerator Architectures. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Jan 19]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-115655.

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

Council of Science Editors:

Fu C. Design of Various VLSI Sorting Accelerator Architectures. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-115655

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

18. Sibel, Jean-Christophe. Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation : Approximation basée régions pour résoudre l'inférence dans les graphes factoriels à boucles : application au décodage des codes LDPC par le Generalized Belief Propagation.

Degree: Docteur es, STIC (sciences et technologies de l'information et de la communication) - Cergy, 2013, Cergy-Pontoise

Dans cette thèse, nous étudions le problème de l'inférence bayésienne dans les graphes factoriels, en particulier les codes LDPC, quasiment résolus par les algorithmes de… (more)

Subjects/Keywords: Graphe factoriel; Ldpc; Énergie libre variationnelle; Approximation basée régions; Trapping sets; Chaos; Factor graphs; Ldpc; Variational free energy; Region-based approximation; Trapping sets; Chaos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sibel, J. (2013). Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation : Approximation basée régions pour résoudre l'inférence dans les graphes factoriels à boucles : application au décodage des codes LDPC par le Generalized Belief Propagation. (Doctoral Dissertation). Cergy-Pontoise. Retrieved from http://www.theses.fr/2013CERG0629

Chicago Manual of Style (16th Edition):

Sibel, Jean-Christophe. “Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation : Approximation basée régions pour résoudre l'inférence dans les graphes factoriels à boucles : application au décodage des codes LDPC par le Generalized Belief Propagation.” 2013. Doctoral Dissertation, Cergy-Pontoise. Accessed January 19, 2021. http://www.theses.fr/2013CERG0629.

MLA Handbook (7th Edition):

Sibel, Jean-Christophe. “Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation : Approximation basée régions pour résoudre l'inférence dans les graphes factoriels à boucles : application au décodage des codes LDPC par le Generalized Belief Propagation.” 2013. Web. 19 Jan 2021.

Vancouver:

Sibel J. Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation : Approximation basée régions pour résoudre l'inférence dans les graphes factoriels à boucles : application au décodage des codes LDPC par le Generalized Belief Propagation. [Internet] [Doctoral dissertation]. Cergy-Pontoise; 2013. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2013CERG0629.

Council of Science Editors:

Sibel J. Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation : Approximation basée régions pour résoudre l'inférence dans les graphes factoriels à boucles : application au décodage des codes LDPC par le Generalized Belief Propagation. [Doctoral Dissertation]. Cergy-Pontoise; 2013. Available from: http://www.theses.fr/2013CERG0629


Université de Grenoble

19. Morel, Gregory. Stabilité et coloration des graphes sans P5 : Independent sets and coloring in P5-free graphs.

Degree: Docteur es, Mathématiques et informatique, 2011, Université de Grenoble

La classe des graphes sans P5, c'est-à-dire des graphes ne contenant pas de chaîne induite à cinq sommets, est d'un intérêt particulier en théorie des… (more)

Subjects/Keywords: Théorie des graphes; Optimisation combinatoire; Stabilité; Coloration; Graphes sans P5; Graph Theory; Combinatorial optimization; Maximum Independent Set problem; Coloring; P5-free graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morel, G. (2011). Stabilité et coloration des graphes sans P5 : Independent sets and coloring in P5-free graphs. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2011GRENM042

Chicago Manual of Style (16th Edition):

Morel, Gregory. “Stabilité et coloration des graphes sans P5 : Independent sets and coloring in P5-free graphs.” 2011. Doctoral Dissertation, Université de Grenoble. Accessed January 19, 2021. http://www.theses.fr/2011GRENM042.

MLA Handbook (7th Edition):

Morel, Gregory. “Stabilité et coloration des graphes sans P5 : Independent sets and coloring in P5-free graphs.” 2011. Web. 19 Jan 2021.

Vancouver:

Morel G. Stabilité et coloration des graphes sans P5 : Independent sets and coloring in P5-free graphs. [Internet] [Doctoral dissertation]. Université de Grenoble; 2011. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2011GRENM042.

Council of Science Editors:

Morel G. Stabilité et coloration des graphes sans P5 : Independent sets and coloring in P5-free graphs. [Doctoral Dissertation]. Université de Grenoble; 2011. Available from: http://www.theses.fr/2011GRENM042


Uniwersytet im. Adama Mickiewicza w Poznaniu

20. Antoniuk, Sylwia. Silne funkcje progowe dla pewnych własności grup losowych .

Degree: 2014, Uniwersytet im. Adama Mickiewicza w Poznaniu

 Rozprawa poświęcona jest badaniu ewolucji losowej grupy trójkątnej, zdefiniowanej jako grupa zadana losową prezentacją grupy z relatorami długości trzy. W pracy stosujemy model dwumianowy takiej… (more)

Subjects/Keywords: grupy losowe; random groups; funkcje progowe; threshold functions; grafy losowe; random graphs; grupa wolna; free groups; własność (T) Kazhdana; Kazhdan's property (T)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Antoniuk, S. (2014). Silne funkcje progowe dla pewnych własności grup losowych . (Doctoral Dissertation). Uniwersytet im. Adama Mickiewicza w Poznaniu. Retrieved from http://hdl.handle.net/10593/10974

Chicago Manual of Style (16th Edition):

Antoniuk, Sylwia. “Silne funkcje progowe dla pewnych własności grup losowych .” 2014. Doctoral Dissertation, Uniwersytet im. Adama Mickiewicza w Poznaniu. Accessed January 19, 2021. http://hdl.handle.net/10593/10974.

MLA Handbook (7th Edition):

Antoniuk, Sylwia. “Silne funkcje progowe dla pewnych własności grup losowych .” 2014. Web. 19 Jan 2021.

Vancouver:

Antoniuk S. Silne funkcje progowe dla pewnych własności grup losowych . [Internet] [Doctoral dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2014. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10593/10974.

Council of Science Editors:

Antoniuk S. Silne funkcje progowe dla pewnych własności grup losowych . [Doctoral Dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2014. Available from: http://hdl.handle.net/10593/10974

21. Tian, Tao. Degree Conditions for Hamiltonian Properties of Claw-free Graphs.

Degree: 2018, Ipskamp Printing

 This thesis contains many new contributions to the field of hamiltonian graph theory, a very active subfield of graph theory. In particular, we have obtained… (more)

Subjects/Keywords: Degree conditions; Hamilton cycle; Hamilton path; Closure; Reduction; Claw-free graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tian, T. (2018). Degree Conditions for Hamiltonian Properties of Claw-free Graphs. (Doctoral Dissertation). Ipskamp Printing. Retrieved from https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; 47d10092-82bd-4a30-9cb0-4bac2daa563f ; 10.3990/1.9789036546102 ; urn:isbn:978-90-365-4610-2 ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html

Chicago Manual of Style (16th Edition):

Tian, Tao. “Degree Conditions for Hamiltonian Properties of Claw-free Graphs.” 2018. Doctoral Dissertation, Ipskamp Printing. Accessed January 19, 2021. https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; 47d10092-82bd-4a30-9cb0-4bac2daa563f ; 10.3990/1.9789036546102 ; urn:isbn:978-90-365-4610-2 ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html.

MLA Handbook (7th Edition):

Tian, Tao. “Degree Conditions for Hamiltonian Properties of Claw-free Graphs.” 2018. Web. 19 Jan 2021.

Vancouver:

Tian T. Degree Conditions for Hamiltonian Properties of Claw-free Graphs. [Internet] [Doctoral dissertation]. Ipskamp Printing; 2018. [cited 2021 Jan 19]. Available from: https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; 47d10092-82bd-4a30-9cb0-4bac2daa563f ; 10.3990/1.9789036546102 ; urn:isbn:978-90-365-4610-2 ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html.

Council of Science Editors:

Tian T. Degree Conditions for Hamiltonian Properties of Claw-free Graphs. [Doctoral Dissertation]. Ipskamp Printing; 2018. Available from: https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; 47d10092-82bd-4a30-9cb0-4bac2daa563f ; 10.3990/1.9789036546102 ; urn:isbn:978-90-365-4610-2 ; urn:nbn:nl:ui:28-47d10092-82bd-4a30-9cb0-4bac2daa563f ; https://research.utwente.nl/en/publications/degree-conditions-for-hamiltonian-properties-of-clawfree-graphs(47d10092-82bd-4a30-9cb0-4bac2daa563f).html

22. Mozes, Shay. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.

Degree: PhD, Computer Science, 2013, Brown University

 Large graphs are ubiquitous in many diverse fields ranging from sociology and economics to biology and engineering. Applications in numerous areas such as transportation, geographical… (more)

Subjects/Keywords: planar graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mozes, S. (2013). Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:320482/

Chicago Manual of Style (16th Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Doctoral Dissertation, Brown University. Accessed January 19, 2021. https://repository.library.brown.edu/studio/item/bdr:320482/.

MLA Handbook (7th Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Web. 19 Jan 2021.

Vancouver:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Internet] [Doctoral dissertation]. Brown University; 2013. [cited 2021 Jan 19]. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/.

Council of Science Editors:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Doctoral Dissertation]. Brown University; 2013. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/

23. Camarero Coterillo, Cristobal. Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos.

Degree: 2015, Universidad de Cantabria

 ABSTRACT: The topology of a interconnection network is the graph of its routers. The topologies that are being currently used in large supercomputers can be… (more)

Subjects/Keywords: Graphs

…Afterwards, it is seen that indeed the Hamming graphs allow for deadlock-free routing without VCs… …brings the definition of lattice graphs, which actually contains all Cayley graphs over Abelian… …used in crystallography. When these are used to define lattice graphs, good properties are… …machines. From the properties of these crystal lattice graphs the symmetry is very notable; it is… …obtained that symmetric lattice graphs have better performance than the asymmetric ones. This… 

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

Camarero Coterillo, C. (2015). Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos. (Doctoral Dissertation). Universidad de Cantabria. Retrieved from http://hdl.handle.net/10902/6542

Chicago Manual of Style (16th Edition):

Camarero Coterillo, Cristobal. “Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos.” 2015. Doctoral Dissertation, Universidad de Cantabria. Accessed January 19, 2021. http://hdl.handle.net/10902/6542.

MLA Handbook (7th Edition):

Camarero Coterillo, Cristobal. “Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos.” 2015. Web. 19 Jan 2021.

Vancouver:

Camarero Coterillo C. Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos. [Internet] [Doctoral dissertation]. Universidad de Cantabria; 2015. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10902/6542.

Council of Science Editors:

Camarero Coterillo C. Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos. [Doctoral Dissertation]. Universidad de Cantabria; 2015. Available from: http://hdl.handle.net/10902/6542


University of Florida

24. Alipanahi Ramandi, Bahareh. Variants and Applications of Colored De Bruijn Graphs.

Degree: PhD, Computer Science - Computer and Information Science and Engineering, 2020, University of Florida

 Colored de Bruijn graphs,extensions of the de Bruijn graphs are fundamental data structures for the analysis of high-throughput sequencing data. Although colored de Bruin graphs(more)

Subjects/Keywords: coloredgraphs  – graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alipanahi Ramandi, B. (2020). Variants and Applications of Colored De Bruijn Graphs. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0056439

Chicago Manual of Style (16th Edition):

Alipanahi Ramandi, Bahareh. “Variants and Applications of Colored De Bruijn Graphs.” 2020. Doctoral Dissertation, University of Florida. Accessed January 19, 2021. https://ufdc.ufl.edu/UFE0056439.

MLA Handbook (7th Edition):

Alipanahi Ramandi, Bahareh. “Variants and Applications of Colored De Bruijn Graphs.” 2020. Web. 19 Jan 2021.

Vancouver:

Alipanahi Ramandi B. Variants and Applications of Colored De Bruijn Graphs. [Internet] [Doctoral dissertation]. University of Florida; 2020. [cited 2021 Jan 19]. Available from: https://ufdc.ufl.edu/UFE0056439.

Council of Science Editors:

Alipanahi Ramandi B. Variants and Applications of Colored De Bruijn Graphs. [Doctoral Dissertation]. University of Florida; 2020. Available from: https://ufdc.ufl.edu/UFE0056439


Rutgers University

25. Baron, Jacob D., 1988-. Two problems on cycles in random graphs.

Degree: PhD, Mathematics, 2016, Rutgers University

We prove three results. First, an old conjecture of Zs. Tuza says that for any graph G, the ratio of the minimum size, τ3(G), of… (more)

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baron, Jacob D., 1. (2016). Two problems on cycles in random graphs. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51229/

Chicago Manual of Style (16th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Doctoral Dissertation, Rutgers University. Accessed January 19, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

MLA Handbook (7th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Web. 19 Jan 2021.

Vancouver:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Jan 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

Council of Science Editors:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/


University of Oxford

26. Saller, Sophia. Local limit theorem in random graphs and graphs on non-constant surfaces.

Degree: PhD, 2020, University of Oxford

 The thesis is split into two parts. In the first part we prove a local limit theorem for the number of appearances of the complete… (more)

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saller, S. (2020). Local limit theorem in random graphs and graphs on non-constant surfaces. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535

Chicago Manual of Style (16th Edition):

Saller, Sophia. “Local limit theorem in random graphs and graphs on non-constant surfaces.” 2020. Doctoral Dissertation, University of Oxford. Accessed January 19, 2021. http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535.

MLA Handbook (7th Edition):

Saller, Sophia. “Local limit theorem in random graphs and graphs on non-constant surfaces.” 2020. Web. 19 Jan 2021.

Vancouver:

Saller S. Local limit theorem in random graphs and graphs on non-constant surfaces. [Internet] [Doctoral dissertation]. University of Oxford; 2020. [cited 2021 Jan 19]. Available from: http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535.

Council of Science Editors:

Saller S. Local limit theorem in random graphs and graphs on non-constant surfaces. [Doctoral Dissertation]. University of Oxford; 2020. Available from: http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535


Indian Institute of Science

27. Francis, Mathew C. Intersection Graphs Of Boxes And Cubes.

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

 A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such… (more)

Subjects/Keywords: Computer Graphics; Boxicity (Graphs); Cubicity (Graphs); Interval Graphs; Halin Graphs; Planar Graphs; Intersection Graphs; Random Graphs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Francis, M. C. (2011). Intersection Graphs Of Boxes And Cubes. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/1027

Chicago Manual of Style (16th Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2011. Doctoral Dissertation, Indian Institute of Science. Accessed January 19, 2021. http://etd.iisc.ac.in/handle/2005/1027.

MLA Handbook (7th Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2011. Web. 19 Jan 2021.

Vancouver:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2011. [cited 2021 Jan 19]. Available from: http://etd.iisc.ac.in/handle/2005/1027.

Council of Science Editors:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Doctoral Dissertation]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ac.in/handle/2005/1027


Oregon State University

28. Polit, Gabriela. Self-identity and self-esteem of recent female Mexican migrants in an even start program.

Degree: MA, Applied Anthropology, 2003, Oregon State University

 The purpose of the study is to explore the life experiences, identities, and self-esteem of a group of Mexican women who attend Even Start, a… (more)

Subjects/Keywords: Even Start programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Polit, G. (2003). Self-identity and self-esteem of recent female Mexican migrants in an even start program. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/28456

Chicago Manual of Style (16th Edition):

Polit, Gabriela. “Self-identity and self-esteem of recent female Mexican migrants in an even start program.” 2003. Masters Thesis, Oregon State University. Accessed January 19, 2021. http://hdl.handle.net/1957/28456.

MLA Handbook (7th Edition):

Polit, Gabriela. “Self-identity and self-esteem of recent female Mexican migrants in an even start program.” 2003. Web. 19 Jan 2021.

Vancouver:

Polit G. Self-identity and self-esteem of recent female Mexican migrants in an even start program. [Internet] [Masters thesis]. Oregon State University; 2003. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1957/28456.

Council of Science Editors:

Polit G. Self-identity and self-esteem of recent female Mexican migrants in an even start program. [Masters Thesis]. Oregon State University; 2003. Available from: http://hdl.handle.net/1957/28456


Anna University

29. Sivaram M. Odd and even point crossover based Tabu ga for data fusion in Information retrieval;.

Degree: Odd and even point crossover based Tabu ga for data fusion in Information retrieval, 2015, Anna University

The retrieval schemes arrange process and list the documents in the newlinecorpus against the user query The schemes differ from each other in any one… (more)

Subjects/Keywords: Genetic algorithm; Odd and even poin

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

M, S. (2015). Odd and even point crossover based Tabu ga for data fusion in Information retrieval;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/38935

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

M, Sivaram. “Odd and even point crossover based Tabu ga for data fusion in Information retrieval;.” 2015. Thesis, Anna University. Accessed January 19, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/38935.

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

MLA Handbook (7th Edition):

M, Sivaram. “Odd and even point crossover based Tabu ga for data fusion in Information retrieval;.” 2015. Web. 19 Jan 2021.

Vancouver:

M S. Odd and even point crossover based Tabu ga for data fusion in Information retrieval;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Jan 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38935.

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

Council of Science Editors:

M S. Odd and even point crossover based Tabu ga for data fusion in Information retrieval;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38935

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


University of Waterloo

30. Pivotto, Irene. On Excluded Minors for Even Cut Matroids.

Degree: 2007, University of Waterloo

 In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph… (more)

Subjects/Keywords: even cut matroid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pivotto, I. (2007). On Excluded Minors for Even Cut Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2680

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

Pivotto, Irene. “On Excluded Minors for Even Cut Matroids.” 2007. Thesis, University of Waterloo. Accessed January 19, 2021. http://hdl.handle.net/10012/2680.

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

MLA Handbook (7th Edition):

Pivotto, Irene. “On Excluded Minors for Even Cut Matroids.” 2007. Web. 19 Jan 2021.

Vancouver:

Pivotto I. On Excluded Minors for Even Cut Matroids. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10012/2680.

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

Council of Science Editors:

Pivotto I. On Excluded Minors for Even Cut Matroids. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2680

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

[1] [2] [3] [4] [5] … [398]

.