subject:(Directed graphs)

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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

Vancouver:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Internet] [Thesis]. Iowa State University; 2020. [cited 2021 Mar 06]. 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

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

2. 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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

Vancouver:

Christopher J. Induced path number for the complementary prism of a grid graph. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2021 Mar 06]. 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

3. 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 Cite « Share

❌

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

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

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

Note: this citation may be lacking information needed for this citation format:
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. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

University of Victoria

4. 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 Cite « Share

❌

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

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

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

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

MLA Handbook (7^th Edition):

Heard, Scott. “Kernels and quasi-kernels in digraphs.” 2008. Web. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

Michigan State University

5. 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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

Vancouver:

Lee C. On the domination number of a digraph. [Internet] [Doctoral dissertation]. Michigan State University; 1994. [cited 2021 Mar 06]. 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

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 Cite « Share

❌

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 March 06, 2021. http://hdl.handle.net/1808/19005.

MLA Handbook (7^th Edition):

Adams, Kevin Daniel. “On Kernels, β-graphs, and β-graph Sequences of Digraphs.” 2015. Web. 06 Mar 2021.

Vancouver:

Adams KD. On Kernels, β-graphs, and β-graph Sequences of Digraphs. [Internet] [Masters thesis]. University of Kansas; 2015. [cited 2021 Mar 06]. 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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

Vancouver:

Van der Linde JJ. Enlarging directed graphs to ensure all nodes are contained . [Internet] [Masters thesis]. University of South Africa; 2015. [cited 2021 Mar 06]. 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 Waterloo

8. 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 Cite « Share

❌

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

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

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

Note: this citation may be lacking information needed for this citation format:
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. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

University of Missouri – Columbia

9. Granger, Valerie, 1985-. GIT-equivalence and semi-stable subcategories of quiver representations.

Degree: 2016, University of Missouri – Columbia

URL: https://doi.org/10.32469/10355/56527

► The main investigation in this thesis is to determine when two weights give rise to the same semi-stable subcategory in the case of representations of… (more)

Subjects/Keywords: Directed graphs; Representations of graphs; Paths and cycles (Graph theory)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Granger, Valerie, 1. (2016). GIT-equivalence and semi-stable subcategories of quiver representations. (Thesis). University of Missouri – Columbia. Retrieved from https://doi.org/10.32469/10355/56527

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

Granger, Valerie, 1985-. “GIT-equivalence and semi-stable subcategories of quiver representations.” 2016. Thesis, University of Missouri – Columbia. Accessed March 06, 2021. https://doi.org/10.32469/10355/56527.

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

MLA Handbook (7^th Edition):

Granger, Valerie, 1985-. “GIT-equivalence and semi-stable subcategories of quiver representations.” 2016. Web. 06 Mar 2021.

Vancouver:

Granger, Valerie 1. GIT-equivalence and semi-stable subcategories of quiver representations. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2021 Mar 06]. Available from: https://doi.org/10.32469/10355/56527.

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

Council of Science Editors:

Granger, Valerie 1. GIT-equivalence and semi-stable subcategories of quiver representations. [Thesis]. University of Missouri – Columbia; 2016. Available from: https://doi.org/10.32469/10355/56527

Note: this citation may be lacking information needed for this citation format:
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)

