Advanced search options

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

You searched for `subject:(tree decompositions)`

.
Showing records 1 – 4 of
4 total matches.

▼ Search Limiters

Victoria University of Wellington

1.
Azzato, Jeffrey Donald.
Linked *Tree*-*Decompositions* of Infinite Represented Matroids.

Degree: 2008, Victoria University of Wellington

URL: http://hdl.handle.net/10063/322

► It is natural to try to extend the results of Robertson and Seymour's Graph Minors Project to other objects. As linked *tree*-*decompositions* (LTDs) of graphs…
(more)

Subjects/Keywords: Well-Quasi-Orders; Tree-Decompositions; Infinite matroids

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Azzato, J. D. (2008). Linked Tree-Decompositions of Infinite Represented Matroids. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/322

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

Azzato, Jeffrey Donald. “Linked Tree-Decompositions of Infinite Represented Matroids.” 2008. Masters Thesis, Victoria University of Wellington. Accessed July 10, 2020. http://hdl.handle.net/10063/322.

MLA Handbook (7^{th} Edition):

Azzato, Jeffrey Donald. “Linked Tree-Decompositions of Infinite Represented Matroids.” 2008. Web. 10 Jul 2020.

Vancouver:

Azzato JD. Linked Tree-Decompositions of Infinite Represented Matroids. [Internet] [Masters thesis]. Victoria University of Wellington; 2008. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10063/322.

Council of Science Editors:

Azzato JD. Linked Tree-Decompositions of Infinite Represented Matroids. [Masters Thesis]. Victoria University of Wellington; 2008. Available from: http://hdl.handle.net/10063/322

2.
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

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

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

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

Georgia Tech

3.
Inkmann, Torsten.
* Tree*-based

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 July 10, 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. 10 Jul 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 Jul 10]. 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

4. 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… …Set of Ω-*tree*-generators
Set of sub-tgs of G
Set of local sub-tgs of G at α
*Tree*-width of G… …14
23
22
22
22
11
valM (t)
Value of t in M
13
⊗
⊗n
*Tree*-generator self… …reference
*Tree*-generator recursive reference
22
43
H I G
H L G
H Lr G
Componentwise minor…

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 July 10, 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. 10 Jul 2020.

Vancouver:

Hunt A. Establishing a Connection Between Graph Structure, Logic, and Language Theory. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Jul 10]. 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