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:(Labeled packing of graph). Showing records 1 – 30 of 241181 total matches.

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

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Mortada, Maidoun. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.

Degree: Docteur es, Informatique, 2013, Université Claude Bernard – Lyon I

Les deux problèmes majeurs considérés dans cette thèse : le b-coloration problème et le graphe emballage problème. 1. Le b-coloration problème : Une coloration des… (more)

Subjects/Keywords: Coloration de graphe; B-coloration; Nombre b-chromatique; Graphe régulier; Emballage de graphe; Emballage marqué de graphe; Graphe puissance; Arbre non-étoile; Graph coloring; B-coloring; B-chromatic number; Regular graph; Graph packing; Labeled packing of graph; Power graph; Non-star tree; 004.0151

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mortada, M. (2013). The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2013LYO10116

Chicago Manual of Style (16th Edition):

Mortada, Maidoun. “The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.” 2013. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 04, 2020. http://www.theses.fr/2013LYO10116.

MLA Handbook (7th Edition):

Mortada, Maidoun. “The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.” 2013. Web. 04 Aug 2020.

Vancouver:

Mortada M. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2013. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2013LYO10116.

Council of Science Editors:

Mortada M. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2013. Available from: http://www.theses.fr/2013LYO10116

2. Tahraoui, Mohammed Amin. Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes.

Degree: Docteur es, Informatique, 2012, Université Claude Bernard – Lyon I

Cette thèse se situe dans le domaine de graphes et de leurs applications, Elleest constitué de trois grandes parties, la première est consacrée à l’étude… (more)

Subjects/Keywords: Théorie des graphes; Graphes étiquetés; Colorations sommets distinguantes; Placement de graphes étiquetés; Appariement exact des documents XML; Graph theory; Labeled graph; Vertex-distinguishing edge coloring; Labeled packing of graphs; XML tree pattern matching; 004.015 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tahraoui, M. A. (2012). Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2012LYO10278

Chicago Manual of Style (16th Edition):

Tahraoui, Mohammed Amin. “Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes.” 2012. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 04, 2020. http://www.theses.fr/2012LYO10278.

MLA Handbook (7th Edition):

Tahraoui, Mohammed Amin. “Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes.” 2012. Web. 04 Aug 2020.

Vancouver:

Tahraoui MA. Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2012. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2012LYO10278.

Council of Science Editors:

Tahraoui MA. Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2012. Available from: http://www.theses.fr/2012LYO10278

3. Romero, Jazmin. Generalized Set and Graph Packing Problems.