▼ Relational datasets are often modeled as an unsigned, undirected graph due the nice properties of the resulting graph Laplacian, but information is lost if certain attributes of the graph are not represented. This thesis presents two generalizations of Algebraic Multigrid (AMG) solvers with graph Laplacian systems for different graph types: applying Gremban’s expansion to extend unsigned graph Laplacian solvers to signed graph Laplacian systems and generalizing techniques in Lean Algebraic Multigrid (LAMG) to a new multigrid solver for unsigned, directed graph Laplacian systems. Signed graphs extend the traditional notion of connections and disconnections to in- clude both favorable and adverse relationships, such as friend-enemy social networks or social networks with “likes” and “dislikes.” Gremban’s expansion is used to transform the signed graph Laplacian into an unsigned graph Laplacian with twice the number of unknowns. By using Gremban’s expansion, we extend current unsigned graph Laplacian solvers’ to signed graph Laplacians. This thesis analyzes the numerical stability and applicability of Grem- ban’s expansion and proves that the error of the solution of the original linear system can be tightly bounded by the error of the expanded system. In directed graphs, some subset of relationships are not reciprocal, such as hyperlink graphs, biological neural networks, and electrical power grids. A new algebraic multigrid algorithm, Nonsymmetric Lean Algebraic Multigrid (NS-LAMG), is proposed, which uses ideas from Lean Algebraic Multigrid, nonsymmetric Smoothed Aggregation, and multigrid solvers for Markov chain stationary distribution systems. Low-degree elimination, intro- duced in Lean Algebraic Multigrid for undirected graphs, is redefined for directed graphs. A semi-adaptive multigrid solver, inspired by low-degree elimination, is instrumented in the setup phase, which can be adapted for Markov chain stationary distributions systems. Nu- merical results shows that NS-LAMG out performs GMRES(k) for real-world, directed graph Laplacian linear systems. Both generalizations enable more choices in modeling decisions for graph Laplacian systems. Due the successfulness of NS-LAMG and other various nonsymmetric AMG (NS-AMG) solvers, a further study of theoretical convergence properties are discussed in this thesis. In particular, a necessary condition known as “weak approximation property”, and a sufficient one, referred to as “strong approximation property” as well as the “super strong approx- imation property” are generalized to nonsymmetric matrices and the various relationships between the approximation properties are proved for the nonsymmetric case. In NS-AMG, if P ̸= R the two-grid error propagation operator for the coarse-grid correction is an oblique projection with respect to any reasonable norm, which can cause the error to increase. A main focal point of this paper is a discussion on the conditions in which the error propagation operator is bounded, as the stability of the error… Advisors/Committee Members: Tom Manteuffel, Geoff Sanders, John Ruge, Christian Ketelsen, Francois Meyer.

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

Record Details Similar Records Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

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 2021 Mar 06]. 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

11. 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…

4 more images…

Record Details Similar Records Cite « Share

❌

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 March 06, 2021. http://hdl.handle.net/1957/35602.

MLA Handbook (7^th Edition):

Harutyunyan, Anna. “Maximum flow in planar digraphs.” 2012. Web. 06 Mar 2021.

Vancouver:

Harutyunyan A. Maximum flow in planar digraphs. [Internet] [Masters thesis]. Oregon State University; 2012. [cited 2021 Mar 06]. 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

Texas A&M University

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

Degree: PhD, Agricultural Economics, 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)

▼ 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 Dungeness crab landing prices and quantities using cointegration analysis and directed acyclic graphs. The forecast tests are added to determine the number of cointegrating rank. Directed acyclic graphs are estimated using different algorithms for comparison and are used to discover the causality of the crab markets. The four states’ crab prices are strongly connected contemporaneously. The price-quantity relationships exist among the California, Oregon and Washington markets because of their tri-state Dungeness crab project. The Alaska quantity does not affect and is not affected by the other prices and quantities possibly due to stock collapse in some areas of Alaska. The second essay uses the three models to explore the prequential relationships among the West Coast states’ Dungeness crab fisheries. A random walk and the 1-lag VAR outperform the 2-lag VAR. Most series in the random walk and the l-lag VAR are well-calibrated. For the Dungeness crab quantities, the random walk does slightly better than the 1-lag VAR; the 1-lag VAR dominates the random walk for the crab prices. The results are consistent with the literature on the Dungeness crab movement patterns. Information about the crab fishery management decision making are provided in this essay. The third essay estimates the Dungeness crab yield insurance premiums and the probabilities of the indemnities being paid to the crab fishermen in each western coastal state using cointegration analysis, goodness-of-fit tests, and Monte Carlo simulation. The lognormal distribution provides the best-fit for the Alaska crab yield and the logistic for the Oregon, Washington, and California yields, respectively. The log-logistic is found to be the best-fit for each state’s prices. At 50%, 60%, 70%, and 80% yield coverage levels, Alaska has the highest insurance premiums and the highest probability of paying the indemnities, followed by California, and then Washington or Oregon. Advisors/Committee Members: Leatham, David J. (advisor), Penson Jr, John B. (committee member), Richardson, James W. (committee member), Bessler, David (committee member).

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

Record Details Similar Records Cite « Share

❌

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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155001

Chicago Manual of Style (16^th Edition):

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

MLA Handbook (7^th Edition):

Liu, Chia-Lan. “Price-Quantity Dynamics, Prequential Analysis, and Yield Insurance Premium Estimation of Dungeness Crab.” 2015. Web. 06 Mar 2021.

Vancouver:

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

