Advanced search options

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

You searched for `subject:(graph decompositions)`

.
Showing records 1 – 11 of
11 total matches.

▼ Search Limiters

University of Victoria

1.
Bowditch, Flora Caroline.
Localized structure in *graph* * decompositions*.

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

URL: http://hdl.handle.net/1828/11404

► Let v ∈ Z+ and G be a simple *graph*. A G-decomposition of Kv is a collection F={F1,F2,...,Ft} of subgraphs of Kv such that every…
(more)

Subjects/Keywords: design theory; graph theory; combinatorics; graph decompositions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bowditch, F. C. (2019). Localized structure in graph decompositions. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11404

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

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Masters Thesis, University of Victoria. Accessed September 23, 2020. http://hdl.handle.net/1828/11404.

MLA Handbook (7^{th} Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 23 Sep 2020.

Vancouver:

Bowditch FC. Localized structure in graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1828/11404.

Council of Science Editors:

Bowditch FC. Localized structure in graph decompositions. [Masters Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11404

2.
Asha, S.
A study on *graph* *decompositions*; -.

Degree: 2014, Manonmaniam Sundaranar University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/14787

►

This thesis embodies the work done by the author under the guidance of Dr. R. newlineKala, Associate Professor, Department of Mathematics, Manonmaniam Sundaranar newlineUniversity, Tirunelveli.… (more)

Subjects/Keywords: graph decompositions; combi- natorial problems; Kirkman's problem; Dudeney's problem; Euler's problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Asha, S. (2014). A study on graph decompositions; -. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/14787

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Asha, S. “A study on graph decompositions; -.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed September 23, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/14787.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Asha, S. “A study on graph decompositions; -.” 2014. Web. 23 Sep 2020.

Vancouver:

Asha S. A study on graph decompositions; -. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Sep 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/14787.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Asha S. A study on graph decompositions; -. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/14787

Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

3. Muldoon, Frank. Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables.

Degree: PhD, Mathematical Science, 2012, Clemson University

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

► This research is concerned with developing improved representations for special families of mixed-discrete programming problems. Such problems can typically be modeled using different mathematical forms,…
(more)

Subjects/Keywords: Binary expansion; Convex hull; Disjunctions; Graph decompositions; Piecewise-linear functions; RLT; Applied Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Muldoon, F. (2012). Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1054

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

Muldoon, Frank. “Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables.” 2012. Doctoral Dissertation, Clemson University. Accessed September 23, 2020. https://tigerprints.clemson.edu/all_dissertations/1054.

MLA Handbook (7^{th} Edition):

Muldoon, Frank. “Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables.” 2012. Web. 23 Sep 2020.

Vancouver:

Muldoon F. Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables. [Internet] [Doctoral dissertation]. Clemson University; 2012. [cited 2020 Sep 23]. Available from: https://tigerprints.clemson.edu/all_dissertations/1054.

Council of Science Editors:

Muldoon F. Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables. [Doctoral Dissertation]. Clemson University; 2012. Available from: https://tigerprints.clemson.edu/all_dissertations/1054

4.
Dinh, Hiep.
Exploring Algorithms for Branch *Decompositions* of Planar
Graphs.

Degree: MS, Computer Science (Engineering and Technology), 2008, Ohio University

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

► A branch decomposition is a type of *graph* decomposition closely related to the widely studied tree *decompositions* introduced by Robertson and Seymour. Unlike tree…
(more)

Subjects/Keywords: Computer Science; branch decompositions; parameterized complexity; graph decompositions

…*decompositions* for
any given *graph*. Therefore, the width of a tree decomposition (maximum size of… …*graph* usually take time that is exponential in the width of the tree
*decompositions*, a tree… …of *graph* *decompositions*: branch *decompositions*. Unlike tree *decompositions*, branch-width… …types of *graph*
*decompositions* by Dr. David Juedes that was developed in 2006. The original… …discusses different types of *graph*
*decompositions*, the relationships among the various types, and…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dinh, H. (2008). Exploring Algorithms for Branch Decompositions of Planar Graphs. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625

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

Dinh, Hiep. “Exploring Algorithms for Branch Decompositions of Planar Graphs.” 2008. Masters Thesis, Ohio University. Accessed September 23, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625.

MLA Handbook (7^{th} Edition):

Dinh, Hiep. “Exploring Algorithms for Branch Decompositions of Planar Graphs.” 2008. Web. 23 Sep 2020.

Vancouver:

Dinh H. Exploring Algorithms for Branch Decompositions of Planar Graphs. [Internet] [Masters thesis]. Ohio University; 2008. [cited 2020 Sep 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625.

Council of Science Editors:

Dinh H. Exploring Algorithms for Branch Decompositions of Planar Graphs. [Masters Thesis]. Ohio University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625

5.
Adler, Jonathan D.
*Graph**Decompositions* and Monadic Second Order Logic.

Degree: MS, 2009, Worcester Polytechnic Institute

URL: etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364

► A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs which are not trees. Given a class…
(more)

Subjects/Keywords: clique width; tree decompositions; logic; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adler, J. D. (2009). Graph Decompositions and Monadic Second Order Logic. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364

Not specified: Masters Thesis or Doctoral Dissertation

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

Adler, Jonathan D. “Graph Decompositions and Monadic Second Order Logic.” 2009. Thesis, Worcester Polytechnic Institute. Accessed September 23, 2020. etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Adler, Jonathan D. “Graph Decompositions and Monadic Second Order Logic.” 2009. Web. 23 Sep 2020.

Vancouver:

Adler JD. Graph Decompositions and Monadic Second Order Logic. [Internet] [Thesis]. Worcester Polytechnic Institute; 2009. [cited 2020 Sep 23]. Available from: etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Adler JD. Graph Decompositions and Monadic Second Order Logic. [Thesis]. Worcester Polytechnic Institute; 2009. Available from: etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364

Not specified: Masters Thesis or Doctoral Dissertation

University of Queensland

6.
Pettersson, William.
Computational *Graph* Theory.

Degree: School of Mathematics and Physics, 2014, University of Queensland

URL: http://espace.library.uq.edu.au/view/UQ:341480

Subjects/Keywords: Graph theory; Decompositions; Factorizations; Topology; Triangulations; Algorithms; parameterised complexity; 0101 Pure Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pettersson, W. (2014). Computational Graph Theory. (Thesis). University of Queensland. Retrieved from http://espace.library.uq.edu.au/view/UQ:341480

Not specified: Masters Thesis or Doctoral Dissertation

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

Pettersson, William. “Computational Graph Theory.” 2014. Thesis, University of Queensland. Accessed September 23, 2020. http://espace.library.uq.edu.au/view/UQ:341480.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pettersson, William. “Computational Graph Theory.” 2014. Web. 23 Sep 2020.

Vancouver:

Pettersson W. Computational Graph Theory. [Internet] [Thesis]. University of Queensland; 2014. [cited 2020 Sep 23]. Available from: http://espace.library.uq.edu.au/view/UQ:341480.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pettersson W. Computational Graph Theory. [Thesis]. University of Queensland; 2014. Available from: http://espace.library.uq.edu.au/view/UQ:341480

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

7.
Inkmann, Torsten.
Tree-based *decompositions* of graphs on surfaces and applications to the traveling salesman problem.

Degree: PhD, Mathematics, 2007, Georgia Tech

URL: http://hdl.handle.net/1853/22583

► The tree-width and branch-width of a *graph* are two well-studied examples of parameters that measure how well a given *graph* can be decomposed into a…
(more)

Subjects/Keywords: Tree-decompositions; TSP; Branch-width; Graphs on surfaces; Graph theory; Branch-decompositions; Decomposition method; Graph theory; Traveling-salesman problem; Programming (Mathematics); Combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Inkmann, T. (2007). Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/22583

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

Inkmann, Torsten. “Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem.” 2007. Doctoral Dissertation, Georgia Tech. Accessed September 23, 2020. http://hdl.handle.net/1853/22583.

MLA Handbook (7^{th} Edition):

Inkmann, Torsten. “Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem.” 2007. Web. 23 Sep 2020.

Vancouver:

Inkmann T. Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. [Internet] [Doctoral dissertation]. Georgia Tech; 2007. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1853/22583.

Council of Science Editors:

Inkmann T. Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. [Doctoral Dissertation]. Georgia Tech; 2007. Available from: http://hdl.handle.net/1853/22583

8.
Pardo Soares, Ronan.
Jeux de poursuite-évasion, décompositions et convexité dans les graphes : Pursuit-evasion, *decompositions* and convexity on graphs.

Degree: Docteur es, Informatique, 2013, Nice; Universidade federal do Ceará

URL: http://www.theses.fr/2013NICE4083

►

Cette thèse porte sur l’étude des propriétés structurelles de graphes dont la compréhension permet de concevoir des algorithmes efficaces pour résoudre des problèmes d’optimisation. Nous… (more)

Subjects/Keywords: Gendarmes et voleurs; Jeux d'évasion et poursuite; Décomposition de graphes; Jeu de surveillance; Convexité; Nombre enveloppe; Graph searching; Pursuit-evasion games; Graph decompositions; Cops and robbers; Surveillance game; Convexity; Hull number

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pardo Soares, R. (2013). Jeux de poursuite-évasion, décompositions et convexité dans les graphes : Pursuit-evasion, decompositions and convexity on graphs. (Doctoral Dissertation). Nice; Universidade federal do Ceará. Retrieved from http://www.theses.fr/2013NICE4083

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

Pardo Soares, Ronan. “Jeux de poursuite-évasion, décompositions et convexité dans les graphes : Pursuit-evasion, decompositions and convexity on graphs.” 2013. Doctoral Dissertation, Nice; Universidade federal do Ceará. Accessed September 23, 2020. http://www.theses.fr/2013NICE4083.

MLA Handbook (7^{th} Edition):

Pardo Soares, Ronan. “Jeux de poursuite-évasion, décompositions et convexité dans les graphes : Pursuit-evasion, decompositions and convexity on graphs.” 2013. Web. 23 Sep 2020.

Vancouver:

Pardo Soares R. Jeux de poursuite-évasion, décompositions et convexité dans les graphes : Pursuit-evasion, decompositions and convexity on graphs. [Internet] [Doctoral dissertation]. Nice; Universidade federal do Ceará; 2013. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2013NICE4083.

Council of Science Editors:

Pardo Soares R. Jeux de poursuite-évasion, décompositions et convexité dans les graphes : Pursuit-evasion, decompositions and convexity on graphs. [Doctoral Dissertation]. Nice; Universidade federal do Ceará; 2013. Available from: http://www.theses.fr/2013NICE4083

East Tennessee State University

9.
Cantrell, Daniel Shelton.
Cyclic, f-Cyclic, and Bicyclic *Decompositions* of the Complete *Graph* into the 4-Cycle with a Pendant Edge.

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

URL: https://dc.etsu.edu/etd/1872

► In this paper, we consider *decompositions* of the complete *graph* on v vertices into 4-cycles with a pendant edge. In part, we will consider…
(more)

Subjects/Keywords: coverings; packings; decompositions; graph theory; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cantrell, D. S. (2009). Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1872

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

Cantrell, Daniel Shelton. “Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.” 2009. Masters Thesis, East Tennessee State University. Accessed September 23, 2020. https://dc.etsu.edu/etd/1872.

MLA Handbook (7^{th} Edition):

Cantrell, Daniel Shelton. “Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.” 2009. Web. 23 Sep 2020.

Vancouver:

Cantrell DS. Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge. [Internet] [Masters thesis]. East Tennessee State University; 2009. [cited 2020 Sep 23]. Available from: https://dc.etsu.edu/etd/1872.

Council of Science Editors:

Cantrell DS. Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge. [Masters Thesis]. East Tennessee State University; 2009. Available from: https://dc.etsu.edu/etd/1872

East Tennessee State University

10. Lewenczuk, Janice Gail. Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc.

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

URL: https://dc.etsu.edu/etd/2053

► In the study of design theory, there are eight orientations of the complete *graph* on three vertices with a pendant edge, K_{3}∪{e}. Two of…
(more)

Subjects/Keywords: packings; design theory; decompositions; graph theory; coverings; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lewenczuk, J. G. (2007). Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2053

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

Lewenczuk, Janice Gail. “Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc.” 2007. Masters Thesis, East Tennessee State University. Accessed September 23, 2020. https://dc.etsu.edu/etd/2053.

MLA Handbook (7^{th} Edition):

Lewenczuk, Janice Gail. “Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc.” 2007. Web. 23 Sep 2020.

Vancouver:

Lewenczuk JG. Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc. [Internet] [Masters thesis]. East Tennessee State University; 2007. [cited 2020 Sep 23]. Available from: https://dc.etsu.edu/etd/2053.

Council of Science Editors:

Lewenczuk JG. Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc. [Masters Thesis]. East Tennessee State University; 2007. Available from: https://dc.etsu.edu/etd/2053

11.
Hunt, Alexis.
Establishing a Connection Between *Graph* Structure, Logic, and Language Theory.

Degree: 2015, University of Waterloo

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

► The field of *graph* structure theory was given life by the *Graph* Minors Project of Robertson and Seymour, which developed many tools for understanding the…
(more)

Subjects/Keywords: graph structure; logic; formal languages; language theory; monadic second-order logic; tree-decompositions; hyperedge replacement; HR algebra; graph theory; well-quasi-ordering; cone graph; cone ideal; tree-generator; obstruction-width

…basics of *graph* structure theory, including tree-*decompositions* and known
well-quasi-ordering… …3.4
Tree-*Decompositions*
Definition 3.19. Let G = (V, E) be a *graph*, and let T… …Powerset signature of F
*Graph* obtained from G by forgetting the asource, if any
Ideal with… …T )
Root vertex of T
8
viii
Notation
Description
rena↔b (G)
RG
*Graph*… …The field of *graph* structre theory has grown considerably as a result of the *Graph* Minors…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hunt, A. (2015). Establishing a Connection Between Graph Structure, Logic, and Language Theory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9648

Not specified: Masters Thesis or Doctoral Dissertation

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

Hunt, Alexis. “Establishing a Connection Between Graph Structure, Logic, and Language Theory.” 2015. Thesis, University of Waterloo. Accessed September 23, 2020. http://hdl.handle.net/10012/9648.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hunt, Alexis. “Establishing a Connection Between Graph Structure, Logic, and Language Theory.” 2015. Web. 23 Sep 2020.

Vancouver:

Hunt A. Establishing a Connection Between Graph Structure, Logic, and Language Theory. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/10012/9648.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hunt A. Establishing a Connection Between Graph Structure, Logic, and Language Theory. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9648

Not specified: Masters Thesis or Doctoral Dissertation