Degree: 2015, University of Waterloo

 Many complex systems that exist in nature and society can be expressed in terms of networks (e.g., social networks, communication networks, biological networks, Web graph,… (more)

Subjects/Keywords: fixed-parameter algorithms; kernelization; set packing; graph packing; overlapping communities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Romero, J. (2015). Generalized Set and Graph Packing Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9975

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

Romero, Jazmin. “Generalized Set and Graph Packing Problems.” 2015. Thesis, University of Waterloo. Accessed August 04, 2020. http://hdl.handle.net/10012/9975.

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

MLA Handbook (7th Edition):

Romero, Jazmin. “Generalized Set and Graph Packing Problems.” 2015. Web. 04 Aug 2020.

Vancouver:

Romero J. Generalized Set and Graph Packing Problems. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10012/9975.

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

Council of Science Editors:

Romero J. Generalized Set and Graph Packing Problems. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9975

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

4. Gómez Diaz, Renzo Gonzalo. Empacotamento de árvores em grafos completos.

Degree: Mestrado, Ciência da Computação, 2014, University of São Paulo

Nesta dissertacao estudamos problemas de empacotamento de arvores em grafos, com enfase no caso de grafos completos. Denotamos por Ti uma arvore de ordem i.… (more)

Subjects/Keywords: biestrelas; bistars; complete graph; decomposição em árvores; decomposition into trees; empacotamento de árvores; estrelas; grafo completo; grafo k-cromático; k-chromatic graph; packing of trees; stars

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gómez Diaz, R. G. (2014). Empacotamento de árvores em grafos completos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03022015-115100/ ;

Chicago Manual of Style (16th Edition):

Gómez Diaz, Renzo Gonzalo. “Empacotamento de árvores em grafos completos.” 2014. Masters Thesis, University of São Paulo. Accessed August 04, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03022015-115100/ ;.

MLA Handbook (7th Edition):

Gómez Diaz, Renzo Gonzalo. “Empacotamento de árvores em grafos completos.” 2014. Web. 04 Aug 2020.

Vancouver:

Gómez Diaz RG. Empacotamento de árvores em grafos completos. [Internet] [Masters thesis]. University of São Paulo; 2014. [cited 2020 Aug 04]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03022015-115100/ ;.

Council of Science Editors:

Gómez Diaz RG. Empacotamento de árvores em grafos completos. [Masters Thesis]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03022015-115100/ ;


Georgia State University

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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

6. Fortier, Quentin. Aspects de la connexité avec contraintes de matroïdes dans les graphes : Aspects of connectivity with matroid constraints in graphs.

Degree: Docteur es, Mathématiques et Informatique, 2017, Université Grenoble Alpes (ComUE)

La notion de connexité est fondamentale en théorie des graphes. Nous proposons une étude approfondie d'un récent développement dans ce domaine, en ajoutant des contraintes… (more)

Subjects/Keywords: Graphe; Connexité; Matroïde; Packing; Orientation; Arborescence; Graph; Connectivity; Matroid; Packing; Orientation; Arborescence; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fortier, Q. (2017). Aspects de la connexité avec contraintes de matroïdes dans les graphes : Aspects of connectivity with matroid constraints in graphs. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2017GREAM059

Chicago Manual of Style (16th Edition):

Fortier, Quentin. “Aspects de la connexité avec contraintes de matroïdes dans les graphes : Aspects of connectivity with matroid constraints in graphs.” 2017. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed August 04, 2020. http://www.theses.fr/2017GREAM059.

MLA Handbook (7th Edition):

Fortier, Quentin. “Aspects de la connexité avec contraintes de matroïdes dans les graphes : Aspects of connectivity with matroid constraints in graphs.” 2017. Web. 04 Aug 2020.

Vancouver:

Fortier Q. Aspects de la connexité avec contraintes de matroïdes dans les graphes : Aspects of connectivity with matroid constraints in graphs. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2017. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2017GREAM059.

Council of Science Editors:

Fortier Q. Aspects de la connexité avec contraintes de matroïdes dans les graphes : Aspects of connectivity with matroid constraints in graphs. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2017. Available from: http://www.theses.fr/2017GREAM059


Université de Grenoble

7. Durand de Gevigney, Olivier. Orientations des graphes : structures et algorithmes : Graphs Orientations : structures and algorithms.

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

Orienter un graphe c'est remplacer chaque arête par un arc de mêmes extrémités. On s'intéresse à la connexité du graphe orienté ainsi obtenu. L'orientation avec… (more)

Subjects/Keywords: Graphe; Orientation; Connexité; Packing; Matroïde; Graph; Orientation; Connectivity; Packing; Matroid; 510; 621

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Durand de Gevigney, O. (2013). Orientations des graphes : structures et algorithmes : Graphs Orientations : structures and algorithms. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2013GRENM027

Chicago Manual of Style (16th Edition):

Durand de Gevigney, Olivier. “Orientations des graphes : structures et algorithmes : Graphs Orientations : structures and algorithms.” 2013. Doctoral Dissertation, Université de Grenoble. Accessed August 04, 2020. http://www.theses.fr/2013GRENM027.

MLA Handbook (7th Edition):

Durand de Gevigney, Olivier. “Orientations des graphes : structures et algorithmes : Graphs Orientations : structures and algorithms.” 2013. Web. 04 Aug 2020.

Vancouver:

Durand de Gevigney O. Orientations des graphes : structures et algorithmes : Graphs Orientations : structures and algorithms. [Internet] [Doctoral dissertation]. Université de Grenoble; 2013. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2013GRENM027.

Council of Science Editors:

Durand de Gevigney O. Orientations des graphes : structures et algorithmes : Graphs Orientations : structures and algorithms. [Doctoral Dissertation]. Université de Grenoble; 2013. Available from: http://www.theses.fr/2013GRENM027

8. Zang, Chuanyun. Matchings and Tilings in Hypergraphs.

Degree: PhD, Mathematics and Statistics, 2016, Georgia State University

  We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of graph (k = 2)… (more)

Subjects/Keywords: Absorbing method; Regularity lemma; Perfect matching; Graph tiling; Graph packing; Minimum degree.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zang, C. (2016). Matchings and Tilings in Hypergraphs. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_diss/31

Chicago Manual of Style (16th Edition):

Zang, Chuanyun. “Matchings and Tilings in Hypergraphs.” 2016. Doctoral Dissertation, Georgia State University. Accessed August 04, 2020. https://scholarworks.gsu.edu/math_diss/31.

MLA Handbook (7th Edition):

Zang, Chuanyun. “Matchings and Tilings in Hypergraphs.” 2016. Web. 04 Aug 2020.

Vancouver:

Zang C. Matchings and Tilings in Hypergraphs. [Internet] [Doctoral dissertation]. Georgia State University; 2016. [cited 2020 Aug 04]. Available from: https://scholarworks.gsu.edu/math_diss/31.

Council of Science Editors:

Zang C. Matchings and Tilings in Hypergraphs. [Doctoral Dissertation]. Georgia State University; 2016. Available from: https://scholarworks.gsu.edu/math_diss/31


University of Victoria

9. Yang, Feiran. New results on broadcast domination and multipacking.

Degree: Department of Mathematics and Statistics, 2015, University of Victoria

 Let G be a graph and f be a function that maps V to {0,1,2, ..., diam(G)}. Let V+ be the set of all vertices… (more)

Subjects/Keywords: graph theory; dominating sets; packing; strongly chordal graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, F. (2015). New results on broadcast domination and multipacking. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6627

Chicago Manual of Style (16th Edition):

Yang, Feiran. “New results on broadcast domination and multipacking.” 2015. Masters Thesis, University of Victoria. Accessed August 04, 2020. http://hdl.handle.net/1828/6627.

MLA Handbook (7th Edition):

Yang, Feiran. “New results on broadcast domination and multipacking.” 2015. Web. 04 Aug 2020.

Vancouver:

Yang F. New results on broadcast domination and multipacking. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/1828/6627.

Council of Science Editors:

Yang F. New results on broadcast domination and multipacking. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6627


University of Alabama

10. Wiegand, Nathan. On labeled paths.

Degree: 2010, University of Alabama

Labeled graph theory is the marriage of two common problem domains to computer science  – graph theory and automata theory. Though each has been independently… (more)

Subjects/Keywords: Electronic Thesis or Dissertation;  – thesis; Computer Science; algorithms; control language hierarchy; formal languages; graph theory; labeled graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wiegand, N. (2010). On labeled paths. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/13835

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

Wiegand, Nathan. “On labeled paths.” 2010. Thesis, University of Alabama. Accessed August 04, 2020. http://purl.lib.ua.edu/13835.

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

MLA Handbook (7th Edition):

Wiegand, Nathan. “On labeled paths.” 2010. Web. 04 Aug 2020.

Vancouver:

Wiegand N. On labeled paths. [Internet] [Thesis]. University of Alabama; 2010. [cited 2020 Aug 04]. Available from: http://purl.lib.ua.edu/13835.

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

Council of Science Editors:

Wiegand N. On labeled paths. [Thesis]. University of Alabama; 2010. Available from: http://purl.lib.ua.edu/13835

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

11. Gastineau, Nicolas. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.

Degree: Docteur es, Informatique, 2014, Université de Bourgogne

Nos recherches traitent de coloration de graphes avec des contraintes de distance (coloration de packing) ou des contraintes sur le voisinage (coloration de Grundy). Soit… (more)

Subjects/Keywords: Coloration; Coloration de Grundy; Complexité algorithmique; Complexité paramétrée; Distance; Graphe; Graphe régulier; Coloration de packing; S-coloration de packing; Coloring; Combinatorics; Computational complexity; Distance; Domination; Graph; Regular graph; Grundy coloring; Lattic; Packing coloring; Parameterized complexity; S -packing coloring; 004.6

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gastineau, N. (2014). Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. (Doctoral Dissertation). Université de Bourgogne. Retrieved from http://www.theses.fr/2014DIJOS014

Chicago Manual of Style (16th Edition):

Gastineau, Nicolas. “Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.” 2014. Doctoral Dissertation, Université de Bourgogne. Accessed August 04, 2020. http://www.theses.fr/2014DIJOS014.

MLA Handbook (7th Edition):

Gastineau, Nicolas. “Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Gastineau N. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. [Internet] [Doctoral dissertation]. Université de Bourgogne; 2014. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2014DIJOS014.

Council of Science Editors:

Gastineau N. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. [Doctoral Dissertation]. Université de Bourgogne; 2014. Available from: http://www.theses.fr/2014DIJOS014


North Carolina State University

12. Nagarajan, Rajesh P. An Industrial Application of the 2-Dimensional Finite Bin Packing Problem.

Degree: MS, Operations Research, 2003, North Carolina State University

 The 2-Dimensional Finite Bin Packing Problem is a NP hard problem with it being observed in many of the process industries like woodcutting, textile manufacturing… (more)

Subjects/Keywords: k-way graph partitioning; bin packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nagarajan, R. P. (2003). An Industrial Application of the 2-Dimensional Finite Bin Packing Problem. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/690

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

Nagarajan, Rajesh P. “An Industrial Application of the 2-Dimensional Finite Bin Packing Problem.” 2003. Thesis, North Carolina State University. Accessed August 04, 2020. http://www.lib.ncsu.edu/resolver/1840.16/690.

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

MLA Handbook (7th Edition):

Nagarajan, Rajesh P. “An Industrial Application of the 2-Dimensional Finite Bin Packing Problem.” 2003. Web. 04 Aug 2020.

Vancouver:

Nagarajan RP. An Industrial Application of the 2-Dimensional Finite Bin Packing Problem. [Internet] [Thesis]. North Carolina State University; 2003. [cited 2020 Aug 04]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/690.

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

Council of Science Editors:

Nagarajan RP. An Industrial Application of the 2-Dimensional Finite Bin Packing Problem. [Thesis]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/690

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


East Tennessee State University

13. Xia, Yan. Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge.

Degree: MS, Mathematical Sciences, 2013, East Tennessee State University

  In this thesis, we consider packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and… (more)

Subjects/Keywords: graph theory; packing; covering; bipartite graph; decomposition; 4-cycle; Discrete Mathematics and Combinatorics; Other Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, Y. (2013). Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1173

Chicago Manual of Style (16th Edition):

Xia, Yan. “Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge.” 2013. Masters Thesis, East Tennessee State University. Accessed August 04, 2020. https://dc.etsu.edu/etd/1173.

MLA Handbook (7th Edition):

Xia, Yan. “Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge.” 2013. Web. 04 Aug 2020.

Vancouver:

Xia Y. Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge. [Internet] [Masters thesis]. East Tennessee State University; 2013. [cited 2020 Aug 04]. Available from: https://dc.etsu.edu/etd/1173.

Council of Science Editors:

Xia Y. Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge. [Masters Thesis]. East Tennessee State University; 2013. Available from: https://dc.etsu.edu/etd/1173


Brno University of Technology

14. Adamský, Aleš. Segmentace mluvčích s využitím statistických metod klasifikace: Speaker Segmentation using statistical methods of classification.

Degree: 2019, Brno University of Technology

 The thesis discusses in detail some concepts of speech and prosody that can contribute to build a speech corpus for the speaker segmentation purpose. Moreover,… (more)

Subjects/Keywords: značkovaná databáza; príznaky; anotačný nástroj Elan; segmentácia hovoriacich; Bayesovo informačné kritérium; ROC graf; labeled database; features; Elan linguistic annotator; speaker segmentation; Bayesian information criterion; the ROC graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adamský, A. (2019). Segmentace mluvčích s využitím statistických metod klasifikace: Speaker Segmentation using statistical methods of classification. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/876

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

Adamský, Aleš. “Segmentace mluvčích s využitím statistických metod klasifikace: Speaker Segmentation using statistical methods of classification.” 2019. Thesis, Brno University of Technology. Accessed August 04, 2020. http://hdl.handle.net/11012/876.

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

MLA Handbook (7th Edition):

Adamský, Aleš. “Segmentace mluvčích s využitím statistických metod klasifikace: Speaker Segmentation using statistical methods of classification.” 2019. Web. 04 Aug 2020.

Vancouver:

Adamský A. Segmentace mluvčích s využitím statistických metod klasifikace: Speaker Segmentation using statistical methods of classification. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/11012/876.

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

Council of Science Editors:

Adamský A. Segmentace mluvčích s využitím statistických metod klasifikace: Speaker Segmentation using statistical methods of classification. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/876

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


Université Montpellier II

15. Perez, Anthony. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems.

Degree: Docteur es, Informatique, 2011, Université Montpellier II

Dans le cadre de cette thèse, nous considérons la complexité paramétrée de problèmes NP-complets. Plus précisément, nous nous intéressons à l'existence d'algorithmes de noyau polynomiaux… (more)

Subjects/Keywords: Complexité paramétrée; Noyaux; Édition de graphes; Édition de contraintes; Branches; Conflict packing; Parameterized complexity; Kernelization; Graph modification problem; Constraint modification problem; Branches; Conflict packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perez, A. (2011). Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2011MON20240

Chicago Manual of Style (16th Edition):

Perez, Anthony. “Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems.” 2011. Doctoral Dissertation, Université Montpellier II. Accessed August 04, 2020. http://www.theses.fr/2011MON20240.

MLA Handbook (7th Edition):

Perez, Anthony. “Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems.” 2011. Web. 04 Aug 2020.

Vancouver:

Perez A. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems. [Internet] [Doctoral dissertation]. Université Montpellier II; 2011. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2011MON20240.

Council of Science Editors:

Perez A. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems. [Doctoral Dissertation]. Université Montpellier II; 2011. Available from: http://www.theses.fr/2011MON20240


RMIT University

16. Goonetilleke, T. Graph database management systems: storage, management and query processing.

Degree: 2017, RMIT University

 The proliferation of graph data, generated from diverse sources, have given rise to many research efforts concerning graph analysis. Interactions in social networks, publication networks,… (more)

Subjects/Keywords: Fields of Research; Graph database management systems; Graph storage; Graph data model; Graph query processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goonetilleke, T. (2017). Graph database management systems: storage, management and query processing. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162343

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

Goonetilleke, T. “Graph database management systems: storage, management and query processing.” 2017. Thesis, RMIT University. Accessed August 04, 2020. http://researchbank.rmit.edu.au/view/rmit:162343.

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

MLA Handbook (7th Edition):

Goonetilleke, T. “Graph database management systems: storage, management and query processing.” 2017. Web. 04 Aug 2020.

Vancouver:

Goonetilleke T. Graph database management systems: storage, management and query processing. [Internet] [Thesis]. RMIT University; 2017. [cited 2020 Aug 04]. Available from: http://researchbank.rmit.edu.au/view/rmit:162343.

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

Council of Science Editors:

Goonetilleke T. Graph database management systems: storage, management and query processing. [Thesis]. RMIT University; 2017. Available from: http://researchbank.rmit.edu.au/view/rmit:162343

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


North Carolina State University

17. Balisetti, Srinivas. Sequencing to Minimize the Weighted Completion Time Subject to Constrained Resources and Arbitrary Precedence.

Degree: MS, Industrial Engineering, 2002, North Carolina State University

 The primary concern of this thesis is the scheduling of the precedence related jobs non-preemptively on the two resources to minimize the sum of the… (more)

Subjects/Keywords: packing algortihm; resource; Lawler procedure; series parallel graph; scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Balisetti, S. (2002). Sequencing to Minimize the Weighted Completion Time Subject to Constrained Resources and Arbitrary Precedence. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/554

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

Balisetti, Srinivas. “Sequencing to Minimize the Weighted Completion Time Subject to Constrained Resources and Arbitrary Precedence.” 2002. Thesis, North Carolina State University. Accessed August 04, 2020. http://www.lib.ncsu.edu/resolver/1840.16/554.

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

MLA Handbook (7th Edition):

Balisetti, Srinivas. “Sequencing to Minimize the Weighted Completion Time Subject to Constrained Resources and Arbitrary Precedence.” 2002. Web. 04 Aug 2020.

Vancouver:

Balisetti S. Sequencing to Minimize the Weighted Completion Time Subject to Constrained Resources and Arbitrary Precedence. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2020 Aug 04]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/554.

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