Council of Science Editors:

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

Texas A&M University

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

Degree: MS, Agricultural Economics, 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 Cite « Share

❌

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. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155624

Chicago Manual of Style (16^th Edition):

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

MLA Handbook (7^th Edition):

Perez Arguelles, Maria P. “Analyzing Structural Changes and Trade Impacts in the Tomato Industry.” 2015. Web. 06 Mar 2021.

Vancouver:

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

Council of Science Editors:

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

University of Delaware

14. Kodess, Aleksandr. Properties of some algebraically defined digraphs.

Degree: PhD, University of Delaware, Department of Mathematics, 2014, University of Delaware

URL: http://udspace.udel.edu/handle/19716/16756

This thesis is concerned with the study of a family of digraphs defined by systems of polynomial equations over finite fields. We explore the connectivity and diameter of some special classes of these digraphs, along with the structure of their isomorphism classes. Advisors/Committee Members: Lazebnik, Felix.

Subjects/Keywords: Directed graphs.; Polynomials.; Finite fields (Algebra); Isomorphisms (Mathematics)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kodess, A. (2014). Properties of some algebraically defined digraphs. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/16756

Chicago Manual of Style (16^th Edition):

Kodess, Aleksandr. “Properties of some algebraically defined digraphs.” 2014. Doctoral Dissertation, University of Delaware. Accessed March 06, 2021. http://udspace.udel.edu/handle/19716/16756.

MLA Handbook (7^th Edition):

Kodess, Aleksandr. “Properties of some algebraically defined digraphs.” 2014. Web. 06 Mar 2021.

Vancouver:

Kodess A. Properties of some algebraically defined digraphs. [Internet] [Doctoral dissertation]. University of Delaware; 2014. [cited 2021 Mar 06]. Available from: http://udspace.udel.edu/handle/19716/16756.

Council of Science Editors:

Kodess A. Properties of some algebraically defined digraphs. [Doctoral Dissertation]. University of Delaware; 2014. Available from: http://udspace.udel.edu/handle/19716/16756

University of Miami

15. 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)

▼ 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 chromatic symmetric function of a graph, a symmetric function analog of the chromatic polynomial of a graph. The Stanley-Stembridge e-positivity conjecture is a longstanding conjecture that states that the chromatic symmetric function of a certain class of graphs has nonnegative coefficients when expanded in the elementary symmetric function basis. In 2012, Shareshian and Wachs introduced the chromatic quasisymmetric function of a labeled graph, a refinement of the chromatic symmetric function. Shareshian and Wachs described their own e-positivity conjecture for chromatic quasisymmetric functions which generalizes the Stanley-Stembridge conjecture. There is ample support for these e-positivity conjectures, including weaker positivity results in other symmetric function bases. In the first part of this thesis, we extend the work of Shareshian and Wachs from labeled graphs to a wider class of graphs, namely directed graphs. We introduce the notion of chromatic quasisymmetric function of a directed graph. For acyclic digraphs, our definition is equivalent to that of Shareshian and Wachs. We give an expansion in terms of Gessel’s fundamental quasisymmetric function basis for the chromatic quasisymmetric function of all digraphs, which shows that all the coefficients are nonnegative. We use this expansion to derive a power sum symmetric function basis expansion with positive coefficients for the chromatic quasisymmetric function of all digraphs whose chromatic quasisymmetric function has symmetric function coefficients. We describe a class of digraphs, which we call circular indifference digraphs, and show that their chromatic quasisymmetric functions are symmetric. These circular indifference digraphs include the directed cycle, for which we provide an e-basis generating function formula that shows that its chromatic quasisymmetric function is e-positive. We generalize the e-positivity conjecture of Shareshian and Wachs to the class of circular indifference digraphs. Our positivity results and computer calculations provide evidence for this conjecture. A Smirnov word is a word over the positive integers such that consecutive letters are distinct. The descent enumerator of Smirnov words is equivalent to the chromatic quasisymmetric function of the path graph. Shareshian and Wachs found a nice ebasis generating function expansion of this descent enumerator that shows that it is e-positive. Specializing this result gave them a q-analog of Euler’s exponential generating function of the classical Eulerian polynomials. In the second part of this thesis, we consider descent enumerators for restricted Smirnov words, where we put restrictions on the relationship between the first and last letter. We also consider cyclic descent enumerators for Smirnov words. Our work on these descent enumerators refines our work on the chromatic quasisymmetric function of the directed cycle. We… Advisors/Committee Members: Michelle L. Wachs, Richard P. Stanley, Bruno Benedetti, Rafael Nepomechie.

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

