Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Directed graphs). Showing records 1 – 30 of 98 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Levels

Country

▼ Search Limiters


Iowa State University

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

Degree: 2020, Iowa State University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

Subjects/Keywords: Directed graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

Subjects/Keywords: Directed graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

Subjects/Keywords: Directed graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 flow and minimum cut have been inseparable in directed graphs but not in… …directed planar graphs. The algorithm finds the leftmost s-to-t residual path P , but, instead of… …vertices u and v, we denote the edge between them by uv. Despite finding flows 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

[1] [2] [3] [4]

.