Council of Science Editors:

Balisetti S. Sequencing to Minimize the Weighted Completion Time Subject to Constrained Resources and Arbitrary Precedence. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/554

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

18. Irvine, Chelsea Nicole. Suns: a new class of facet defining structures for the node packing polyhedron.

Degree: MS, Department of Industrial and Manufacturing Systems Engineering, 2012, Kansas State University

Graph theory is a widely researched topic. A graph contains a set of nodes and a set of edges. The nodes often represent resources such… (more)

Subjects/Keywords: Sun; Suns; Node packing; Graph theory; Polyhedral theory; Facet defining; Industrial Engineering (0546); Theoretical Mathematics (0642)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Irvine, C. N. (2012). Suns: a new class of facet defining structures for the node packing polyhedron. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/13729

Chicago Manual of Style (16th Edition):

Irvine, Chelsea Nicole. “Suns: a new class of facet defining structures for the node packing polyhedron.” 2012. Masters Thesis, Kansas State University. Accessed August 04, 2020. http://hdl.handle.net/2097/13729.

MLA Handbook (7th Edition):

Irvine, Chelsea Nicole. “Suns: a new class of facet defining structures for the node packing polyhedron.” 2012. Web. 04 Aug 2020.

Vancouver:

Irvine CN. Suns: a new class of facet defining structures for the node packing polyhedron. [Internet] [Masters thesis]. Kansas State University; 2012. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/2097/13729.