Record Details Similar Records Cite « Share

❌

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 March 06, 2021. https://scholarlyrepository.miami.edu/oa_dissertations/2091.

MLA Handbook (7^th Edition):

Ellzey, Brittney. “On Chromatic Quasisymmetric Functions of Directed Graphs.” 2018. Web. 06 Mar 2021.

Vancouver:

Ellzey B. On Chromatic Quasisymmetric Functions of Directed Graphs. [Internet] [Doctoral dissertation]. University of Miami; 2018. [cited 2021 Mar 06]. 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

16. Aghili, Miremad. Manifoldlike Causal Sets.

Degree: PhD, Physics and Astronomy, 2019, University of Mississippi

URL: https://egrove.olemiss.edu/etd/1529

► The content of this dissertation is written in a way to answer the important question of manifold likeness of causal sets. This problem has importance… (more)

Subjects/Keywords: Causal Sets; Directed Graphs; Manifold; Partial Order; Quantum Gravity; Physics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Aghili, M. (2019). Manifoldlike Causal Sets. (Doctoral Dissertation). University of Mississippi. Retrieved from https://egrove.olemiss.edu/etd/1529

Chicago Manual of Style (16^th Edition):

Aghili, Miremad. “Manifoldlike Causal Sets.” 2019. Doctoral Dissertation, University of Mississippi. Accessed March 06, 2021. https://egrove.olemiss.edu/etd/1529.

MLA Handbook (7^th Edition):

Aghili, Miremad. “Manifoldlike Causal Sets.” 2019. Web. 06 Mar 2021.

Vancouver:

Aghili M. Manifoldlike Causal Sets. [Internet] [Doctoral dissertation]. University of Mississippi; 2019. [cited 2021 Mar 06]. Available from: https://egrove.olemiss.edu/etd/1529.

Council of Science Editors:

Aghili M. Manifoldlike Causal Sets. [Doctoral Dissertation]. University of Mississippi; 2019. Available from: https://egrove.olemiss.edu/etd/1529

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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

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 2021 Mar 06]. 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

University of South Florida

18. 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 Cite « Share

❌

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

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

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

Note: this citation may be lacking information needed for this citation format:
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. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

University of Lethbridge

19. 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 Cite « Share

❌

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

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

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

Note: this citation may be lacking information needed for this citation format:
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. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

Virginia Tech

20. 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)

▼ 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 have gained more importance and 70 % of the design expenditure in on validation processes. Electronic Design Automation (EDA) tools play a huge role in the validation process with various verification and test tools. Their efficiency have a high impact in saving time and money in this competitive market. Direct Acyclic Graphs (DAGs) are the backbone for most of the EDA tools. DAG is the most efficient data structure to store circuit information and also have efficient backt traversing structure which help in developing reasoning/ debugging tools. In this thesis, we focus on two such EDA tools using graphs as their underlying structure for circuit information storage • Scan pattern Debugger for Partial Scan Designs • Circuit SAT Bounded Model Checkers We developed a complete Interactive Scan Pattern Debugger Suite currently being used in the industry for next generation microprocessor design. The back end is an implication graph based sequential logic simulator which creates a Debug Implication Graph during the logic simulation of the failing patterns. An efficient node traversal mechanism across time frames, in the DIG, is used to perform the root-cause analysis for the failing scan-cells. In addition, the debugger provides visibility into the circuit internals to understand and fix the root-cause. We integrated the proposed technique into the scan ATPG flow for industrial microprocessor designs. We were able to resolve the First Silicon logical pattern failures within hours, which would have otherwise taken a few days of manual effort for root-causing the failure, understanding the root-cause and fixing it. For our circuit SAT implementation, we replace the internal implication graph used by the SAT solver with our debug implication graph (DIG). There is a high amount of circuit unrolling in circuit SAT/ BMC (Bounded Model Checking) problems which creates copies of the same combinational blocks in multiple time frames. This allows us to use the repetitive circuit structure and club it with the CNF database in the SAT solver. We propose a new data structure to store data in a circuit SAT solver which results up to 90% reduction in number of nodes. Advisors/Committee Members: Hsiao, Michael S. (committeechair), Shukla, Sandeep K. (committee member), Abbott, A. Lynn (committee member).

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

