Advanced search options

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

You searched for `subject:(treewidth)`

.
Showing records 1 – 30 of
31 total matches.

▼ Search Limiters

1. Praveen, M. Parameterized complexity of some problems in concurrency and verification; -.

Degree: Mathematics, 2011, INFLIBNET

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

►

Formal methods for the analysis of concurrent systems are an active area of research. Many mathematical models like Petri nets, communicating automata, automata with auxiliary… (more)

Subjects/Keywords: Petri Nets; Treewidth; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Praveen, M. (2011). Parameterized complexity of some problems in concurrency and verification; -. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/4733

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

Praveen, M. “Parameterized complexity of some problems in concurrency and verification; -.” 2011. Thesis, INFLIBNET. Accessed July 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/4733.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Praveen, M. “Parameterized complexity of some problems in concurrency and verification; -.” 2011. Web. 19 Jul 2019.

Vancouver:

Praveen M. Parameterized complexity of some problems in concurrency and verification; -. [Internet] [Thesis]. INFLIBNET; 2011. [cited 2019 Jul 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4733.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Praveen M. Parameterized complexity of some problems in concurrency and verification; -. [Thesis]. INFLIBNET; 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4733

Not specified: Masters Thesis or Doctoral Dissertation

Wesleyan University

2.
Smith, Brett Christopher.
On Minimality of Planar Graphs with Respect to * Treewidth*.

Degree: Mathematics, 2015, Wesleyan University

URL: https://wesscholar.wesleyan.edu/etd_diss/47

Subjects/Keywords: treewidth; bramble

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Smith, B. C. (2015). On Minimality of Planar Graphs with Respect to Treewidth. (Doctoral Dissertation). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_diss/47

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

Smith, Brett Christopher. “On Minimality of Planar Graphs with Respect to Treewidth.” 2015. Doctoral Dissertation, Wesleyan University. Accessed July 19, 2019. https://wesscholar.wesleyan.edu/etd_diss/47.

MLA Handbook (7^{th} Edition):

Smith, Brett Christopher. “On Minimality of Planar Graphs with Respect to Treewidth.” 2015. Web. 19 Jul 2019.

Vancouver:

Smith BC. On Minimality of Planar Graphs with Respect to Treewidth. [Internet] [Doctoral dissertation]. Wesleyan University; 2015. [cited 2019 Jul 19]. Available from: https://wesscholar.wesleyan.edu/etd_diss/47.

Council of Science Editors:

Smith BC. On Minimality of Planar Graphs with Respect to Treewidth. [Doctoral Dissertation]. Wesleyan University; 2015. Available from: https://wesscholar.wesleyan.edu/etd_diss/47

Universiteit Utrecht

3. Graaff, L.W. van der. Dynamic programming on Nice Tree Decompositions.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/309652

► Connectivity problems such as the Steiner Tree Problem are NP-hard problems that are fixed parameter tractable in the *treewidth* of the input graph. In this…
(more)

Subjects/Keywords: treewidth; Steiner tree problem; dynamic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Graaff, L. W. v. d. (2015). Dynamic programming on Nice Tree Decompositions. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/309652

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

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/309652.

MLA Handbook (7^{th} Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Web. 19 Jul 2019.

Vancouver:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652.

Council of Science Editors:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652

4.
Baste, Julien.
* Treewidth* : algorithmic, combinatorial, and practical aspects :

Degree: Docteur es, Informatique, 2017, Montpellier

URL: http://www.theses.fr/2017MONTS065

►

Dans cette thèse, nous étudions la complexité paramétrée de problèmes combinatoires dans les graphes. Plus précisément, nous présentons une multitude d’algorithmes de programmation dynamique ainsi… (more)

Subjects/Keywords: Théorie des graphes; Treewidth; Algorithmes; Réductions; Programmation dynamique; Graph theory; Treewidth; Algorithms; Reductions; Dynamic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Baste, J. (2017). Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2017MONTS065

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

Baste, Julien. “Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques.” 2017. Doctoral Dissertation, Montpellier. Accessed July 19, 2019. http://www.theses.fr/2017MONTS065.

MLA Handbook (7^{th} Edition):

Baste, Julien. “Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques.” 2017. Web. 19 Jul 2019.

Vancouver:

Baste J. Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques. [Internet] [Doctoral dissertation]. Montpellier; 2017. [cited 2019 Jul 19]. Available from: http://www.theses.fr/2017MONTS065.

Council of Science Editors:

Baste J. Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques. [Doctoral Dissertation]. Montpellier; 2017. Available from: http://www.theses.fr/2017MONTS065

5.
Wolle, Thomas.
Computational aspects of *treewidth* : Lower bounds and network reliability.

Degree: 2005, University Utrecht

URL: http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282

► Good *treewidth* lower bounds can be used in branch-and-bound methods. The better and faster the bounds, the faster the branch-and-bound algorithm. They are also useful…
(more)

Subjects/Keywords: graphs; treewidth; graphs of bounded treewidth; treewidth lower bounds; network reliability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wolle, T. (2005). Computational aspects of treewidth : Lower bounds and network reliability. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282

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

Wolle, Thomas. “Computational aspects of treewidth : Lower bounds and network reliability.” 2005. Doctoral Dissertation, University Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282.

MLA Handbook (7^{th} Edition):

Wolle, Thomas. “Computational aspects of treewidth : Lower bounds and network reliability.” 2005. Web. 19 Jul 2019.

Vancouver:

Wolle T. Computational aspects of treewidth : Lower bounds and network reliability. [Internet] [Doctoral dissertation]. University Utrecht; 2005. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282.

Council of Science Editors:

Wolle T. Computational aspects of treewidth : Lower bounds and network reliability. [Doctoral Dissertation]. University Utrecht; 2005. Available from: http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282

Universiteit Utrecht

6. Kloks, A.J.J. Treewidth.

Degree: 1993, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/330864

► This thesis focuses on problems related to *treewidth* and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The *treewidth* of…
(more)

Subjects/Keywords: Treewidth; pathwidth; graphs; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kloks, A. J. J. (1993). Treewidth. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/330864

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

Kloks, A J J. “Treewidth.” 1993. Doctoral Dissertation, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/330864.

MLA Handbook (7^{th} Edition):

Kloks, A J J. “Treewidth.” 1993. Web. 19 Jul 2019.

Vancouver:

Kloks AJJ. Treewidth. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 1993. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/330864.

Council of Science Editors:

Kloks AJJ. Treewidth. [Doctoral Dissertation]. Universiteit Utrecht; 1993. Available from: http://dspace.library.uu.nl:8080/handle/1874/330864

7. Kloks, A.J.J. Treewidth.

Degree: 1993, University Utrecht

URL: http://dspace.library.uu.nl/handle/1874/330864 ; URN:NBN:NL:UI:10-1874-330864 ; urn:isbn:9039304068 ; URN:NBN:NL:UI:10-1874-330864 ; http://dspace.library.uu.nl/handle/1874/330864

► This thesis focuses on problems related to *treewidth* and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The *treewidth* of…
(more)

Subjects/Keywords: Treewidth; pathwidth; graphs; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kloks, A. J. J. (1993). Treewidth. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/330864 ; URN:NBN:NL:UI:10-1874-330864 ; urn:isbn:9039304068 ; URN:NBN:NL:UI:10-1874-330864 ; http://dspace.library.uu.nl/handle/1874/330864

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

Kloks, A J J. “Treewidth.” 1993. Doctoral Dissertation, University Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl/handle/1874/330864 ; URN:NBN:NL:UI:10-1874-330864 ; urn:isbn:9039304068 ; URN:NBN:NL:UI:10-1874-330864 ; http://dspace.library.uu.nl/handle/1874/330864.

MLA Handbook (7^{th} Edition):

Kloks, A J J. “Treewidth.” 1993. Web. 19 Jul 2019.

Vancouver:

Kloks AJJ. Treewidth. [Internet] [Doctoral dissertation]. University Utrecht; 1993. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl/handle/1874/330864 ; URN:NBN:NL:UI:10-1874-330864 ; urn:isbn:9039304068 ; URN:NBN:NL:UI:10-1874-330864 ; http://dspace.library.uu.nl/handle/1874/330864.

Council of Science Editors:

Kloks AJJ. Treewidth. [Doctoral Dissertation]. University Utrecht; 1993. Available from: http://dspace.library.uu.nl/handle/1874/330864 ; URN:NBN:NL:UI:10-1874-330864 ; urn:isbn:9039304068 ; URN:NBN:NL:UI:10-1874-330864 ; http://dspace.library.uu.nl/handle/1874/330864

University of Melbourne

8.
Harvey, Daniel John.
On *Treewidth* and Graph Minors.

Degree: 2014, University of Melbourne

URL: http://hdl.handle.net/11343/40752

► Both *treewidth* and the Hadwiger number are key graph parameters in structural and algorithmic graph theory, especially in the theory of graph minors. For example,…
(more)

Subjects/Keywords: graph theory; treewidth; parameters tied to treewidth; line graphs; Kneser graphs; Erdős-Ko-Rado Theorem; graph minors; graph algorithms; Hadwiger number; Hadwiger conjecture; circular arc graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harvey, D. J. (2014). On Treewidth and Graph Minors. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/40752

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

Harvey, Daniel John. “On Treewidth and Graph Minors.” 2014. Doctoral Dissertation, University of Melbourne. Accessed July 19, 2019. http://hdl.handle.net/11343/40752.

MLA Handbook (7^{th} Edition):

Harvey, Daniel John. “On Treewidth and Graph Minors.” 2014. Web. 19 Jul 2019.

Vancouver:

Harvey DJ. On Treewidth and Graph Minors. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/11343/40752.

Council of Science Editors:

Harvey DJ. On Treewidth and Graph Minors. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/40752

Universiteit Utrecht

9. Burgwal, M.D. van de. Treecost-based Preprocessing for Probabilistic Networks.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/311172

► Probabilistic inference is an important problem in probability theory and concerns the process of computing the probability distribution of variables, given the evidence of other…
(more)

Subjects/Keywords: Treecost; treewidth; preprocessing; tree decomposition; probabilistic inference; probabilistic networks; graph theory; network theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Burgwal, M. D. v. d. (2015). Treecost-based Preprocessing for Probabilistic Networks. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/311172

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

Burgwal, M D van de. “Treecost-based Preprocessing for Probabilistic Networks.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/311172.

MLA Handbook (7^{th} Edition):

Burgwal, M D van de. “Treecost-based Preprocessing for Probabilistic Networks.” 2015. Web. 19 Jul 2019.

Vancouver:

Burgwal MDvd. Treecost-based Preprocessing for Probabilistic Networks. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/311172.

Council of Science Editors:

Burgwal MDvd. Treecost-based Preprocessing for Probabilistic Networks. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/311172

Universiteit Utrecht

10. Jaffke, L. Recognizability Equals Definability for k-Outerplanar Graphs.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/315921

► One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic…
(more)

Subjects/Keywords: treewidth; tree automata; monadic second order logic of graphs; equivalence relations over terminal graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jaffke, L. (2015). Recognizability Equals Definability for k-Outerplanar Graphs. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/315921

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

Jaffke, L. “Recognizability Equals Definability for k-Outerplanar Graphs.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/315921.

MLA Handbook (7^{th} Edition):

Jaffke, L. “Recognizability Equals Definability for k-Outerplanar Graphs.” 2015. Web. 19 Jul 2019.

Vancouver:

Jaffke L. Recognizability Equals Definability for k-Outerplanar Graphs. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/315921.

Council of Science Editors:

Jaffke L. Recognizability Equals Definability for k-Outerplanar Graphs. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/315921

Universiteit Utrecht

11. Fafianie, S. Efficient Implementation of Dynamic Programming with Representative Sets.

Degree: 2013, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/286952

► In the rank based approach introduced by Bodlaender et al. the notion of representative sets is applied to dynamic programming algorithms for connectivity problems parameterized…
(more)

Subjects/Keywords: rank; based; approach; representative; sets; dynamic; programming; treewidth; steiner; tree; decomposition; implementation; experimental; evaluation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fafianie, S. (2013). Efficient Implementation of Dynamic Programming with Representative Sets. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/286952

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

Fafianie, S. “Efficient Implementation of Dynamic Programming with Representative Sets.” 2013. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/286952.

MLA Handbook (7^{th} Edition):

Fafianie, S. “Efficient Implementation of Dynamic Programming with Representative Sets.” 2013. Web. 19 Jul 2019.

Vancouver:

Fafianie S. Efficient Implementation of Dynamic Programming with Representative Sets. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/286952.

Council of Science Editors:

Fafianie S. Efficient Implementation of Dynamic Programming with Representative Sets. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/286952

Universiteit Utrecht

12.
Kreuzen, V.J.C.
Kernelization Rules for Special *Treewidth* and Spaghetti * Treewidth*.

Degree: 2012, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/253752

Subjects/Keywords: treewidth; special treewidth; spaghetti treewidth; kreuzen; kernelization; preprocessing; graph theory; mambas; paths of cycles

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kreuzen, V. J. C. (2012). Kernelization Rules for Special Treewidth and Spaghetti Treewidth. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253752

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

Kreuzen, V J C. “Kernelization Rules for Special Treewidth and Spaghetti Treewidth.” 2012. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/253752.

MLA Handbook (7^{th} Edition):

Kreuzen, V J C. “Kernelization Rules for Special Treewidth and Spaghetti Treewidth.” 2012. Web. 19 Jul 2019.

Vancouver:

Kreuzen VJC. Kernelization Rules for Special Treewidth and Spaghetti Treewidth. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253752.

Council of Science Editors:

Kreuzen VJC. Kernelization Rules for Special Treewidth and Spaghetti Treewidth. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253752

Universiteit Utrecht

13.
Wolle, Thomas.
Computational aspects of *treewidth* : Lower bounds and network reliability.

Degree: 2005, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/3282

► Good *treewidth* lower bounds can be used in branch-and-bound methods. The better and faster the bounds, the faster the branch-and-bound algorithm. They are also useful…
(more)

Subjects/Keywords: Wiskunde en Informatica; graphs; treewidth; graphs of bounded treewidth; treewidth lower bounds; network reliability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wolle, T. (2005). Computational aspects of treewidth : Lower bounds and network reliability. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/3282

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

Wolle, Thomas. “Computational aspects of treewidth : Lower bounds and network reliability.” 2005. Doctoral Dissertation, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/3282.

MLA Handbook (7^{th} Edition):

Wolle, Thomas. “Computational aspects of treewidth : Lower bounds and network reliability.” 2005. Web. 19 Jul 2019.

Vancouver:

Wolle T. Computational aspects of treewidth : Lower bounds and network reliability. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 2005. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/3282.

Council of Science Editors:

Wolle T. Computational aspects of treewidth : Lower bounds and network reliability. [Doctoral Dissertation]. Universiteit Utrecht; 2005. Available from: http://dspace.library.uu.nl:8080/handle/1874/3282

14. Jefferson LourenÃo Gurguri. Polyhedral Study of Tree Decomposition.

Degree: Master, 2015, Universidade Federal do Ceará

URL: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17121 ;

►

The concept of *treewidth* was introduced by Robertson and Seymour. *Treewidth* may be defined as the size of the largest vertex set in a tree…
(more)

Subjects/Keywords: MATEMATICA DA COMPUTACAO; Largura em Ãrvore; FormulaÃÃo por ordem de eliminaÃÃo; CombinatÃria poliÃdrica ; Treewidth; Elimination order formulation; Polyhedral combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gurguri, J. L. (2015). Polyhedral Study of Tree Decomposition. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17121 ;

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

Gurguri, Jefferson LourenÃo. “Polyhedral Study of Tree Decomposition.” 2015. Masters Thesis, Universidade Federal do Ceará. Accessed July 19, 2019. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17121 ;.

MLA Handbook (7^{th} Edition):

Gurguri, Jefferson LourenÃo. “Polyhedral Study of Tree Decomposition.” 2015. Web. 19 Jul 2019.

Vancouver:

Gurguri JL. Polyhedral Study of Tree Decomposition. [Internet] [Masters thesis]. Universidade Federal do Ceará 2015. [cited 2019 Jul 19]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17121 ;.

Council of Science Editors:

Gurguri JL. Polyhedral Study of Tree Decomposition. [Masters Thesis]. Universidade Federal do Ceará 2015. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17121 ;

15. Beimers, M.J. Tour merging via tree decomposition.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/320414

► The TSP and VRP are well known optimization problems. In this thesis we evaluate the use of a dynamic programming algorithm on a tree decomposition…
(more)

Subjects/Keywords: tourmerging; treewidth; TSP; VRP; heuristics; DP

…The width k of the tree decomposition is maxi∈W |Xi | − 1. The *treewidth* of
a graph G, is… …*treewidth* or the optimal tree decomposition for unknown *treewidth* is an NP-Hard problem [20… …Koster, A. M. (2010). *Treewidth* computations I.
Upper bounds. Information and…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Beimers, M. J. (2015). Tour merging via tree decomposition. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/320414

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

Beimers, M J. “Tour merging via tree decomposition.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/320414.

MLA Handbook (7^{th} Edition):

Beimers, M J. “Tour merging via tree decomposition.” 2015. Web. 19 Jul 2019.

Vancouver:

Beimers MJ. Tour merging via tree decomposition. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/320414.

Council of Science Editors:

Beimers MJ. Tour merging via tree decomposition. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/320414

16.
Li, A.
Aspects of random geometric graphs : Pursuit-evasion and * treewidth*.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/323296

► In this thesis, we studied two aspects of random geometric graphs: pursuit-evasion and *treewidth*. We first studied one pursuit-evasion game: Cops and Robbers. This game,…
(more)

Subjects/Keywords: Random geometric graphs; Cops and Robbers; Treewidth

…Cops and Robbers games on percolated random geometric graphs;
• *Treewidth* of random geometric… …x5B;71].
• On the *treewidth* of random geometric graphs and percolated grids; joint… …investigated the *treewidth* of random geometric
graphs.
In this chapter, we first review some… …percolation, we refer to the book [78].
1.1.4
*Treewidth*
Many problems that are NP-hard… …graphs with some constant upper bound on the
*treewidth*, for example Hamiltonian circuit, vertex…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, A. (2015). Aspects of random geometric graphs : Pursuit-evasion and treewidth. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/323296

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

Li, A. “Aspects of random geometric graphs : Pursuit-evasion and treewidth.” 2015. Doctoral Dissertation, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/323296.

MLA Handbook (7^{th} Edition):

Li, A. “Aspects of random geometric graphs : Pursuit-evasion and treewidth.” 2015. Web. 19 Jul 2019.

Vancouver:

Li A. Aspects of random geometric graphs : Pursuit-evasion and treewidth. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/323296.

Council of Science Editors:

Li A. Aspects of random geometric graphs : Pursuit-evasion and treewidth. [Doctoral Dissertation]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/323296

Universiteit Utrecht

17. Timmer, S.T. Exact Algorithms for Loop Cutset.

Degree: 2012, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/253746

► The LOOP CUTSET problem was historically posed by Pearl as a subroutine in Pearl’s algorithm for computing inference in probabilistic networks. The efficiency of the…
(more)

Subjects/Keywords: LOOP CUTSET; MAXIMUM INDUCED FOREST; Exact Algorithms; Treewidth; Cut & Count; Branch & Bound; Branch & Reduce; FEEDBACK VERTEX SET

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Timmer, S. T. (2012). Exact Algorithms for Loop Cutset. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253746

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

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/253746.

MLA Handbook (7^{th} Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Web. 19 Jul 2019.

Vancouver:

Timmer ST. Exact Algorithms for Loop Cutset. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746.

Council of Science Editors:

Timmer ST. Exact Algorithms for Loop Cutset. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746

18.
Li, A.
Aspects of random geometric graphs : Pursuit-evasion and * treewidth*.

Degree: 2015, University Utrecht

URL: http://dspace.library.uu.nl/handle/1874/323296 ; URN:NBN:NL:UI:10-1874-323296 ; urn:isbn:978-90-393-6414-7 ; URN:NBN:NL:UI:10-1874-323296 ; http://dspace.library.uu.nl/handle/1874/323296

► In this thesis, we studied two aspects of random geometric graphs: pursuit-evasion and *treewidth*. We first studied one pursuit-evasion game: Cops and Robbers. This game,…
(more)

Subjects/Keywords: Random geometric graphs; Cops and Robbers; Treewidth

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, A. (2015). Aspects of random geometric graphs : Pursuit-evasion and treewidth. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/323296 ; URN:NBN:NL:UI:10-1874-323296 ; urn:isbn:978-90-393-6414-7 ; URN:NBN:NL:UI:10-1874-323296 ; http://dspace.library.uu.nl/handle/1874/323296

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

Li, A. “Aspects of random geometric graphs : Pursuit-evasion and treewidth.” 2015. Doctoral Dissertation, University Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl/handle/1874/323296 ; URN:NBN:NL:UI:10-1874-323296 ; urn:isbn:978-90-393-6414-7 ; URN:NBN:NL:UI:10-1874-323296 ; http://dspace.library.uu.nl/handle/1874/323296.

MLA Handbook (7^{th} Edition):

Li, A. “Aspects of random geometric graphs : Pursuit-evasion and treewidth.” 2015. Web. 19 Jul 2019.

Vancouver:

Li A. Aspects of random geometric graphs : Pursuit-evasion and treewidth. [Internet] [Doctoral dissertation]. University Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl/handle/1874/323296 ; URN:NBN:NL:UI:10-1874-323296 ; urn:isbn:978-90-393-6414-7 ; URN:NBN:NL:UI:10-1874-323296 ; http://dspace.library.uu.nl/handle/1874/323296.

Council of Science Editors:

Li A. Aspects of random geometric graphs : Pursuit-evasion and treewidth. [Doctoral Dissertation]. University Utrecht; 2015. Available from: http://dspace.library.uu.nl/handle/1874/323296 ; URN:NBN:NL:UI:10-1874-323296 ; urn:isbn:978-90-393-6414-7 ; URN:NBN:NL:UI:10-1874-323296 ; http://dspace.library.uu.nl/handle/1874/323296

Indian Institute of Science

19. Bharadwaj, Subramanya B V. The Isoperimetric Problem On Trees And Bounded Tree Width Graphs.

Degree: 2008, Indian Institute of Science

URL: http://hdl.handle.net/2005/844

► In this thesis we study the isoperimetric problem on trees and graphs with bounded *treewidth*. Let G = (V,E) be a finite, simple and undirected…
(more)

Subjects/Keywords: Computer Graphics - Algorithms; Computer Graphics - Mathematical Models; Isoperimetric Inequalities; Meta-Fibonacci Sequences; Graph Theory; Trees (Graph Theory); Treewidth Graphs; Weighted Graphs; Infinite Binary Tree; Isoperimetric Problem; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bharadwaj, S. B. V. (2008). The Isoperimetric Problem On Trees And Bounded Tree Width Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/844

Not specified: Masters Thesis or Doctoral Dissertation

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

Bharadwaj, Subramanya B V. “The Isoperimetric Problem On Trees And Bounded Tree Width Graphs.” 2008. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/844.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bharadwaj, Subramanya B V. “The Isoperimetric Problem On Trees And Bounded Tree Width Graphs.” 2008. Web. 19 Jul 2019.

Vancouver:

Bharadwaj SBV. The Isoperimetric Problem On Trees And Bounded Tree Width Graphs. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/844.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bharadwaj SBV. The Isoperimetric Problem On Trees And Bounded Tree Width Graphs. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/844

Not specified: Masters Thesis or Doctoral Dissertation

20. Γιαννοπούλου, Αρχοντία. Μερικές διατάξεις και αλγόριθμοι σε γραφήματα.

Degree: 2012, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

URL: http://hdl.handle.net/10442/hedi/28621

► In the Graph Minors project, N. Robertson and P. Seymour, proved a series of structural and algorithmic results. Some of them, such as the Strong…
(more)

Subjects/Keywords: Θεωρία ελάσσονων γραφημάτων; Θεωρία αποκλεισμού σχάρας; Θεωρία δισδιαστατότητας; Ανίχνευση γραφημάτων; Δεντρόπλατος; Graph minor theory; Excluded grid theoren; Bidimensionality theory; Graph searching; Treewidth

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Γιαννοπούλου, . . (2012). Μερικές διατάξεις και αλγόριθμοι σε γραφήματα. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/28621

Not specified: Masters Thesis or Doctoral Dissertation

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

Γιαννοπούλου, Αρχοντία. “Μερικές διατάξεις και αλγόριθμοι σε γραφήματα.” 2012. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed July 19, 2019. http://hdl.handle.net/10442/hedi/28621.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Γιαννοπούλου, Αρχοντία. “Μερικές διατάξεις και αλγόριθμοι σε γραφήματα.” 2012. Web. 19 Jul 2019.

Vancouver:

Γιαννοπούλου . Μερικές διατάξεις και αλγόριθμοι σε γραφήματα. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2012. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/10442/hedi/28621.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Γιαννοπούλου . Μερικές διατάξεις και αλγόριθμοι σε γραφήματα. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2012. Available from: http://hdl.handle.net/10442/hedi/28621

Not specified: Masters Thesis or Doctoral Dissertation

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

Degree: Master, 2007, Universidade Federal do Ceará

URL: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;

►

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

22. Boxel, M.E.R. van. Improved Algorithms for the Computation of Special Junction Trees.

Degree: 2014, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/296605

► Several intractable (e.g. NP-complete) graph problems can be solved efficiently with help of junction trees without large bags. Graph parameters that measure the suitability of…
(more)

Subjects/Keywords: Treewidth; Treecost; Pathwidth; Triangulation; Dynamic programming; Exact algorithm; Experiments

…can easily find the corresponding *treewidth*.
The *treewidth* is defined by the size of the… …formula for finding the *treewidth* of a junction tree T (V, E).
If we apply the… …*treewidth* formula on the two junction trees in Figure 2, we obtain values 2
and 5 respectively… …Definition 3.2 The *treewidth* of a junction tree T (V, E) is the integer defined by
T W… …*treewidth* of a junction tree we would like to find the *treewidth* of a
graph. The minimum *treewidth*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boxel, M. E. R. v. (2014). Improved Algorithms for the Computation of Special Junction Trees. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/296605

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

Boxel, M E R van. “Improved Algorithms for the Computation of Special Junction Trees.” 2014. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/296605.

MLA Handbook (7^{th} Edition):

Boxel, M E R van. “Improved Algorithms for the Computation of Special Junction Trees.” 2014. Web. 19 Jul 2019.

Vancouver:

Boxel MERv. Improved Algorithms for the Computation of Special Junction Trees. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/296605.

Council of Science Editors:

Boxel MERv. Improved Algorithms for the Computation of Special Junction Trees. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/296605

Indian Institute of Science

23. Rajendraprasad, Deepak. Rainbow Colouring and Some Dimensional Problems in Graph Theory.

Degree: 2013, Indian Institute of Science

URL: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

► This thesis touches three diﬀerent topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is…
(more)

Subjects/Keywords: Graph Theory; Rainbow Coloring - Graphs; Product Dimension - Graphs; Boxicity; Cubicity; Hypergraphs; Product Graphs; Forests Graphs; Treewidth Graphs; Tree (Graph Theory); Split Graphs; Threshold Graphs; Graph - Coloring; Rainbow Connection; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rajendraprasad, D. (2013). Rainbow Colouring and Some Dimensional Problems in Graph Theory. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2013. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2013. Web. 19 Jul 2019.

Vancouver:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

24. Sridhar, Vijay, Sridhar. On the effect of asymmetry and dimension on computational geometric problems.

Degree: PhD, Computer Science and Engineering, 2018, The Ohio State University

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

► We study two aspects of metric spaces that affect the computational complexity of geometric problems. First, we study directed cut problems and the associated multi-commodity…
(more)

Subjects/Keywords: Computer Science; Metric-Embeddings; Quasimetrics; Random-Embeddings; Treewidth; Directed Sparsest-Cut; Directed Multi-Cut; Fractal-Dimension; Exact-Algorithms; Fixed-Parameter-Tractability; Approximation- Schemes; Spanners; Lower-Bounds; Exponential-Time-Hypothesis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sridhar, Vijay, S. (2018). On the effect of asymmetry and dimension on computational geometric problems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304

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

Sridhar, Vijay, Sridhar. “On the effect of asymmetry and dimension on computational geometric problems.” 2018. Doctoral Dissertation, The Ohio State University. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304.

MLA Handbook (7^{th} Edition):

Sridhar, Vijay, Sridhar. “On the effect of asymmetry and dimension on computational geometric problems.” 2018. Web. 19 Jul 2019.

Vancouver:

Sridhar, Vijay S. On the effect of asymmetry and dimension on computational geometric problems. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304.

Council of Science Editors:

Sridhar, Vijay S. On the effect of asymmetry and dimension on computational geometric problems. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304

Texas A&M University

25. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155568

► In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,…
(more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

Not specified: Masters Thesis or Doctoral Dissertation

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

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed July 19, 2019. http://hdl.handle.net/1969.1/155568.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 19 Jul 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1969.1/155568.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

Not specified: Masters Thesis or Doctoral Dissertation

26.
Yota, Otachi.
* Treewidth* and related graph parameters : 木幅と関連グラフパラメータの研究.

Degree: Gunma University / 群馬大学

URL: http://hdl.handle.net/10087/5142

►

For modeling some practical problems, graphs play very important roles.Since many modeled problems can be NP-hard in general, some restrictionsfor inputs are required. Bounding a… (more)

Subjects/Keywords: Treewidth; Spanning tree congestion; Security number of graphs; 木幅; 全域本混雑度; グラフの安全数

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yota, . O. (n.d.). Treewidth and related graph parameters : 木幅と関連グラフパラメータの研究. (Thesis). Gunma University / 群馬大学. Retrieved from http://hdl.handle.net/10087/5142

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

No year of publication.

Not specified: Masters Thesis or Doctoral Dissertation

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

Yota, Otachi. “Treewidth and related graph parameters : 木幅と関連グラフパラメータの研究.” Thesis, Gunma University / 群馬大学. Accessed July 19, 2019. http://hdl.handle.net/10087/5142.

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

No year of publication.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yota, Otachi. “Treewidth and related graph parameters : 木幅と関連グラフパラメータの研究.” Web. 19 Jul 2019.

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

No year of publication.

Vancouver:

Yota O. Treewidth and related graph parameters : 木幅と関連グラフパラメータの研究. [Internet] [Thesis]. Gunma University / 群馬大学; [cited 2019 Jul 19]. Available from: http://hdl.handle.net/10087/5142.

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

Not specified: Masters Thesis or Doctoral Dissertation

No year of publication.

Council of Science Editors:

Yota O. Treewidth and related graph parameters : 木幅と関連グラフパラメータの研究. [Thesis]. Gunma University / 群馬大学; Available from: http://hdl.handle.net/10087/5142

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

Not specified: Masters Thesis or Doctoral Dissertation

No year of publication.

27. Zanden, T.C. van der. Parameterized Complexity of Graph Constraint Logic.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/315914

► Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We…
(more)

Subjects/Keywords: nondeterministic constraint logic; parameterized complexity; pspace; treewidth; bandwidth; rush hour; reconfiguration problems

…show that CGS is weakly NP-complete even on *treewidth* 2 graphs, but becomes fixed
parameter… …tractable when parametrized by a combination of *treewidth* and maximum
degree. The bounded NCL… …variants respond similarly: they are weakly NP-hard even
on *treewidth* 2 graphs, but become fixed… …parameter tractable when parameterized by
both *treewidth* and maximum degree.
Our main result is… …which is fixed parameter tractable with respect to *treewidth* plus
maximum degree, NCL (…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zanden, T. C. v. d. (2015). Parameterized Complexity of Graph Constraint Logic. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/315914

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

Zanden, T C van der. “Parameterized Complexity of Graph Constraint Logic.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/315914.

MLA Handbook (7^{th} Edition):

Zanden, T C van der. “Parameterized Complexity of Graph Constraint Logic.” 2015. Web. 19 Jul 2019.

Vancouver:

Zanden TCvd. Parameterized Complexity of Graph Constraint Logic. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/315914.

Council of Science Editors:

Zanden TCvd. Parameterized Complexity of Graph Constraint Logic. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/315914

28. Ducoffe, Guillaume. Propriétés métriques des grands graphes : Metric properties of large graphs.

Degree: Docteur es, Informatique, 2016, Côte d'Azur

URL: http://www.theses.fr/2016AZUR4134

►

Les grands réseaux de communication sont partout, des centres de données avec des millions de serveurs jusqu’aux réseaux sociaux avec plusieurs milliards d’utilisateurs.Cette thèse est… (more)

Subjects/Keywords: Graphe; Algorithmes; Complexité dans P; Hyperbolicité; Jeux de coloration; Équilibre de Nash; Apprentissage de fonction booléenne; Graph; Algorithms; Complexity in P; Gromov Hyperbolicity; Treelength; Treebreadth; Treewidth; Coloring games; Nash equilibrium; Boolean function learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ducoffe, G. (2016). Propriétés métriques des grands graphes : Metric properties of large graphs. (Doctoral Dissertation). Côte d'Azur. Retrieved from http://www.theses.fr/2016AZUR4134

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

Ducoffe, Guillaume. “Propriétés métriques des grands graphes : Metric properties of large graphs.” 2016. Doctoral Dissertation, Côte d'Azur. Accessed July 19, 2019. http://www.theses.fr/2016AZUR4134.

MLA Handbook (7^{th} Edition):

Ducoffe, Guillaume. “Propriétés métriques des grands graphes : Metric properties of large graphs.” 2016. Web. 19 Jul 2019.

Vancouver:

Ducoffe G. Propriétés métriques des grands graphes : Metric properties of large graphs. [Internet] [Doctoral dissertation]. Côte d'Azur; 2016. [cited 2019 Jul 19]. Available from: http://www.theses.fr/2016AZUR4134.

Council of Science Editors:

Ducoffe G. Propriétés métriques des grands graphes : Metric properties of large graphs. [Doctoral Dissertation]. Côte d'Azur; 2016. Available from: http://www.theses.fr/2016AZUR4134

29. Kumar, Neeraj. Graph-theoretic Properties of Control Flow Graphs and Applications.

Degree: 2015, University of Waterloo

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

► This thesis deals with determining appropriate width parameters of control flow graphs so that certain computationally hard problems of practical interest become efficiently solvable. A…
(more)

Subjects/Keywords: treewidth; DAG-width; entanglement; Kelly-width; control flow graphs; mu-calculus model checking; special graph classes

…characterization.
Note that the digraph width measures (except the *treewidth*) must respect
the… …of bounded *treewidth* [17, 24], DAG-width [10, 17],
Kelly-width [10… …software
programs.
Among special graph classes, graphs of *treewidth* at most k have garnered… …spawned a rich field of algorithmic research. *Treewidth* gives a notion of graph decomposition… …efficiently when restricted to graphs of *treewidth* at most k. Using such techniques, Obdržálek…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kumar, N. (2015). Graph-theoretic Properties of Control Flow Graphs and Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9580

Not specified: Masters Thesis or Doctoral Dissertation

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

Kumar, Neeraj. “Graph-theoretic Properties of Control Flow Graphs and Applications.” 2015. Thesis, University of Waterloo. Accessed July 19, 2019. http://hdl.handle.net/10012/9580.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kumar, Neeraj. “Graph-theoretic Properties of Control Flow Graphs and Applications.” 2015. Web. 19 Jul 2019.

Vancouver:

Kumar N. Graph-theoretic Properties of Control Flow Graphs and Applications. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/10012/9580.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kumar N. Graph-theoretic Properties of Control Flow Graphs and Applications. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9580

Not specified: Masters Thesis or Doctoral Dissertation

30.
van der Zanden, Tom Cornelis.
Theory and Practical Applications of * Treewidth*.

Degree: 2019, University Utrecht

URL: http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134

► This thesis studies the theory and practical applications of separator-based dynamic programming (and in particular *treewidth*) for solving combinatorial problems in graphs. The thesis consists…
(more)

Subjects/Keywords: treewidth; graph theory; exponential time hypothesis; centrality measures; subgraph isomorphism; complexity; algorithms; geometric intersection graphs; Shapley value

Record Details Similar Records

❌

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

APA (6^{th} Edition):

van der Zanden, T. C. (2019). Theory and Practical Applications of Treewidth. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134

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

van der Zanden, Tom Cornelis. “Theory and Practical Applications of Treewidth.” 2019. Doctoral Dissertation, University Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134.

MLA Handbook (7^{th} Edition):

van der Zanden, Tom Cornelis. “Theory and Practical Applications of Treewidth.” 2019. Web. 19 Jul 2019.

Vancouver:

van der Zanden TC. Theory and Practical Applications of Treewidth. [Internet] [Doctoral dissertation]. University Utrecht; 2019. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134.

Council of Science Editors:

van der Zanden TC. Theory and Practical Applications of Treewidth. [Doctoral Dissertation]. University Utrecht; 2019. Available from: http://dspace.library.uu.nl/handle/1874/381134 ; URN:NBN:NL:UI:10-1874-381134 ; urn:isbn:978-90-393-7147-3 ; URN:NBN:NL:UI:10-1874-381134 ; http://dspace.library.uu.nl/handle/1874/381134