Council of Science Editors:

Irvine CN. Suns: a new class of facet defining structures for the node packing polyhedron. [Masters Thesis]. Kansas State University; 2012. Available from: http://hdl.handle.net/2097/13729


Kansas State University

19. Conley, Clark Logan. Cliqued holes and other graphic structures for the node packing polytope.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2009, Kansas State University

Graph Theory is a widely studied topic. A graph is defined by two important features: nodes and edges. Nodes can represent people, cities, variables, resources,… (more)

Subjects/Keywords: Node packing; Clique; Graphs; Simultaneous lifting; Graph theory; Facet; Engineering, Industrial (0546); Mathematics (0405); Operations Research (0796)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Conley, C. L. (2009). Cliqued holes and other graphic structures for the node packing polytope. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/2300

Chicago Manual of Style (16th Edition):

Conley, Clark Logan. “Cliqued holes and other graphic structures for the node packing polytope.” 2009. Masters Thesis, Kansas State University. Accessed August 04, 2020. http://hdl.handle.net/2097/2300.

MLA Handbook (7th Edition):

Conley, Clark Logan. “Cliqued holes and other graphic structures for the node packing polytope.” 2009. Web. 04 Aug 2020.

Vancouver:

Conley CL. Cliqued holes and other graphic structures for the node packing polytope. [Internet] [Masters thesis]. Kansas State University; 2009. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/2097/2300.