Record Details Similar Records Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

Vancouver:

Misra SK. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. [Internet] [Masters thesis]. Virginia Tech; 2012. [cited 2021 Mar 06]. 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

Rutgers University

21. 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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

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 2021 Mar 06]. 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 Washington

22. 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 Cite « Share

❌

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 March 06, 2021. http://hdl.handle.net/1773/33200.

MLA Handbook (7^th Edition):

Tadic, Tvrtko. “Time-like graphical models.” 2015. Web. 06 Mar 2021.

Vancouver:

Tadic T. Time-like graphical models. [Internet] [Doctoral dissertation]. University of Washington; 2015. [cited 2021 Mar 06]. 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

Ryerson University

23. 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 Cite « Share

❌

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

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

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

Note: this citation may be lacking information needed for this citation format:
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. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

24. Sambinelli, Maycon, 1988-. Partition problems in graphs and digraphs : Problemas de partição em grafos e digrafos: Problemas de partição em grafos e digrafos.

Degree: 2018, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331853

► Abstract: Let (D) be a digraph and (k) be a positive integer. A \emph{path partition} (𝓟) is a collection of paths in (D) such that… (more)

▼ Abstract: Let (D) be a digraph and (k) be a positive integer. A \emph{path partition} (𝓟) is a collection of paths in (D) such that ({V(P) \: P ∈ 𝓟}) is a partition of (V(D)). The \emph{(k)-norm} of (𝓟), denoted by~(|𝓟|_k), is (∑_{P ∈ 𝓟} \min{|V(P)|, k}). A \emph{partial (k)-coloring} (𝓒) of (D) is a packing of (V(D)) such that (|𝓒| ≤ k) and each (C ∈ 𝓒) is a stable set. Let (π_k(D) = \min {|𝓟|_k \: 𝓟) is a path partition of (D}), (V(𝓒) = \cup_{C ∈ 𝓒} C), and (α_k(D) = \max {|V(𝓒)| \: 𝓒) is a partial (k)-coloring of (D}). Linial (1981) conjectured that (π_k(D) ≤ α_k(D)) for every digraph (D). We verify this conjecture for spine digraphs and digraphs whose underlying graph is series-parallel. A partial (k)-coloring~(𝓒) is \emph{orthogonal} to a path partition (𝓟) if every path (P ∈ 𝓟) meets (\min {|V(P)|, k}) stable sets in (𝓒). Berge (1982) conjectured that if (𝓟) is a path partition such that (|𝓟|_k = π_k(D)), then there exists a partial (k)-coloring orthogonal to (𝓟). We verify Berge's conjecture for locally in-semicomplete digraphs and for path partitions containing only two paths. A coloring (𝓒) is a partition of (V(D)) where each (C ∈ 𝓒) is a stable set of (D). The \emph{(k)-norm} of~(𝓒), denoted by (|𝓒|_k), is (∑_{C ∈ 𝓒} \min{|C|, k}). A \emph{path (k)-pack} (𝓟) is a collection of paths such that ({V(P) \: P ∈ 𝓟}) is a packing of (V(D)) and (|𝓟| ≤ k). Let (V(𝓟) = \cup_{P ∈ 𝓟} V(P)). We say that (𝓟) is \emph{maximum} if (|V(𝓟)| ≥ |V(𝓟')|) for every path (k)-pack (𝓟') of (D). A coloring~(𝓒) is \emph{orthogonal} to a path (k)-pack (𝓟) if every color class (C ∈ 𝓒) meets (\min {|C|, k}) paths in~(𝓟). Aharoni, Hartman, and Hoffman (1985) conjectured that if~(𝓟) is a maximum path (k)-pack, then there exists a coloring orthogonal to (𝓟). We verify this conjecture for locally in-semicomplete digraphs. Given a set of vertices (S \subseteq V(D)), we say that (𝓟) is an \emph{(S)-path partition} of (D) if (𝓟) is a path partition of (D) such that (|V(P) \cap S| = 1) for every (P ∈ 𝓟). We say that (D) satisfies the \emph{(α)-property} if there exists an (S)-path partition for every maximum stable set (S) of (D), and we say that (D) is \emph{(α)-diperfect} if every induced subdigraph of (D) satisfies the (α)-property. A digraph (C) is an \emph{anti-directed odd cycle} if (i) the underlying graph of (C) is a cycle (x_1x₂ ∙s x_{2k + 1}x₁), where… Advisors/Committee Members: UNIVERSIDADE ESTADUAL DE CAMPINAS (CRUESP), Lee, Orlando, 1969- (advisor), Universidade Estadual de Campinas. Instituto de Computação (institution), Programa de Pós-Graduação em Ciência da Computação (nameofprogram), Mota, Guilherme Oliveira (committee member), Meidanis, João (committee member), Martin, Daniel Morgato (committee member), Souza, Simone Dantas de (committee member).

Subjects/Keywords: Análise combinatória; Teoria dos grafos; Grafos orientados; Combinatorial analysis; Graph theory; Directed graphs

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sambinelli, Maycon, 1. (2018). Partition problems in graphs and digraphs : Problemas de partição em grafos e digrafos: Problemas de partição em grafos e digrafos. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/331853

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

Sambinelli, Maycon, 1988-. “Partition problems in graphs and digraphs : Problemas de partição em grafos e digrafos: Problemas de partição em grafos e digrafos.” 2018. Thesis, Universidade Estadual de Campinas. Accessed March 06, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/331853.

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

MLA Handbook (7^th Edition):

Sambinelli, Maycon, 1988-. “Partition problems in graphs and digraphs : Problemas de partição em grafos e digrafos: Problemas de partição em grafos e digrafos.” 2018. Web. 06 Mar 2021.

Vancouver:

Sambinelli, Maycon 1. Partition problems in graphs and digraphs : Problemas de partição em grafos e digrafos: Problemas de partição em grafos e digrafos. [Internet] [Thesis]. Universidade Estadual de Campinas; 2018. [cited 2021 Mar 06]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331853.

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

Council of Science Editors:

Sambinelli, Maycon 1. Partition problems in graphs and digraphs : Problemas de partição em grafos e digrafos: Problemas de partição em grafos e digrafos. [Thesis]. Universidade Estadual de Campinas; 2018. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331853

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

Texas A&M University

25. 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: PhD, Agricultural Economics, 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)

