Advanced search options

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

You searched for `subject:( Directed graphs)`

.
Showing records 1 – 30 of
92 total matches.

Search Limiters

Dates

- 2016 – 2020 (29)
- 2011 – 2015 (33)
- 2006 – 2010 (16)

▼ Search Limiters

Iowa State University

1.
Blumenthal, Adam.
Domination problems in *directed* *graphs* and inducibility of nets.

Degree: 2020, Iowa State University

URL: https://lib.dr.iastate.edu/etd/17952

► In this thesis we discuss two topics: domination parameters and inducibility. In the first chapter, we introduce basic concepts, definitions, and a brief history for…
(more)

Subjects/Keywords: Directed Graphs; Domination; Extremal Combinatorics; Graphs; Inducibility

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blumenthal, A. (2020). Domination problems in directed graphs and inducibility of nets. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17952

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

Blumenthal, Adam. “Domination problems in directed graphs and inducibility of nets.” 2020. Thesis, Iowa State University. Accessed July 11, 2020. https://lib.dr.iastate.edu/etd/17952.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Blumenthal, Adam. “Domination problems in directed graphs and inducibility of nets.” 2020. Web. 11 Jul 2020.

Vancouver:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Internet] [Thesis]. Iowa State University; 2020. [cited 2020 Jul 11]. Available from: https://lib.dr.iastate.edu/etd/17952.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17952

Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

2. Lee, Changwoo. On the domination number of a digraph.

Degree: PhD, Department of Mathematics, 1994, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:23936

Subjects/Keywords: Directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lee, C. (1994). On the domination number of a digraph. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:23936

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

Lee, Changwoo. “On the domination number of a digraph.” 1994. Doctoral Dissertation, Michigan State University. Accessed July 11, 2020. http://etd.lib.msu.edu/islandora/object/etd:23936.

MLA Handbook (7^{th} Edition):

Lee, Changwoo. “On the domination number of a digraph.” 1994. Web. 11 Jul 2020.

Vancouver:

Lee C. On the domination number of a digraph. [Internet] [Doctoral dissertation]. Michigan State University; 1994. [cited 2020 Jul 11]. Available from: http://etd.lib.msu.edu/islandora/object/etd:23936.

Council of Science Editors:

Lee C. On the domination number of a digraph. [Doctoral Dissertation]. Michigan State University; 1994. Available from: http://etd.lib.msu.edu/islandora/object/etd:23936

3. Christopher, Jeffrey. Induced path number for the complementary prism of a grid graph.

Degree: 2019, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/594

► The induced path number rho(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can…
(more)

Subjects/Keywords: Graph theory; Directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Christopher, J. (2019). Induced path number for the complementary prism of a grid graph. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/594

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

Christopher, Jeffrey. “Induced path number for the complementary prism of a grid graph.” 2019. Masters Thesis, University of Tennessee – Chattanooga. Accessed July 11, 2020. https://scholar.utc.edu/theses/594.

MLA Handbook (7^{th} Edition):

Christopher, Jeffrey. “Induced path number for the complementary prism of a grid graph.” 2019. Web. 11 Jul 2020.

Vancouver:

Christopher J. Induced path number for the complementary prism of a grid graph. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2020 Jul 11]. Available from: https://scholar.utc.edu/theses/594.

Council of Science Editors:

Christopher J. Induced path number for the complementary prism of a grid graph. [Masters Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/594

University of Victoria

4.
Dame, Lorraine Frances.
The exponent and circumdiameter of primitive *directed* * graphs*.

Degree: Dept. of Mathematics and Statistics, 2008, University of Victoria

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

Subjects/Keywords: Directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dame, L. F. (2008). The exponent and circumdiameter of primitive directed graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/400

Not specified: Masters Thesis or Doctoral Dissertation

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

Dame, Lorraine Frances. “The exponent and circumdiameter of primitive directed graphs.” 2008. Thesis, University of Victoria. Accessed July 11, 2020. http://hdl.handle.net/1828/400.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dame, Lorraine Frances. “The exponent and circumdiameter of primitive directed graphs.” 2008. Web. 11 Jul 2020.

Vancouver:

Dame LF. The exponent and circumdiameter of primitive directed graphs. [Internet] [Thesis]. University of Victoria; 2008. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1828/400.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dame LF. The exponent and circumdiameter of primitive directed graphs. [Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/400

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

5. Heard, Scott. Kernels and quasi-kernels in digraphs.

Degree: Dept. of Mathematics and Statistics, 2008, University of Victoria

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

Subjects/Keywords: Directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Heard, S. (2008). Kernels and quasi-kernels in digraphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/677

Not specified: Masters Thesis or Doctoral Dissertation

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

Heard, Scott. “Kernels and quasi-kernels in digraphs.” 2008. Thesis, University of Victoria. Accessed July 11, 2020. http://hdl.handle.net/1828/677.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Heard, Scott. “Kernels and quasi-kernels in digraphs.” 2008. Web. 11 Jul 2020.

Vancouver:

Heard S. Kernels and quasi-kernels in digraphs. [Internet] [Thesis]. University of Victoria; 2008. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1828/677.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Heard S. Kernels and quasi-kernels in digraphs. [Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/677

Not specified: Masters Thesis or Doctoral Dissertation

University of Kansas

6.
Adams, Kevin Daniel.
On Kernels, β-*graphs*, and β-graph Sequences of Digraphs.

Degree: MA, Mathematics, 2015, University of Kansas

URL: http://hdl.handle.net/1808/19005

► We begin by investigating some conditions determining the existence of kernels in various classes of *directed* *graphs*, most notably in oriented trees, grid *graphs*, and…
(more)

Subjects/Keywords: Mathematics; Absorbant Sets; Directed Graphs; Dominating Sets; β-graphs; 𝛾-graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adams, K. D. (2015). On Kernels, β-graphs, and β-graph Sequences of Digraphs. (Masters Thesis). University of Kansas. Retrieved from http://hdl.handle.net/1808/19005

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

Adams, Kevin Daniel. “On Kernels, β-graphs, and β-graph Sequences of Digraphs.” 2015. Masters Thesis, University of Kansas. Accessed July 11, 2020. http://hdl.handle.net/1808/19005.

MLA Handbook (7^{th} Edition):

Adams, Kevin Daniel. “On Kernels, β-graphs, and β-graph Sequences of Digraphs.” 2015. Web. 11 Jul 2020.

Vancouver:

Adams KD. On Kernels, β-graphs, and β-graph Sequences of Digraphs. [Internet] [Masters thesis]. University of Kansas; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1808/19005.

Council of Science Editors:

Adams KD. On Kernels, β-graphs, and β-graph Sequences of Digraphs. [Masters Thesis]. University of Kansas; 2015. Available from: http://hdl.handle.net/1808/19005

University of South Africa

7.
Van der Linde, Jan Johannes.
Enlarging *directed* *graphs* to ensure all nodes are contained.

Degree: 2015, University of South Africa

URL: http://hdl.handle.net/10500/21520

► Graph augmentation concerns the addition of edges to a graph to satisfy some connectivity property of a graph. Previous research in this field has been…
(more)

Subjects/Keywords: Directed graphs; Graph enlargement; Cycle picking

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Van der Linde, J. J. (2015). Enlarging directed graphs to ensure all nodes are contained. (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/21520

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

Van der Linde, Jan Johannes. “Enlarging directed graphs to ensure all nodes are contained.” 2015. Masters Thesis, University of South Africa. Accessed July 11, 2020. http://hdl.handle.net/10500/21520.

MLA Handbook (7^{th} Edition):

Van der Linde, Jan Johannes. “Enlarging directed graphs to ensure all nodes are contained.” 2015. Web. 11 Jul 2020.

Vancouver:

Van der Linde JJ. Enlarging directed graphs to ensure all nodes are contained. [Internet] [Masters thesis]. University of South Africa; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10500/21520.

Council of Science Editors:

Van der Linde JJ. Enlarging directed graphs to ensure all nodes are contained. [Masters Thesis]. University of South Africa; 2015. Available from: http://hdl.handle.net/10500/21520

University of Lethbridge

8.
University of Lethbridge. Faculty of Arts and Science.
Energy of *graphs* and digraphs
.

Degree: 2010, University of Lethbridge

URL: http://hdl.handle.net/10133/2489

► The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the…
(more)

Subjects/Keywords: Graph theory; Directed graphs; Eigenvalues; Dissertations, Academic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Science, U. o. L. F. o. A. a. (2010). Energy of graphs and digraphs . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/2489

Not specified: Masters Thesis or Doctoral Dissertation

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

Science, University of Lethbridge. Faculty of Arts and. “Energy of graphs and digraphs .” 2010. Thesis, University of Lethbridge. Accessed July 11, 2020. http://hdl.handle.net/10133/2489.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Energy of graphs and digraphs .” 2010. Web. 11 Jul 2020.

Vancouver:

Science UoLFoAa. Energy of graphs and digraphs . [Internet] [Thesis]. University of Lethbridge; 2010. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10133/2489.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Energy of graphs and digraphs . [Thesis]. University of Lethbridge; 2010. Available from: http://hdl.handle.net/10133/2489

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

9.
Graf, Alessandra.
On the Strongly Connected Components of Random *Directed* *Graphs* with Given Degree Sequences.

Degree: 2016, University of Waterloo

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

► A strongly connected component of a *directed* graph G is a maximal subgraph H of G such that for each pair of vertices u and…
(more)

Subjects/Keywords: random graphs; directed graphs; strongly connected components; percolation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Graf, A. (2016). On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10681

Not specified: Masters Thesis or Doctoral Dissertation

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

Graf, Alessandra. “On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.” 2016. Thesis, University of Waterloo. Accessed July 11, 2020. http://hdl.handle.net/10012/10681.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Graf, Alessandra. “On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.” 2016. Web. 11 Jul 2020.

Vancouver:

Graf A. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10012/10681.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Graf A. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10681

Not specified: Masters Thesis or Doctoral Dissertation

University of Colorado

10.
Fox, Alyson Lindsey.
Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, *Directed* * Graphs*.

Degree: PhD, Applied Mathematics, 2017, University of Colorado

URL: https://scholar.colorado.edu/appm_gradetds/96

► Relational datasets are often modeled as an unsigned, undirected graph due the nice properties of the resulting graph Laplacian, but information is lost if…
(more)

Subjects/Keywords: Algebraic Multigrid; Directed graphs; Graph Laplacians; Gremban's expansion; Signed graphs; Applied Mechanics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fox, A. L. (2017). Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/96

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

Fox, Alyson Lindsey. “Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Doctoral Dissertation, University of Colorado. Accessed July 11, 2020. https://scholar.colorado.edu/appm_gradetds/96.

MLA Handbook (7^{th} Edition):

Fox, Alyson Lindsey. “Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Web. 11 Jul 2020.

Vancouver:

Fox AL. Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs. [Internet] [Doctoral dissertation]. University of Colorado; 2017. [cited 2020 Jul 11]. Available from: https://scholar.colorado.edu/appm_gradetds/96.

Council of Science Editors:

Fox AL. Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs. [Doctoral Dissertation]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/96

Texas A&M University

11. Perez Arguelles, Maria P. Analyzing Structural Changes and Trade Impacts in the Tomato Industry.

Degree: 2015, Texas A&M University

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

► Almost half of the tomatoes consumed in the U.S. are imported. In 2014, Mexico accounted for more than 80 percent of the tomato imports and…
(more)

Subjects/Keywords: Structural Break Points; International Trade; Great Tomato War; Directed Acyclic Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Perez Arguelles, M. P. (2015). Analyzing Structural Changes and Trade Impacts in the Tomato Industry. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155624

Not specified: Masters Thesis or Doctoral Dissertation

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

Perez Arguelles, Maria P. “Analyzing Structural Changes and Trade Impacts in the Tomato Industry.” 2015. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/155624.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Perez Arguelles, Maria P. “Analyzing Structural Changes and Trade Impacts in the Tomato Industry.” 2015. Web. 11 Jul 2020.

Vancouver:

Perez Arguelles MP. Analyzing Structural Changes and Trade Impacts in the Tomato Industry. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/155624.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Perez Arguelles MP. Analyzing Structural Changes and Trade Impacts in the Tomato Industry. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155624

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

12. Liu, Chia-Lan. Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab.

Degree: 2015, Texas A&M University

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

► This dissertation analyzes the Dungeness crab prices and quantities, which is conducted within three essays. The first essay studies the relationships among the West Coast…
(more)

Subjects/Keywords: Dungeness Crab; Cointegration Analysis; Directed Acyclic Graphs; Prequential Analysis; Insurance Premiums

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, C. (2015). Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155001

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, Chia-Lan. “Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab.” 2015. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/155001.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Chia-Lan. “Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab.” 2015. Web. 11 Jul 2020.

Vancouver:

Liu C. Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/155001.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu C. Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155001

Not specified: Masters Thesis or Doctoral Dissertation

13. Harutyunyan, Anna. Maximum flow in planar digraphs.

Degree: MS, Computer Science, 2012, Oregon State University

URL: http://hdl.handle.net/1957/35602

► Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation,…
(more)

Subjects/Keywords: Planar digraphs; Directed graphs

…that maximum ﬂow and minimum cut have been
inseparable in *directed* *graphs* but not in… …*directed* planar *graphs*. The algorithm ﬁnds the leftmost s-to-t residual path P , but,
instead of… …vertices u and v, we denote
the edge between them by uv. Despite ﬁnding ﬂows in *directed* *graphs*… …The model graph
has 44 vertices and 105 *directed* edges, with the dotted line representing… …given by solid edges and the dual by dotted edges. The dark
bold (*directed*) darts…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harutyunyan, A. (2012). Maximum flow in planar digraphs. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/35602

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

Harutyunyan, Anna. “Maximum flow in planar digraphs.” 2012. Masters Thesis, Oregon State University. Accessed July 11, 2020. http://hdl.handle.net/1957/35602.

MLA Handbook (7^{th} Edition):

Harutyunyan, Anna. “Maximum flow in planar digraphs.” 2012. Web. 11 Jul 2020.

Vancouver:

Harutyunyan A. Maximum flow in planar digraphs. [Internet] [Masters thesis]. Oregon State University; 2012. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1957/35602.

Council of Science Editors:

Harutyunyan A. Maximum flow in planar digraphs. [Masters Thesis]. Oregon State University; 2012. Available from: http://hdl.handle.net/1957/35602

University of Miami

14.
Ellzey, Brittney.
On Chromatic Quasisymmetric Functions of *Directed* * Graphs*.

Degree: PhD, Mathematics (Arts and Sciences), 2018, University of Miami

URL: https://scholarlyrepository.miami.edu/oa_dissertations/2091

► In 1912, Birkhoff introduced the chromatic polynomial of a graph, which counts the number of proper colorings of a graph. In 1995, Stanley introduced the…
(more)

Subjects/Keywords: symmetric function; graph coloring; chromatic polynomial; directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ellzey, B. (2018). On Chromatic Quasisymmetric Functions of Directed Graphs. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/2091

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

Ellzey, Brittney. “On Chromatic Quasisymmetric Functions of Directed Graphs.” 2018. Doctoral Dissertation, University of Miami. Accessed July 11, 2020. https://scholarlyrepository.miami.edu/oa_dissertations/2091.

MLA Handbook (7^{th} Edition):

Ellzey, Brittney. “On Chromatic Quasisymmetric Functions of Directed Graphs.” 2018. Web. 11 Jul 2020.

Vancouver:

Ellzey B. On Chromatic Quasisymmetric Functions of Directed Graphs. [Internet] [Doctoral dissertation]. University of Miami; 2018. [cited 2020 Jul 11]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2091.

Council of Science Editors:

Ellzey B. On Chromatic Quasisymmetric Functions of Directed Graphs. [Doctoral Dissertation]. University of Miami; 2018. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2091

University of Lethbridge

15. Khan, Soma Farin. Ranking components of scientific software using spectral methods .

Degree: 2015, University of Lethbridge

URL: http://hdl.handle.net/10133/3811

► In this thesis we explore the centrality rankings of functions in call *graphs* of scientific software using spectral method. Dependency Structure Matrix (DSM) is used…
(more)

Subjects/Keywords: call graphs; Dependency Structure Matrix; directed networks; scientific software; spectral method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khan, S. F. (2015). Ranking components of scientific software using spectral methods . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/3811

Not specified: Masters Thesis or Doctoral Dissertation

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

Khan, Soma Farin. “Ranking components of scientific software using spectral methods .” 2015. Thesis, University of Lethbridge. Accessed July 11, 2020. http://hdl.handle.net/10133/3811.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Khan, Soma Farin. “Ranking components of scientific software using spectral methods .” 2015. Web. 11 Jul 2020.

Vancouver:

Khan SF. Ranking components of scientific software using spectral methods . [Internet] [Thesis]. University of Lethbridge; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10133/3811.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khan SF. Ranking components of scientific software using spectral methods . [Thesis]. University of Lethbridge; 2015. Available from: http://hdl.handle.net/10133/3811

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

16. Duffy, Colleen M. Graded traces and irreducible representations of Aut(A(Gamma)) acting on graded A(Gamma) and A(Gamma)!.

Degree: PhD, Mathematics, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17304

►

In this work we will study the structure of algebras A(Gamma) associated to *directed*, layered *graphs*. The algebras for which we find a decomposition are…
(more)

Subjects/Keywords: Noncommutative algebras; Directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duffy, C. M. (2008). Graded traces and irreducible representations of Aut(A(Gamma)) acting on graded A(Gamma) and A(Gamma)!. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17304

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

Duffy, Colleen M. “Graded traces and irreducible representations of Aut(A(Gamma)) acting on graded A(Gamma) and A(Gamma)!.” 2008. Doctoral Dissertation, Rutgers University. Accessed July 11, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17304.

MLA Handbook (7^{th} Edition):

Duffy, Colleen M. “Graded traces and irreducible representations of Aut(A(Gamma)) acting on graded A(Gamma) and A(Gamma)!.” 2008. Web. 11 Jul 2020.

Vancouver:

Duffy CM. Graded traces and irreducible representations of Aut(A(Gamma)) acting on graded A(Gamma) and A(Gamma)!. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2020 Jul 11]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17304.

Council of Science Editors:

Duffy CM. Graded traces and irreducible representations of Aut(A(Gamma)) acting on graded A(Gamma) and A(Gamma)!. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17304

University of Toronto

17.
Pawliuk, Micheal Andrew.
Amenability and Unique Ergodicity of the Automorphism Groups of all Countable Homogeneous *Directed* * Graphs*.

Degree: PhD, 2015, University of Toronto

URL: http://hdl.handle.net/1807/71573

► We establish the amenability, unique ergodicity and nonamenability of various automorphism groups from Cherlin's list of countable homogeneous *directed* *graphs*. This marks a complete understanding…
(more)

Subjects/Keywords: Amenability; Automorphism Groups; Directed Graphs; Unique Ergodicity; 0405

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pawliuk, M. A. (2015). Amenability and Unique Ergodicity of the Automorphism Groups of all Countable Homogeneous Directed Graphs. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/71573

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

Pawliuk, Micheal Andrew. “Amenability and Unique Ergodicity of the Automorphism Groups of all Countable Homogeneous Directed Graphs.” 2015. Doctoral Dissertation, University of Toronto. Accessed July 11, 2020. http://hdl.handle.net/1807/71573.

MLA Handbook (7^{th} Edition):

Pawliuk, Micheal Andrew. “Amenability and Unique Ergodicity of the Automorphism Groups of all Countable Homogeneous Directed Graphs.” 2015. Web. 11 Jul 2020.

Vancouver:

Pawliuk MA. Amenability and Unique Ergodicity of the Automorphism Groups of all Countable Homogeneous Directed Graphs. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1807/71573.

Council of Science Editors:

Pawliuk MA. Amenability and Unique Ergodicity of the Automorphism Groups of all Countable Homogeneous Directed Graphs. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/71573

Virginia Tech

18. Misra, Supratik Kumar. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers.

Degree: MS, Electrical and Computer Engineering, 2012, Virginia Tech

URL: http://hdl.handle.net/10919/31153

► Continuous advances in VLSI technology have led to more complex digital designs and shrinking transistor sizes. Due to these developments, design verification and manufacturing test…
(more)

Subjects/Keywords: Directed Acyclic Graph; Partial Scan Design; Pattern Debugger; Implication Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Misra, S. K. (2012). Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31153

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

Misra, Supratik Kumar. “Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers.” 2012. Masters Thesis, Virginia Tech. Accessed July 11, 2020. http://hdl.handle.net/10919/31153.

MLA Handbook (7^{th} Edition):

Misra, Supratik Kumar. “Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers.” 2012. Web. 11 Jul 2020.

Vancouver:

Misra SK. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. [Internet] [Masters thesis]. Virginia Tech; 2012. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10919/31153.

Council of Science Editors:

Misra SK. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. [Masters Thesis]. Virginia Tech; 2012. Available from: http://hdl.handle.net/10919/31153

University of South Florida

19. Hall, Kristin. Flowgraph Models for Clustered Multistate Time to Event Data.

Degree: 2018, University of South Florida

URL: https://scholarcommons.usf.edu/etd/8119

► Healthcare systems have multistate processes. Such processes may be modeled using flowgraphs, which are *directed* *graphs*. Flowgraph models support a variety of transition time distributions,…
(more)

Subjects/Keywords: Directed graphs; Multilevel Models; Random Effects; Survival analysis; Biostatistics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hall, K. (2018). Flowgraph Models for Clustered Multistate Time to Event Data. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/8119

Not specified: Masters Thesis or Doctoral Dissertation

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

Hall, Kristin. “Flowgraph Models for Clustered Multistate Time to Event Data.” 2018. Thesis, University of South Florida. Accessed July 11, 2020. https://scholarcommons.usf.edu/etd/8119.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hall, Kristin. “Flowgraph Models for Clustered Multistate Time to Event Data.” 2018. Web. 11 Jul 2020.

Vancouver:

Hall K. Flowgraph Models for Clustered Multistate Time to Event Data. [Internet] [Thesis]. University of South Florida; 2018. [cited 2020 Jul 11]. Available from: https://scholarcommons.usf.edu/etd/8119.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hall K. Flowgraph Models for Clustered Multistate Time to Event Data. [Thesis]. University of South Florida; 2018. Available from: https://scholarcommons.usf.edu/etd/8119

Not specified: Masters Thesis or Doctoral Dissertation

University of Washington

20. Tadic, Tvrtko. Time-like graphical models.

Degree: PhD, 2015, University of Washington

URL: http://hdl.handle.net/1773/33200

► We study continuous processes indexed by a special family of *graphs*. Processes indexed by vertices of *graphs* are known as probabilistic graphical models. In 2011,…
(more)

Subjects/Keywords: graphical models; martingales indexed by directed sets; stochastic heat equation; Stochastic processes indexed by graphs; time-like graphs; Mathematics; mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tadic, T. (2015). Time-like graphical models. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/33200

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

Tadic, Tvrtko. “Time-like graphical models.” 2015. Doctoral Dissertation, University of Washington. Accessed July 11, 2020. http://hdl.handle.net/1773/33200.

MLA Handbook (7^{th} Edition):

Tadic, Tvrtko. “Time-like graphical models.” 2015. Web. 11 Jul 2020.

Vancouver:

Tadic T. Time-like graphical models. [Internet] [Doctoral dissertation]. University of Washington; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1773/33200.

Council of Science Editors:

Tadic T. Time-like graphical models. [Doctoral Dissertation]. University of Washington; 2015. Available from: http://hdl.handle.net/1773/33200

University of St Andrews

21.
Boore, Graeme C.
* Directed* graph iterated function systems.

Degree: PhD, 2011, University of St Andrews

URL: http://hdl.handle.net/10023/2109

► This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for *directed* graph iterated function systems…
(more)

Subjects/Keywords: 518; Fractal geometry; Iterated function systems; Exact Hausdorff measure of attractors; Directed graphs; Multifractal analysis; Qth packing moment; QA614.86B7; Fractals; Hausdorff measures; Directed graphs; Iterative methods (Mathematics)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boore, G. C. (2011). Directed graph iterated function systems. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/2109

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

Boore, Graeme C. “Directed graph iterated function systems.” 2011. Doctoral Dissertation, University of St Andrews. Accessed July 11, 2020. http://hdl.handle.net/10023/2109.

MLA Handbook (7^{th} Edition):

Boore, Graeme C. “Directed graph iterated function systems.” 2011. Web. 11 Jul 2020.

Vancouver:

Boore GC. Directed graph iterated function systems. [Internet] [Doctoral dissertation]. University of St Andrews; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10023/2109.

Council of Science Editors:

Boore GC. Directed graph iterated function systems. [Doctoral Dissertation]. University of St Andrews; 2011. Available from: http://hdl.handle.net/10023/2109

Ryerson University

22.
Mbaka Muzalal, Muhanda Stella.
Constraint Satisfaction Problems and Their Reduction to *Directed* * Graphs*.

Degree: 2012, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1847

► Constraint satisfaction problems present a general framework for studying a large class of algorithmic problems such as satisfaction of Boolean formulas, solving systems of equations…
(more)

Subjects/Keywords: Constraint programming (Computer science); Directed graphs; Computational complexity; Constraints (Artificial intelligence); Boolean algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mbaka Muzalal, M. S. (2012). Constraint Satisfaction Problems and Their Reduction to Directed Graphs. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1847

Not specified: Masters Thesis or Doctoral Dissertation

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

Mbaka Muzalal, Muhanda Stella. “Constraint Satisfaction Problems and Their Reduction to Directed Graphs.” 2012. Thesis, Ryerson University. Accessed July 11, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1847.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mbaka Muzalal, Muhanda Stella. “Constraint Satisfaction Problems and Their Reduction to Directed Graphs.” 2012. Web. 11 Jul 2020.

Vancouver:

Mbaka Muzalal MS. Constraint Satisfaction Problems and Their Reduction to Directed Graphs. [Internet] [Thesis]. Ryerson University; 2012. [cited 2020 Jul 11]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1847.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mbaka Muzalal MS. Constraint Satisfaction Problems and Their Reduction to Directed Graphs. [Thesis]. Ryerson University; 2012. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1847

Not specified: Masters Thesis or Doctoral Dissertation

University of Colorado

23. Sidrow, Evan. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.

Degree: MS, Applied Mathematics, 2018, University of Colorado

URL: https://scholar.colorado.edu/appm_gradetds/98

► Bayesian networks are widely considered as powerful tools for modeling risk assessment, uncertainty, and decision making. They have been extensively employed to develop decision…
(more)

Subjects/Keywords: Bayesian Networks; Partially Ordered Sets; Perfect Simulation; Directed Acyclic Graphs; Applied Statistics; Probability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sidrow, E. (2018). Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/98

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

Sidrow, Evan. “Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.” 2018. Masters Thesis, University of Colorado. Accessed July 11, 2020. https://scholar.colorado.edu/appm_gradetds/98.

MLA Handbook (7^{th} Edition):

Sidrow, Evan. “Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.” 2018. Web. 11 Jul 2020.

Vancouver:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2020 Jul 11]. Available from: https://scholar.colorado.edu/appm_gradetds/98.

Council of Science Editors:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/98

Columbia University

24. Bauer, Daniel. Grammar-Based Semantic Parsing Into Graph Representations.

Degree: 2017, Columbia University

URL: https://doi.org/10.7916/D8JH3ZRR

► *Directed* *graphs* are an intuitive and versatile representation of natural language meaning because they can capture relationships between instances of events and entities, including cases…
(more)

Subjects/Keywords: Computer science; Directed graphs; Semantics – Data processing; Natural language processing (Computer science)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bauer, D. (2017). Grammar-Based Semantic Parsing Into Graph Representations. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8JH3ZRR

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

Bauer, Daniel. “Grammar-Based Semantic Parsing Into Graph Representations.” 2017. Doctoral Dissertation, Columbia University. Accessed July 11, 2020. https://doi.org/10.7916/D8JH3ZRR.

MLA Handbook (7^{th} Edition):

Bauer, Daniel. “Grammar-Based Semantic Parsing Into Graph Representations.” 2017. Web. 11 Jul 2020.

Vancouver:

Bauer D. Grammar-Based Semantic Parsing Into Graph Representations. [Internet] [Doctoral dissertation]. Columbia University; 2017. [cited 2020 Jul 11]. Available from: https://doi.org/10.7916/D8JH3ZRR.

Council of Science Editors:

Bauer D. Grammar-Based Semantic Parsing Into Graph Representations. [Doctoral Dissertation]. Columbia University; 2017. Available from: https://doi.org/10.7916/D8JH3ZRR

University of New South Wales

25. Naman, Aous Thabit. JPEG2000-based scalable interactive video (JSIV).

Degree: Electrical Engineering & Telecommunications, 2010, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/50884 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9778/SOURCE02?view=true

► Video is considered one of the main applications of modern day's Internet. Despite its importance, the interactivity available from current implementations is limited to pause…
(more)

Subjects/Keywords: Image Coding; Video Signal Processing; Teleconferencing; Image Communication; Weighted Acyclic Directed Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naman, A. T. (2010). JPEG2000-based scalable interactive video (JSIV). (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/50884 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9778/SOURCE02?view=true

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

Naman, Aous Thabit. “JPEG2000-based scalable interactive video (JSIV).” 2010. Doctoral Dissertation, University of New South Wales. Accessed July 11, 2020. http://handle.unsw.edu.au/1959.4/50884 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9778/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Naman, Aous Thabit. “JPEG2000-based scalable interactive video (JSIV).” 2010. Web. 11 Jul 2020.

Vancouver:

Naman AT. JPEG2000-based scalable interactive video (JSIV). [Internet] [Doctoral dissertation]. University of New South Wales; 2010. [cited 2020 Jul 11]. Available from: http://handle.unsw.edu.au/1959.4/50884 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9778/SOURCE02?view=true.

Council of Science Editors:

Naman AT. JPEG2000-based scalable interactive video (JSIV). [Doctoral Dissertation]. University of New South Wales; 2010. Available from: http://handle.unsw.edu.au/1959.4/50884 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9778/SOURCE02?view=true

Virginia Tech

26.
Hartman, Gregory Neil.
* Graphs* and Noncommutative Koszul Algebras.

Degree: PhD, Mathematics, 2002, Virginia Tech

URL: http://hdl.handle.net/10919/27156

► A new connection between combinatorics and noncommutative algebra is established by relating a certain class of *directed* *graphs* to noncommutative Koszul algebras. The *directed* *graphs*…
(more)

Subjects/Keywords: representations; quivers; Koszul algebras; directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hartman, G. N. (2002). Graphs and Noncommutative Koszul Algebras. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/27156

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

Hartman, Gregory Neil. “Graphs and Noncommutative Koszul Algebras.” 2002. Doctoral Dissertation, Virginia Tech. Accessed July 11, 2020. http://hdl.handle.net/10919/27156.

MLA Handbook (7^{th} Edition):

Hartman, Gregory Neil. “Graphs and Noncommutative Koszul Algebras.” 2002. Web. 11 Jul 2020.

Vancouver:

Hartman GN. Graphs and Noncommutative Koszul Algebras. [Internet] [Doctoral dissertation]. Virginia Tech; 2002. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10919/27156.

Council of Science Editors:

Hartman GN. Graphs and Noncommutative Koszul Algebras. [Doctoral Dissertation]. Virginia Tech; 2002. Available from: http://hdl.handle.net/10919/27156

KTH

27. Aspegren, Villiam. CluStic – Automatic graph drawing with clusters.

Degree: Computer Science and Communication (CSC), 2015, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

►

Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been… (more)

Subjects/Keywords: Graph drawing; Automatic graph layout; Directed graphs; Sugiyama; Cluster; Clusters; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aspegren, V. (2015). CluStic – Automatic graph drawing with clusters. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

Not specified: Masters Thesis or Doctoral Dissertation

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

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Thesis, KTH. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Web. 11 Jul 2020.

Vancouver:

Aspegren V. CluStic – Automatic graph drawing with clusters. [Internet] [Thesis]. KTH; 2015. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aspegren V. CluStic – Automatic graph drawing with clusters. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

28. Olmez, Oktay. On highly regular digraphs.

Degree: 2012, Iowa State University

URL: https://lib.dr.iastate.edu/etd/12626

► We explore *directed* strongly regular *graphs* (DSRGs) and their connections to association schemes and finite incidence structures. More specically, we study flags and antiflags of…
(more)

Subjects/Keywords: Association Schemes; Directed strongly regular graphs; Finite incidence structures; Partial geometric designs; Transitive digraphs; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Olmez, O. (2012). On highly regular digraphs. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/12626

Not specified: Masters Thesis or Doctoral Dissertation

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

Olmez, Oktay. “On highly regular digraphs.” 2012. Thesis, Iowa State University. Accessed July 11, 2020. https://lib.dr.iastate.edu/etd/12626.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Olmez, Oktay. “On highly regular digraphs.” 2012. Web. 11 Jul 2020.

Vancouver:

Olmez O. On highly regular digraphs. [Internet] [Thesis]. Iowa State University; 2012. [cited 2020 Jul 11]. Available from: https://lib.dr.iastate.edu/etd/12626.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Olmez O. On highly regular digraphs. [Thesis]. Iowa State University; 2012. Available from: https://lib.dr.iastate.edu/etd/12626

Not specified: Masters Thesis or Doctoral Dissertation

Simon Fraser University

29.
Bauslaugh, Bruce Lloyd.
Homomorphisms of infinite *directed* * graphs*.

Degree: 1994, Simon Fraser University

URL: http://summit.sfu.ca/item/6543

Subjects/Keywords: Directed graphs.; Homomorphisms (Mathematics); Graph theory.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bauslaugh, B. L. (1994). Homomorphisms of infinite directed graphs. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6543

Not specified: Masters Thesis or Doctoral Dissertation

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

Bauslaugh, Bruce Lloyd. “Homomorphisms of infinite directed graphs.” 1994. Thesis, Simon Fraser University. Accessed July 11, 2020. http://summit.sfu.ca/item/6543.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bauslaugh, Bruce Lloyd. “Homomorphisms of infinite directed graphs.” 1994. Web. 11 Jul 2020.

Vancouver:

Bauslaugh BL. Homomorphisms of infinite directed graphs. [Internet] [Thesis]. Simon Fraser University; 1994. [cited 2020 Jul 11]. Available from: http://summit.sfu.ca/item/6543.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bauslaugh BL. Homomorphisms of infinite directed graphs. [Thesis]. Simon Fraser University; 1994. Available from: http://summit.sfu.ca/item/6543

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

30.
Chong, Hogun.
A causal model of linkages among strategy, structure, and performance using *directed* acyclic *graphs*: A manufacturing subset of Fortune 500 industrials 1990-1998.

Degree: 2004, Texas A&M University

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

► This research explored the causal relationships among strategies, corporate structure, and performance of the largest U.S. non-financial firms using *Directed* Acyclic *Graphs* (DAGs). Corporate strategies…
(more)

Subjects/Keywords: directed graphs; strategy; organizational structure; performance

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chong, H. (2004). A causal model of linkages among strategy, structure, and performance using directed acyclic graphs: A manufacturing subset of Fortune 500 industrials 1990-1998. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/58

Not specified: Masters Thesis or Doctoral Dissertation

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

Chong, Hogun. “A causal model of linkages among strategy, structure, and performance using directed acyclic graphs: A manufacturing subset of Fortune 500 industrials 1990-1998.” 2004. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/58.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chong, Hogun. “A causal model of linkages among strategy, structure, and performance using directed acyclic graphs: A manufacturing subset of Fortune 500 industrials 1990-1998.” 2004. Web. 11 Jul 2020.

Vancouver:

Chong H. A causal model of linkages among strategy, structure, and performance using directed acyclic graphs: A manufacturing subset of Fortune 500 industrials 1990-1998. [Internet] [Thesis]. Texas A&M University; 2004. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/58.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chong H. A causal model of linkages among strategy, structure, and performance using directed acyclic graphs: A manufacturing subset of Fortune 500 industrials 1990-1998. [Thesis]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/58

Not specified: Masters Thesis or Doctoral Dissertation