Council of Science Editors:

Conley CL. Cliqued holes and other graphic structures for the node packing polytope. [Masters Thesis]. Kansas State University; 2009. Available from: http://hdl.handle.net/2097/2300

20. Markuš, Žiga. Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže.

Degree: 2018, Univerza v Mariboru

Pojem pakirnega kromatskega števila prihaja iz področja načrtovanja frekvenc v brezžičnih omrežjih. Pri pakiranju k-barv grafa G, morajo biti vozlišča grafa z barvo i paroma… (more)

Subjects/Keywords: neskončne mreže; pakirno kromatsko število; grafi; lattice; packing chromatic number; graph; info:eu-repo/classification/udc/535.345.61:(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Markuš, . (2018). Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl

Chicago Manual of Style (16th Edition):

Markuš, Žiga. “Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže.” 2018. Masters Thesis, Univerza v Mariboru. Accessed August 04, 2020. https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl.

MLA Handbook (7th Edition):

Markuš, Žiga. “Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže.” 2018. Web. 04 Aug 2020.

Vancouver:

Markuš . Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. [Internet] [Masters thesis]. Univerza v Mariboru; 2018. [cited 2020 Aug 04]. Available from: https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl.

Council of Science Editors:

Markuš . Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. [Masters Thesis]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl


Universidade do Rio Grande do Sul

21. Liczbinski, Celso Antonio. Classificação de dados imagens em alta dimensionalidade, empregando amostras semi-rotuladas e estimadores para as probabilidades a priori.

Degree: 2007, Universidade do Rio Grande do Sul

Em cenas naturais, ocorrem com certa freqüência classes espectralmente muito similares, isto é, os vetores média são muito próximos. Em situações como esta dados de… (more)

Subjects/Keywords: Remote sensing; Sensoriamento remoto; Imagens digitais; Patterns of recognition; A priori probability; Semi-labeled samples; High dimensionality image data

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liczbinski, C. A. (2007). Classificação de dados imagens em alta dimensionalidade, empregando amostras semi-rotuladas e estimadores para as probabilidades a priori. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/12014

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

Liczbinski, Celso Antonio. “Classificação de dados imagens em alta dimensionalidade, empregando amostras semi-rotuladas e estimadores para as probabilidades a priori.” 2007. Thesis, Universidade do Rio Grande do Sul. Accessed August 04, 2020. http://hdl.handle.net/10183/12014.

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

MLA Handbook (7th Edition):

Liczbinski, Celso Antonio. “Classificação de dados imagens em alta dimensionalidade, empregando amostras semi-rotuladas e estimadores para as probabilidades a priori.” 2007. Web. 04 Aug 2020.

Vancouver:

Liczbinski CA. Classificação de dados imagens em alta dimensionalidade, empregando amostras semi-rotuladas e estimadores para as probabilidades a priori. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2007. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10183/12014.

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

Council of Science Editors:

Liczbinski CA. Classificação de dados imagens em alta dimensionalidade, empregando amostras semi-rotuladas e estimadores para as probabilidades a priori. [Thesis]. Universidade do Rio Grande do Sul; 2007. Available from: http://hdl.handle.net/10183/12014

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


Université Montpellier II

22. Tatou, Mouna. Nanocomposites modèles silice-latex : etude des propriétés rhéologiques et de la structure des charges et des chaînes par Diffusion de Neutrons aux Petits Angles : Silica-latex model nanocomposites : rheological properties compared to chain- and filler-structure as seen by sans.

Degree: Docteur es, Milieux denses et matériaux, 2010, Université Montpellier II

Pour comprendre les mécanismes microscopiques du renforcement dans les nanocomposites, nous avons mis en œuvre un système nanocomposite modèle composé de nanoparticules de silice incorporées… (more)

Subjects/Keywords: Nanocomposites; Microstructure; Rhéologie; Structure des chaînes; Renforcement; Interdiffusion de chaînes marquées; Nanocomposites; Microstructure; Rheologie; Chain structure; Reinforcement; Interdiffusion of labeled chains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tatou, M. (2010). Nanocomposites modèles silice-latex : etude des propriétés rhéologiques et de la structure des charges et des chaînes par Diffusion de Neutrons aux Petits Angles : Silica-latex model nanocomposites : rheological properties compared to chain- and filler-structure as seen by sans. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2010MON20179

Chicago Manual of Style (16th Edition):

Tatou, Mouna. “Nanocomposites modèles silice-latex : etude des propriétés rhéologiques et de la structure des charges et des chaînes par Diffusion de Neutrons aux Petits Angles : Silica-latex model nanocomposites : rheological properties compared to chain- and filler-structure as seen by sans.” 2010. Doctoral Dissertation, Université Montpellier II. Accessed August 04, 2020. http://www.theses.fr/2010MON20179.

MLA Handbook (7th Edition):

Tatou, Mouna. “Nanocomposites modèles silice-latex : etude des propriétés rhéologiques et de la structure des charges et des chaînes par Diffusion de Neutrons aux Petits Angles : Silica-latex model nanocomposites : rheological properties compared to chain- and filler-structure as seen by sans.” 2010. Web. 04 Aug 2020.

Vancouver:

Tatou M. Nanocomposites modèles silice-latex : etude des propriétés rhéologiques et de la structure des charges et des chaînes par Diffusion de Neutrons aux Petits Angles : Silica-latex model nanocomposites : rheological properties compared to chain- and filler-structure as seen by sans. [Internet] [Doctoral dissertation]. Université Montpellier II; 2010. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2010MON20179.

Council of Science Editors:

Tatou M. Nanocomposites modèles silice-latex : etude des propriétés rhéologiques et de la structure des charges et des chaînes par Diffusion de Neutrons aux Petits Angles : Silica-latex model nanocomposites : rheological properties compared to chain- and filler-structure as seen by sans. [Doctoral Dissertation]. Université Montpellier II; 2010. Available from: http://www.theses.fr/2010MON20179


Université de Bordeaux I

23. Joncour, Cédric. Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique : 2D-orthogonal packing and scheduling problems : modelling by graph theory and mathematical approach.

Degree: Docteur es, Mathématiques appliquées, 2010, Université de Bordeaux I

Le problème de placement sur deux dimensions consiste à décider s’il existe un rangement d’objets rectangulaires dans une boîte donnée. C’est un problème combinatoire difficile… (more)

Subjects/Keywords: Problèmes de placement; Théorie des graphes; Génération de colonnes; Modéles mathématiques; Etude de branchement; Graphes d’intervalles; Orthogonal packing problems; Graph theory; Column generation; Mathematical models; Branching study; Interval graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joncour, C. (2010). Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique : 2D-orthogonal packing and scheduling problems : modelling by graph theory and mathematical approach. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2010BOR14173

Chicago Manual of Style (16th Edition):

Joncour, Cédric. “Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique : 2D-orthogonal packing and scheduling problems : modelling by graph theory and mathematical approach.” 2010. Doctoral Dissertation, Université de Bordeaux I. Accessed August 04, 2020. http://www.theses.fr/2010BOR14173.

MLA Handbook (7th Edition):

Joncour, Cédric. “Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique : 2D-orthogonal packing and scheduling problems : modelling by graph theory and mathematical approach.” 2010. Web. 04 Aug 2020.

Vancouver:

Joncour C. Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique : 2D-orthogonal packing and scheduling problems : modelling by graph theory and mathematical approach. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2010. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2010BOR14173.

Council of Science Editors:

Joncour C. Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique : 2D-orthogonal packing and scheduling problems : modelling by graph theory and mathematical approach. [Doctoral Dissertation]. Université de Bordeaux I; 2010. Available from: http://www.theses.fr/2010BOR14173

24. Messerschmidt, Kacy. Coloring problems in graph theory.

Degree: 2018, Iowa State University

 In this thesis, we focus on variants of the coloring problem on graphs. A coloring of a graph G is an assignment of colors to… (more)

Subjects/Keywords: discrete mathematics; graph coloring; graph theory; packing coloring; Mathematics

…K2,4 is an example of a graph that is 2-colorable but not 2-choosable. 2.3.1 Packing… …packing coloring variant. A (0, 2)-improper-coloring of a graph G would partition V… …subgraph of H in Figure 4.2. Consider the graph HP3 . We can find the largest packing of HP3 with… …coloring of a graph G is an assignment of colors to the vertices. A coloring is proper if no two… …adjacent vertices are assigned the same color. Colorings are a central part of graph theory and… 

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

Messerschmidt, K. (2018). Coloring problems in graph theory. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16639

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

Messerschmidt, Kacy. “Coloring problems in graph theory.” 2018. Thesis, Iowa State University. Accessed August 04, 2020. https://lib.dr.iastate.edu/etd/16639.

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

MLA Handbook (7th Edition):

Messerschmidt, Kacy. “Coloring problems in graph theory.” 2018. Web. 04 Aug 2020.

Vancouver:

Messerschmidt K. Coloring problems in graph theory. [Internet] [Thesis]. Iowa State University; 2018. [cited 2020 Aug 04]. Available from: https://lib.dr.iastate.edu/etd/16639.

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

Council of Science Editors:

Messerschmidt K. Coloring problems in graph theory. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16639

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

25. Plaisted, Daniel. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.

Degree: 2019, University of Tennessee – Chattanooga

 This thesis regards the minimum rank and minimum positive semidefinite rank of a simple graph. A graph parameter, called the minimum labeling degree (mld), is… (more)

Subjects/Keywords: Graph theory; Representations of graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Plaisted, D. (2019). On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/611

Chicago Manual of Style (16th Edition):

Plaisted, Daniel. “On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.” 2019. Masters Thesis, University of Tennessee – Chattanooga. Accessed August 04, 2020. https://scholar.utc.edu/theses/611.

MLA Handbook (7th Edition):

Plaisted, Daniel. “On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.” 2019. Web. 04 Aug 2020.

Vancouver:

Plaisted D. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2020 Aug 04]. Available from: https://scholar.utc.edu/theses/611.