▼ 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 and structure have been analyzed as major variables to influence corporate performance in management and organizational studies. However, their causal relationships in terms of which variables are leaders and followers, as well as the choices of variables to configure them, are controversial. Finding of causal relationships among strategic variables, structural variables, and corporate performance is beneficial to researchers as well as corporate mangers. It provides guidance to researchers how to build a model in order to measure influences from one variable to the other, lowering the risk of drawing spurious conclusions. It also provides managers a prospect of how certain important variables would change by making a certain strategic decision. Literatures from agency theory, transactional cost economics, and traditional strategic management perspective are used to suggest variables essential to analyze corporate performance. This study includes size and multi-organizational ownership hierarchy as variables to configure corporate structure. The variables to configure corporate strategies are unrelated and related diversification, ownership by institutional investors, debt, investment in R&D, and investment in advertisement. The study finds that most of the variables classified as corporate strategy and corporate structure variables are either direct or indirect causes of corporate accounting performance. Generally, results supports the relational model: corporate structure® corporate strategy® corporate performance. Ownership hierarchy structure, unrelated diversification, advertising expenses, and R&D intensity have direct causal influences on corporate accounting performance. Size and related diversification affected corporate accounting performance indirectly, both through ownership hierarchy structure. Theoretical causal relationships from agency theory are less supported than those from transaction cost economics and traditional strategic management perspective. Further my study suggests that, in general, good corporate performance in 1990s was mainly achieved by internal expansion through investment in R&D and advertisement, rather than external expansion of firms through unrelated diversification, related diversification, and expansion of ownership hierarchy. Advisors/Committee Members: Bessler, David A. (advisor), Zey, Mary (committee member), Love, H. Alan (committee member), Leatham, David J. (committee member), Cannella, Albert A., Jr. (committee member).

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

Record Details Similar Records Cite « Share

❌

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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/58

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. Doctoral Dissertation, Texas A&M University. Accessed March 06, 2021. http://hdl.handle.net/1969.1/58.

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. 06 Mar 2021.

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] [Doctoral dissertation]. Texas A&M University; 2004. [cited 2021 Mar 06]. Available from: http://hdl.handle.net/1969.1/58.

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. [Doctoral Dissertation]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/58

Freie Universität Berlin

26. Rüdrich, Stefan. Cluster-Zerlegung gerichteter Netzwerke mit Hilfe von Zufallsbewegungen.