Council of Science Editors:

Plaisted D. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. [Masters Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/611


Univerzitet u Beogradu

26. Pucanović, Zoran S., 1968-. Анализа прстена и модула придруживањем графова.

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

Matematika-Algebra / Mathematics-Algebra

Ova doktorska disertacija prouqava razliqite osobine komutativnih prstena i modula algebarsko kombinatornim metodama. Ako se graf na odgovarajui naqin pridrui prstenu R… (more)

Subjects/Keywords: commutative rings; clean rings; modules; zero-divisors; total graph; clean graph; line graph; intersection graph; genus of a graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pucanović, Zoran S., 1. (2014). Анализа прстена и модула придруживањем графова. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:8194/bdef:Content/get

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

Pucanović, Zoran S., 1968-. “Анализа прстена и модула придруживањем графова.” 2014. Thesis, Univerzitet u Beogradu. Accessed August 04, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:8194/bdef:Content/get.

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

MLA Handbook (7th Edition):

Pucanović, Zoran S., 1968-. “Анализа прстена и модула придруживањем графова.” 2014. Web. 04 Aug 2020.

Vancouver:

Pucanović, Zoran S. 1. Анализа прстена и модула придруживањем графова. [Internet] [Thesis]. Univerzitet u Beogradu; 2014. [cited 2020 Aug 04]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:8194/bdef:Content/get.

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

Council of Science Editors:

Pucanović, Zoran S. 1. Анализа прстена и модула придруживањем графова. [Thesis]. Univerzitet u Beogradu; 2014. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:8194/bdef:Content/get

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

27. McConvey, Andrew Ross. Sufficient conditions for the existence of specified subgraphs in graphs.

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

 A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G. It is usually computationally complex… (more)

Subjects/Keywords: Combinatorics; Graph theory; Extremal graph theory; Cycles; Disjoint cycles; Graph packing; Turán number; List packing; Matching; Stable matching; Stable marriage

…G1 and G2 pack if there exists a packing of G1 and G2 . 1.2 Disjoint Cycles Every graph… …2k for k ≥ 7. 1.3 Graph Packing In Chapter 3, we will translate the problem of finding a… …subgraph in a graph into the language of graph packing. The results in this chapter are from… …that graph packing is simply a rephrasing of the subgraph problem since graphs G1 and G2 pack… …the language of graph packing, as 7 we no longer need to specify that, for instance, G1 is… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McConvey, A. R. (2017). Sufficient conditions for the existence of specified subgraphs in graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97294

Chicago Manual of Style (16th Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 04, 2020. http://hdl.handle.net/2142/97294.

MLA Handbook (7th Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Web. 04 Aug 2020.

Vancouver:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/2142/97294.

Council of Science Editors:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97294


University of Georgia

28. Pootheri, Sridar Kuttan. Counting classes of labeled 2-connected graphs.

Degree: MS, Computer Science, 2000, University of Georgia

 Applying the Tutte decomposition of 2-connected graphys into 3-block trees, unique structural characterizations of several classes of 2-connected graphs were provided in the PhD dissertation… (more)

Subjects/Keywords: Labeled graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pootheri, S. K. (2000). Counting classes of labeled 2-connected graphs. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/pootheri_sridar_k_200005_ms

Chicago Manual of Style (16th Edition):

Pootheri, Sridar Kuttan. “Counting classes of labeled 2-connected graphs.” 2000. Masters Thesis, University of Georgia. Accessed August 04, 2020. http://purl.galileo.usg.edu/uga_etd/pootheri_sridar_k_200005_ms.

MLA Handbook (7th Edition):

Pootheri, Sridar Kuttan. “Counting classes of labeled 2-connected graphs.” 2000. Web. 04 Aug 2020.

Vancouver:

Pootheri SK. Counting classes of labeled 2-connected graphs. [Internet] [Masters thesis]. University of Georgia; 2000. [cited 2020 Aug 04]. Available from: http://purl.galileo.usg.edu/uga_etd/pootheri_sridar_k_200005_ms.

Council of Science Editors:

Pootheri SK. Counting classes of labeled 2-connected graphs. [Masters Thesis]. University of Georgia; 2000. Available from: http://purl.galileo.usg.edu/uga_etd/pootheri_sridar_k_200005_ms


University of Delaware

29. Sun, Shuying. On some families of algebraically defined graphs .

Degree: 2017, University of Delaware

This thesis is concerned with the study of some families of graphs dened by systems of polynomial equations over nite elds. We explore the girth and diameter of some special classes of these graphs, along with their expansion properties.

Subjects/Keywords: Pure sciences; Cayley graph; Cover of a graph; Degenerate turan-type problems; Expander graph; Girth; Graph spectrum

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, S. (2017). On some families of algebraically defined graphs . (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/21793

Chicago Manual of Style (16th Edition):

Sun, Shuying. “On some families of algebraically defined graphs .” 2017. Doctoral Dissertation, University of Delaware. Accessed August 04, 2020. http://udspace.udel.edu/handle/19716/21793.

MLA Handbook (7th Edition):

Sun, Shuying. “On some families of algebraically defined graphs .” 2017. Web. 04 Aug 2020.

Vancouver:

Sun S. On some families of algebraically defined graphs . [Internet] [Doctoral dissertation]. University of Delaware; 2017. [cited 2020 Aug 04]. Available from: http://udspace.udel.edu/handle/19716/21793.

Council of Science Editors:

Sun S. On some families of algebraically defined graphs . [Doctoral Dissertation]. University of Delaware; 2017. Available from: http://udspace.udel.edu/handle/19716/21793


University of Ottawa

30. Mogg, Trevor. Triterpene Carboxylic Acids as Cortisol Lowering Agents and Synthesis of Hexadeuterated Beta-Ionone .

Degree: 2012, University of Ottawa

 In part one, betulinic acid (1) was isolated from the American Sycamore (Platanus occidentalis) in 1.6% yield, while ursolic acid (3) was isolated from Fuji… (more)

Subjects/Keywords: Betulinic Acid; Ursolic Acid; Cortisol; Oleanolic Acid; Triterpene Carboxylic Acids; beta-ionone; deuterated; beta ionone; cortisol lowering; synthesis of beta ionone; synthesis of beta-ionone; deuterium labeled; ionone

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mogg, T. (2012). Triterpene Carboxylic Acids as Cortisol Lowering Agents and Synthesis of Hexadeuterated Beta-Ionone . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23265

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

Mogg, Trevor. “Triterpene Carboxylic Acids as Cortisol Lowering Agents and Synthesis of Hexadeuterated Beta-Ionone .” 2012. Thesis, University of Ottawa. Accessed August 04, 2020. http://hdl.handle.net/10393/23265.

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

MLA Handbook (7th Edition):

Mogg, Trevor. “Triterpene Carboxylic Acids as Cortisol Lowering Agents and Synthesis of Hexadeuterated Beta-Ionone .” 2012. Web. 04 Aug 2020.

Vancouver:

Mogg T. Triterpene Carboxylic Acids as Cortisol Lowering Agents and Synthesis of Hexadeuterated Beta-Ionone . [Internet] [Thesis]. University of Ottawa; 2012. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10393/23265.

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

Council of Science Editors:

Mogg T. Triterpene Carboxylic Acids as Cortisol Lowering Agents and Synthesis of Hexadeuterated Beta-Ionone . [Thesis]. University of Ottawa; 2012. Available from: http://hdl.handle.net/10393/23265

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

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

.