Degree: 2020, Freie Universität Berlin

URL: http://dx.doi.org/10.17169/refubium-27073

► Ein häufig wiederkehrendes Problem bei der Arbeit mit großen Systemen unterschiedlicher Natur, etwa zellularen, elektrischen oder sozialen Netzwerken, ist die Erkennung funktionaler Untereinheiten, die eine… (more)

▼ Ein häufig wiederkehrendes Problem bei der Arbeit mit großen Systemen unterschiedlicher Natur, etwa zellularen, elektrischen oder sozialen Netzwerken, ist die Erkennung funktionaler Untereinheiten, die eine hohe Eigenständigkeit vom Rest des Systems auszeichnet. Dazu bietet es sich an, das zu untersuchende System als Graphen zu modellieren und diesen mittels Clusteranalyse in Teile zu zerlegen, die zueinander wenige Verbindungen aufweisen, relativ zur Kantendichte innerhalb der Cluster. Ein bekannter Ansatz dazu basiert auf erinnerungslosen Zufallsprozessen, die sich mit jedem Zeitschritt von einer Ecke entlang einer anliegenden Kante zu einer zufällig gewählten benachbarten Ecke fortbewegen. Die Motivation hinter diesem Ansatz ist die Vorstellung, dass eine Zerlegung der Eckenmenge des Graphen in disjunkte, „metastabile” Mengen existiert, die nahezu stabile Zustände des Prozesses beschreiben, also nur sehr selten gewechselt werden. In dieser Dissertation wird die Theorie von Graphen und Zufallsprozessen eingeführt, einige bekannte Methoden der Clusteranalyse zusammen gefasst und schließlich eine neue Methode vorgeschlagen und analysiert, die ebenfalls auf Zufallsprozessen basiert, aber ohne die aufwändige Berechnung von Eigenvektoren auskommt. Stattdessen werden „Stoppzeiten” genutzt, die beschreiben, wie lange ein Zufallsprozess, der auf dem Netzwerk wandert, im Durchschnitt benötigt, um eine fest gewählte Zielmenge zu erreichen. Es wird aufgezeigt, dass diese neue Methode einen klaren Vorteil in der Skalierung des Rechenaufwandes zeigt, da die nötigen Rechenschritte zur Berechnung der Stoppzeiten im ungünstigsten Fall quadratisch mit der Zahl der Ecken ansteigt. Für dünn besetzte Graphen, in denen jede Ecke eine feste Zahl an Nachbarn nicht übersteigen darf, zeigen hier präsentierte numerische Experimente an großen Zufallsgraphen, dass die nötige Rechenzeit sogar näherungsweise linear mit der Eckenzahl der Graphen ansteigt. Im Gegensatz dazu skalieren klassische Zerlegungsalgorithmen, die eine Berechnung von Eigenvektoren erfordern, deutlich höher, nämlich mehr als quadratisch, mit der Eckenzahl. Die präsentierte neue Methode unterliegt jedoch einer Einschränkung: Die eingesetzten Stoppzeiten haben nur dann garantiert endliche Werte, wenn die gewählte Zielmenge sich von jeder Ecke des Graphen tatsächlich erreichen lässt und der Prozess in endlicher Zeit fast sicher jede Ecke wieder besucht. Das setzt voraus, dass der Graph stark zusammenhängend, insbesondere frei von Quellen und Senken sein muss. Dies schließt viele gerichtete Graphen aus, stellt aber immer noch eine echte Erweiterung gegenüber der Klasse der ungerichteten Graphen dar. Ansätze zur Überwindung dieser Einschränkung werden in der Auswertung skizziert. Advisors/Committee Members: male (gender), Schütte, Christof (firstReferee), Padberg-Gehle, Kathrin (furtherReferee).

Subjects/Keywords: Cluster Analysis; Directed Networks; Hitting Times; Random Walk; Metastability; Sparse Graphs; ddc:519

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rüdrich, S. (2020). Cluster-Zerlegung gerichteter Netzwerke mit Hilfe von Zufallsbewegungen. (Thesis). Freie Universität Berlin. Retrieved from http://dx.doi.org/10.17169/refubium-27073

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

Rüdrich, Stefan. “Cluster-Zerlegung gerichteter Netzwerke mit Hilfe von Zufallsbewegungen.” 2020. Thesis, Freie Universität Berlin. Accessed March 06, 2021. http://dx.doi.org/10.17169/refubium-27073.

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

MLA Handbook (7^th Edition):

Rüdrich, Stefan. “Cluster-Zerlegung gerichteter Netzwerke mit Hilfe von Zufallsbewegungen.” 2020. Web. 06 Mar 2021.

Vancouver:

Rüdrich S. Cluster-Zerlegung gerichteter Netzwerke mit Hilfe von Zufallsbewegungen. [Internet] [Thesis]. Freie Universität Berlin; 2020. [cited 2021 Mar 06]. Available from: http://dx.doi.org/10.17169/refubium-27073.

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

Council of Science Editors:

Rüdrich S. Cluster-Zerlegung gerichteter Netzwerke mit Hilfe von Zufallsbewegungen. [Thesis]. Freie Universität Berlin; 2020. Available from: http://dx.doi.org/10.17169/refubium-27073

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

University of Colorado

27. 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 Cite « Share

❌

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 March 06, 2021. 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. 06 Mar 2021.

Vancouver:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2021 Mar 06]. 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

28. 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 Cite « Share

❌

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 March 06, 2021. https://doi.org/10.7916/D8JH3ZRR.

MLA Handbook (7^th Edition):

Bauer, Daniel. “Grammar-Based Semantic Parsing Into Graph Representations.” 2017. Web. 06 Mar 2021.

Vancouver:

Bauer D. Grammar-Based Semantic Parsing Into Graph Representations. [Internet] [Doctoral dissertation]. Columbia University; 2017. [cited 2021 Mar 06]. 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

KTH

29. 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)

▼

Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been barely explored however, is that users would like to specify portions of their layouts that are not altered by such algorithms. For example the user may have put a lot of manual effort into fixing a portion of a large layout and, while they would like an automatic layout applied to most of the layout, they do not want their work undone on the portion they manually fixed earlier. CluStic, the system developed and evaluated in this thesis, provides this capability. CluStic maintain the internal structure of a cluster by giving it priority over other elements in the graph. After high priority element has been positioned, non-priority vertices may be placed at the most appropriate remaining positions. Furthermore CluStic produces layouts which also maintain common aesthetic criteria: edge crossing minimization, layout height and edge straightening. Our method in this thesis is to first conduct an initial exploration study where we cross compare four industrial tools: Cytogate, GraphDraw, Diagram.Net and GraphNet. A set of layouts are generated with these tools and the user is timed on a task to identify the longest path. Through this exploration study we develop out intuition and determined that Cytogate is the best performing tool for longest path identification. Given this experience we fully develop CluStic and conduct our main study where we cross compare it with Cytogate and a baseline Breadth-first Search algorithm. Results show that CluStic produces drawings of good quality, Clustic achieves a visualization efficiency score of 1,4 which is an increase compared to the BFS layout (-3,8). CluStic is outperformed by Cytogate which achieves a visualization efficiency score of 1,9 and therefore produces less visually pleasing drawings. However Clustic, unlike Cytogate can preserve initial static structures, thus when a graph contains elements in which their position cannot be altered CluStic is a better choice.

Målet med automatiserad grafritning är att utifrån en uppsättning noder och kanter hitta en layout som är visuellt tillfredställande. Ett delområde som inte utforskats nog är möjligheten till att låsa vissa komponenter i grafen som sedan inte får alterneras av grafritningsalgoritmen. En användare som exempel, strukturerar vissa delar av grafen manuellt och applicerar sedan automatisk layout av resterande element utan att förstöra den struktur som manuellt skapats. CluStic, grafritningsverktyget som skapats och utvärderats i denna masters uppsats fyller denna funktion. CluStic bevarar den interna strukturen för ett kluster genom att tilldela en högre prioritet för noder i klustret med avseende på övriga element i grafen. Efter att högprioritets element placerats tilldelas resterande element sina bäst tillgängliga positioner. Utöver detta så uppfyller CluStic några av de vanligaste estetiska mål inom grafritning: minimera antalet kantkorsningar, minimera höjden, och…

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

Record Details Similar Records Cite « Share

❌

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

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

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

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

MLA Handbook (7^th Edition):

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Web. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

Iowa State University

30. 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 Cite « Share

❌

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

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

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

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

MLA Handbook (7^th Edition):

Olmez, Oktay. “On highly regular digraphs.” 2012. Web. 06 Mar 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations