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:(weighted graph). Showing records 1 – 30 of 33 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


East Tennessee State University

1. Samani, Franklina. On Properties of rw-Regular Graphs.

Degree: MS, Mathematical Sciences, 2015, East Tennessee State University

  If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) =… (more)

Subjects/Keywords: graph theory; weighted graph; aw-regular graph.; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Samani, F. (2015). On Properties of rw-Regular Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2601

Chicago Manual of Style (16th Edition):

Samani, Franklina. “On Properties of rw-Regular Graphs.” 2015. Masters Thesis, East Tennessee State University. Accessed September 28, 2020. https://dc.etsu.edu/etd/2601.

MLA Handbook (7th Edition):

Samani, Franklina. “On Properties of rw-Regular Graphs.” 2015. Web. 28 Sep 2020.

Vancouver:

Samani F. On Properties of rw-Regular Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2015. [cited 2020 Sep 28]. Available from: https://dc.etsu.edu/etd/2601.

Council of Science Editors:

Samani F. On Properties of rw-Regular Graphs. [Masters Thesis]. East Tennessee State University; 2015. Available from: https://dc.etsu.edu/etd/2601


University of Cincinnati

2. Dunham, Brandan. Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment.

Degree: MS, Engineering and Applied Science: Computer Science, 2016, University of Cincinnati

 Motivation: Understanding and analyzing proteins interacting within a species is atopic of interest in various biological studies. These interactions can be aligned as a fullnetwork,… (more)

Subjects/Keywords: Computer Science; protein interaction; weighted graph matching; Mutual Exclusion Matching; subisomorphism; graph alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dunham, B. (2016). Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019

Chicago Manual of Style (16th Edition):

Dunham, Brandan. “Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment.” 2016. Masters Thesis, University of Cincinnati. Accessed September 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019.

MLA Handbook (7th Edition):

Dunham, Brandan. “Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment.” 2016. Web. 28 Sep 2020.

Vancouver:

Dunham B. Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment. [Internet] [Masters thesis]. University of Cincinnati; 2016. [cited 2020 Sep 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019.

Council of Science Editors:

Dunham B. Mutually Exclusive Weighted Graph Matching Algorithm for Protein-Protein Interaction Network Alignment. [Masters Thesis]. University of Cincinnati; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470741019


East Tennessee State University

3. Blalock, Constance M. Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree.

Degree: MS, Mathematical Sciences, 2014, East Tennessee State University

  Graphs can effectively model biomolecules, computer systems, and other applications. A weighted graph is a graph in which values or labels are assigned to… (more)

Subjects/Keywords: graph theory; weighted graphs; vertex weight; Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blalock, C. M. (2014). Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2416

Chicago Manual of Style (16th Edition):

Blalock, Constance M. “Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree.” 2014. Masters Thesis, East Tennessee State University. Accessed September 28, 2020. https://dc.etsu.edu/etd/2416.

MLA Handbook (7th Edition):

Blalock, Constance M. “Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree.” 2014. Web. 28 Sep 2020.

Vancouver:

Blalock CM. Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree. [Internet] [Masters thesis]. East Tennessee State University; 2014. [cited 2020 Sep 28]. Available from: https://dc.etsu.edu/etd/2416.

Council of Science Editors:

Blalock CM. Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree. [Masters Thesis]. East Tennessee State University; 2014. Available from: https://dc.etsu.edu/etd/2416


University of New South Wales

4. Kwok, Eric. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.

Degree: Mathematics & Statistics, 2018, University of New South Wales

 Transport and mixing in dynamical systems are important properties for many physical, chemical, biological, and engineering processes. The detection of transport barriers for dynamics with… (more)

Subjects/Keywords: Lagrangian coherent structure; Dynamic; Isoperimetry; Weighted manifold; Graph; Manifold learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kwok, E. (2018). Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Kwok, Eric. “Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.” 2018. Doctoral Dissertation, University of New South Wales. Accessed September 28, 2020. http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true.

MLA Handbook (7th Edition):

Kwok, Eric. “Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.” 2018. Web. 28 Sep 2020.

Vancouver:

Kwok E. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2020 Sep 28]. Available from: http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true.

Council of Science Editors:

Kwok E. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true


Delft University of Technology

5. Jiao, Chongze (author). Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis.

Degree: 2017, Delft University of Technology

 Recent years, recommender systems are more and more important for solving information overload problem. They sort through massive data to provide users with personalized content… (more)

Subjects/Keywords: Recommender System; Collaborative Filtering; Weighted Bipartite Graph; U-I Matrix Property

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jiao, C. (. (2017). Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052

Chicago Manual of Style (16th Edition):

Jiao, Chongze (author). “Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis.” 2017. Masters Thesis, Delft University of Technology. Accessed September 28, 2020. http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052.

MLA Handbook (7th Edition):

Jiao, Chongze (author). “Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis.” 2017. Web. 28 Sep 2020.

Vancouver:

Jiao C(. Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2020 Sep 28]. Available from: http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052.

Council of Science Editors:

Jiao C(. Evaluating Recommendation Algorithms Based on U-I Matrix Property Analysis. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:e9415a6b-e6fc-47ef-b41b-6e491188b052


University of New Mexico

6. Jeffries, Tanya. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.

Degree: Department of Computer Science, 2016, University of New Mexico

 The one-sided bipartite graph drawing problem has been extensively studied in the graph drawing literature, with numerous papers appearing over the years showing novel algorithms… (more)

Subjects/Keywords: bipartite; graph; drawing; crossing; minimization; stochastic; weighted; bottleneck

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jeffries, T. (2016). Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/32250

Chicago Manual of Style (16th Edition):

Jeffries, Tanya. “Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.” 2016. Masters Thesis, University of New Mexico. Accessed September 28, 2020. http://hdl.handle.net/1928/32250.

MLA Handbook (7th Edition):

Jeffries, Tanya. “Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.” 2016. Web. 28 Sep 2020.

Vancouver:

Jeffries T. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. [Internet] [Masters thesis]. University of New Mexico; 2016. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1928/32250.

Council of Science Editors:

Jeffries T. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. [Masters Thesis]. University of New Mexico; 2016. Available from: http://hdl.handle.net/1928/32250


Brigham Young University

7. Bodily, Paul Mark. Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction.

Degree: MS, 2013, Brigham Young University

 Virtually all genome assemblers to date are designed for use with data from haploid or homozygous diploid genomes. Their use on heterozygous genomic datasets generally… (more)

Subjects/Keywords: Genome Assembly; Scaffolding; Weighted MAX-CUT Algorithms; Bidirected Graph Theory; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bodily, P. M. (2013). Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4792&context=etd

Chicago Manual of Style (16th Edition):

Bodily, Paul Mark. “Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction.” 2013. Masters Thesis, Brigham Young University. Accessed September 28, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4792&context=etd.

MLA Handbook (7th Edition):

Bodily, Paul Mark. “Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction.” 2013. Web. 28 Sep 2020.

Vancouver:

Bodily PM. Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction. [Internet] [Masters thesis]. Brigham Young University; 2013. [cited 2020 Sep 28]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4792&context=etd.

Council of Science Editors:

Bodily PM. Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction. [Masters Thesis]. Brigham Young University; 2013. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4792&context=etd


Penn State University

8. Wang, Hongjian. Ubran Computing with Mobility Data: a Unified Approach.

Degree: 2018, Penn State University

 With the advent of the information age, various types of data are collected in the context of urban spaces, including taxi pickups/drop-offs, tweets from users,… (more)

Subjects/Keywords: urban computing; graph embedding; data mining; mobility data; spatial non-stationary; geographically weighted regression; reinforcement learning; MCMC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2018). Ubran Computing with Mobility Data: a Unified Approach. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/15253hxw186

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

Wang, Hongjian. “Ubran Computing with Mobility Data: a Unified Approach.” 2018. Thesis, Penn State University. Accessed September 28, 2020. https://submit-etda.libraries.psu.edu/catalog/15253hxw186.

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

MLA Handbook (7th Edition):

Wang, Hongjian. “Ubran Computing with Mobility Data: a Unified Approach.” 2018. Web. 28 Sep 2020.

Vancouver:

Wang H. Ubran Computing with Mobility Data: a Unified Approach. [Internet] [Thesis]. Penn State University; 2018. [cited 2020 Sep 28]. Available from: https://submit-etda.libraries.psu.edu/catalog/15253hxw186.

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

Council of Science Editors:

Wang H. Ubran Computing with Mobility Data: a Unified Approach. [Thesis]. Penn State University; 2018. Available from: https://submit-etda.libraries.psu.edu/catalog/15253hxw186

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


East Tennessee State University

9. Masum, Mohammad. Vertex Weighted Spectral Clustering.

Degree: MS, Mathematical Sciences, 2017, East Tennessee State University

  Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use… (more)

Subjects/Keywords: Fiedler vector; Laplacian matrix; cosine similarity based clustering; unassociated data; vertex weighted graph; vector valued graph; Discrete Mathematics and Combinatorics; Other Mathematics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Masum, M. (2017). Vertex Weighted Spectral Clustering. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3266

Chicago Manual of Style (16th Edition):

Masum, Mohammad. “Vertex Weighted Spectral Clustering.” 2017. Masters Thesis, East Tennessee State University. Accessed September 28, 2020. https://dc.etsu.edu/etd/3266.

MLA Handbook (7th Edition):

Masum, Mohammad. “Vertex Weighted Spectral Clustering.” 2017. Web. 28 Sep 2020.

Vancouver:

Masum M. Vertex Weighted Spectral Clustering. [Internet] [Masters thesis]. East Tennessee State University; 2017. [cited 2020 Sep 28]. Available from: https://dc.etsu.edu/etd/3266.

Council of Science Editors:

Masum M. Vertex Weighted Spectral Clustering. [Masters Thesis]. East Tennessee State University; 2017. Available from: https://dc.etsu.edu/etd/3266


Indian Institute of Science

10. Gadiyaram, Vasundhara. Graph Spectral Methods for Analysis of Protein Structures.

Degree: PhD, Faculty of Science, 2019, Indian Institute of Science

 Network representation of protein structures is an information-rich mode of examining protein structure, dynamics and its interactions with biomolecules. Graph spectral methods are extremely useful… (more)

Subjects/Keywords: Protein Structure Networks (PSN); Spectral Theory; Protein Structure Models; Spectral Graph Theory; G-Protein Coupled Receptors; Graph Spectral Method; Correspondence Score (CRS); Eigenvalue-Weighted Cosine Score (EWCS); Eigenvalue-Weighted Cosine Score (EWCS); Network Similarity Score (NSS); Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gadiyaram, V. (2019). Graph Spectral Methods for Analysis of Protein Structures. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/4280

Chicago Manual of Style (16th Edition):

Gadiyaram, Vasundhara. “Graph Spectral Methods for Analysis of Protein Structures.” 2019. Doctoral Dissertation, Indian Institute of Science. Accessed September 28, 2020. http://etd.iisc.ac.in/handle/2005/4280.

MLA Handbook (7th Edition):

Gadiyaram, Vasundhara. “Graph Spectral Methods for Analysis of Protein Structures.” 2019. Web. 28 Sep 2020.

Vancouver:

Gadiyaram V. Graph Spectral Methods for Analysis of Protein Structures. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2019. [cited 2020 Sep 28]. Available from: http://etd.iisc.ac.in/handle/2005/4280.

Council of Science Editors:

Gadiyaram V. Graph Spectral Methods for Analysis of Protein Structures. [Doctoral Dissertation]. Indian Institute of Science; 2019. Available from: http://etd.iisc.ac.in/handle/2005/4280


West Virginia University

11. Liu, Jianbing. Weighted Modulo Orientations of Graphs.

Degree: PhD, Mathematics, 2020, West Virginia University

  This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte's 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero… (more)

Subjects/Keywords: Nowhere-zero Flow; Group Connectivity; Modulo Orientation; Graphic Sequence; Weighted Modulo Orientation; Additive Bases; Matching Number; Signed Graph; Discrete Mathematics and Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, J. (2020). Weighted Modulo Orientations of Graphs. (Doctoral Dissertation). West Virginia University. Retrieved from https://doi.org/10.33915/etd.7757 ; https://researchrepository.wvu.edu/etd/7757

Chicago Manual of Style (16th Edition):

Liu, Jianbing. “Weighted Modulo Orientations of Graphs.” 2020. Doctoral Dissertation, West Virginia University. Accessed September 28, 2020. https://doi.org/10.33915/etd.7757 ; https://researchrepository.wvu.edu/etd/7757.

MLA Handbook (7th Edition):

Liu, Jianbing. “Weighted Modulo Orientations of Graphs.” 2020. Web. 28 Sep 2020.

Vancouver:

Liu J. Weighted Modulo Orientations of Graphs. [Internet] [Doctoral dissertation]. West Virginia University; 2020. [cited 2020 Sep 28]. Available from: https://doi.org/10.33915/etd.7757 ; https://researchrepository.wvu.edu/etd/7757.

Council of Science Editors:

Liu J. Weighted Modulo Orientations of Graphs. [Doctoral Dissertation]. West Virginia University; 2020. Available from: https://doi.org/10.33915/etd.7757 ; https://researchrepository.wvu.edu/etd/7757


University of Washington

12. Cheng, Xi. Super-resolution Reconstruction of Orientation Distribution Function from Motion Scattered Diffusion Weighted Image Slices and its Application to Fetal Brain Connectivity Study.

Degree: 2015, University of Washington

 Diffusion-weighted MRI brings new and complimentary information about the development of the brain. It is also actively investigated how diffusion contrast properties correlates with brain… (more)

Subjects/Keywords: brain connectivity study; diffusion weighted MRI; graph theory; motion estimation; orientation distribution function; super-resolution reconstruction; Medical imaging; Biomedical engineering; Bioinformatics; bioengineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, X. (2015). Super-resolution Reconstruction of Orientation Distribution Function from Motion Scattered Diffusion Weighted Image Slices and its Application to Fetal Brain Connectivity Study. (Thesis). University of Washington. Retrieved from http://hdl.handle.net/1773/33584

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

Cheng, Xi. “Super-resolution Reconstruction of Orientation Distribution Function from Motion Scattered Diffusion Weighted Image Slices and its Application to Fetal Brain Connectivity Study.” 2015. Thesis, University of Washington. Accessed September 28, 2020. http://hdl.handle.net/1773/33584.

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

MLA Handbook (7th Edition):

Cheng, Xi. “Super-resolution Reconstruction of Orientation Distribution Function from Motion Scattered Diffusion Weighted Image Slices and its Application to Fetal Brain Connectivity Study.” 2015. Web. 28 Sep 2020.

Vancouver:

Cheng X. Super-resolution Reconstruction of Orientation Distribution Function from Motion Scattered Diffusion Weighted Image Slices and its Application to Fetal Brain Connectivity Study. [Internet] [Thesis]. University of Washington; 2015. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1773/33584.

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

Council of Science Editors:

Cheng X. Super-resolution Reconstruction of Orientation Distribution Function from Motion Scattered Diffusion Weighted Image Slices and its Application to Fetal Brain Connectivity Study. [Thesis]. University of Washington; 2015. Available from: http://hdl.handle.net/1773/33584

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

13. Wu, Changshun. Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés : Synchronizing sequences for unbounded synchronized Petri nets.

Degree: Docteur es, Automatique, 2018, Aix Marseille Université

L'un des problèmes fondamentaux de test pour les systèmes à événements discrets (SEDs) est l'identification d'un état final, c'est-à-dire, étant donné un système dont l'état… (more)

Subjects/Keywords: Réseaux de Petri synchronisés; Systèmes non bornés; Séquences de synchronisation; Automates pondérés; Graphe de couverture; Synchronized Petri nets; Unbounded Systems; Synchronizing Sequences; Weighted automata; Coverability Graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, C. (2018). Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés : Synchronizing sequences for unbounded synchronized Petri nets. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2018AIXM0717

Chicago Manual of Style (16th Edition):

Wu, Changshun. “Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés : Synchronizing sequences for unbounded synchronized Petri nets.” 2018. Doctoral Dissertation, Aix Marseille Université. Accessed September 28, 2020. http://www.theses.fr/2018AIXM0717.

MLA Handbook (7th Edition):

Wu, Changshun. “Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés : Synchronizing sequences for unbounded synchronized Petri nets.” 2018. Web. 28 Sep 2020.

Vancouver:

Wu C. Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés : Synchronizing sequences for unbounded synchronized Petri nets. [Internet] [Doctoral dissertation]. Aix Marseille Université 2018. [cited 2020 Sep 28]. Available from: http://www.theses.fr/2018AIXM0717.

Council of Science Editors:

Wu C. Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés : Synchronizing sequences for unbounded synchronized Petri nets. [Doctoral Dissertation]. Aix Marseille Université 2018. Available from: http://www.theses.fr/2018AIXM0717


University of Florida

14. Colon-Perez, Luis M. Weighted Networks and the Topology of Brain Networks.

Degree: PhD, Physics, 2013, University of Florida

Graph theory is the mathematical framework to quantify properties of networks, which are composed of nodes (objects) and edges (connections). Strikingly different networks share a… (more)

Subjects/Keywords: Brain; Connected regions; Connectivity; Distance functions; Magnetic resonance imaging; Null hypothesis; Rats; Somatosensory cortex; Spatial resolution; Surface areas; brain-networks  – connectivity  – diffusion  – graph-theory  – mri  – small-world  – tractography  – weighted-networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Colon-Perez, L. M. (2013). Weighted Networks and the Topology of Brain Networks. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0045838

Chicago Manual of Style (16th Edition):

Colon-Perez, Luis M. “Weighted Networks and the Topology of Brain Networks.” 2013. Doctoral Dissertation, University of Florida. Accessed September 28, 2020. https://ufdc.ufl.edu/UFE0045838.

MLA Handbook (7th Edition):

Colon-Perez, Luis M. “Weighted Networks and the Topology of Brain Networks.” 2013. Web. 28 Sep 2020.

Vancouver:

Colon-Perez LM. Weighted Networks and the Topology of Brain Networks. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2020 Sep 28]. Available from: https://ufdc.ufl.edu/UFE0045838.

Council of Science Editors:

Colon-Perez LM. Weighted Networks and the Topology of Brain Networks. [Doctoral Dissertation]. University of Florida; 2013. Available from: https://ufdc.ufl.edu/UFE0045838

15. Halappanavar, Mahantesh. Algorithms for Vertex-Weighted Matching in Graphs.

Degree: PhD, Computer Science, 2009, Old Dominion University

  A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex.… (more)

Subjects/Keywords: Parallel half approximation; Vertex-weighted matching; Weighted matching; Matching theory; Graph theory; Computer Sciences; Programming Languages and Compilers; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halappanavar, M. (2009). Algorithms for Vertex-Weighted Matching in Graphs. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57

Chicago Manual of Style (16th Edition):

Halappanavar, Mahantesh. “Algorithms for Vertex-Weighted Matching in Graphs.” 2009. Doctoral Dissertation, Old Dominion University. Accessed September 28, 2020. 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57.

MLA Handbook (7th Edition):

Halappanavar, Mahantesh. “Algorithms for Vertex-Weighted Matching in Graphs.” 2009. Web. 28 Sep 2020.

Vancouver:

Halappanavar M. Algorithms for Vertex-Weighted Matching in Graphs. [Internet] [Doctoral dissertation]. Old Dominion University; 2009. [cited 2020 Sep 28]. Available from: 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57.

Council of Science Editors:

Halappanavar M. Algorithms for Vertex-Weighted Matching in Graphs. [Doctoral Dissertation]. Old Dominion University; 2009. Available from: 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57

16. Brezovnik, Simon. Računanje wienerjevega indeksa uteženega grafa z združevanjem ?*-razredov.

Degree: 2018, Univerza v Mariboru

Wienerjev indeks igra pomembno vlogo pri poznavanju kemijskih in fizikalnih lastnosti različnih spojin. Predstavlja vsoto razdalj med vsemi neurejenimi pari vozlišč znotraj grafa. Uteženi graf… (more)

Subjects/Keywords: Wienerjev indeks; delna kocka; uteženi graf; kvocientni graf; Djoković-Winklerjeva relacija; tranzitivno zaprtje; Wiener index; partial cube; weighted graph; quotient graph; Djoković-Winkler relation; transitive closure; info:eu-repo/classification/udc/519.17(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brezovnik, S. (2018). Računanje wienerjevega indeksa uteženega grafa z združevanjem ?*-razredov. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=70163 ; https://dk.um.si/Dokument.php?id=123838&dn= ; https://plus.si.cobiss.net/opac7/bib/23868424?lang=sl

Chicago Manual of Style (16th Edition):

Brezovnik, Simon. “Računanje wienerjevega indeksa uteženega grafa z združevanjem ?*-razredov.” 2018. Masters Thesis, Univerza v Mariboru. Accessed September 28, 2020. https://dk.um.si/IzpisGradiva.php?id=70163 ; https://dk.um.si/Dokument.php?id=123838&dn= ; https://plus.si.cobiss.net/opac7/bib/23868424?lang=sl.

MLA Handbook (7th Edition):

Brezovnik, Simon. “Računanje wienerjevega indeksa uteženega grafa z združevanjem ?*-razredov.” 2018. Web. 28 Sep 2020.

Vancouver:

Brezovnik S. Računanje wienerjevega indeksa uteženega grafa z združevanjem ?*-razredov. [Internet] [Masters thesis]. Univerza v Mariboru; 2018. [cited 2020 Sep 28]. Available from: https://dk.um.si/IzpisGradiva.php?id=70163 ; https://dk.um.si/Dokument.php?id=123838&dn= ; https://plus.si.cobiss.net/opac7/bib/23868424?lang=sl.

Council of Science Editors:

Brezovnik S. Računanje wienerjevega indeksa uteženega grafa z združevanjem ?*-razredov. [Masters Thesis]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=70163 ; https://dk.um.si/Dokument.php?id=123838&dn= ; https://plus.si.cobiss.net/opac7/bib/23868424?lang=sl

17. Sinkovic, John Henry. The Minimum Rank Problem for Outerplanar Graphs.

Degree: PhD, 2013, Brigham Young University

 Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all… (more)

Subjects/Keywords: outerplanar graph; minimum rank; maximum nullity; path cover number; partial 2-path; edge-disjoint cover; weighted graph; Mathematics

…1.2 Basic Matrix Theory and Graph Theory In most cases notation and definitions follow… …x28;A + B) ≤ rank A + rank B. Let G = (V, E) be a simple graph with vertex… …3, 4} and E = {12, 12, 23, 24}, the resulting graph has a pair of edges… …order of a graph G is the number of vertices in V (G), and will be denoted as |G… …Continuing with the assumption that V 0 ⊆ V , the subgraph of G induced by V 0 is the graph H… 

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

Sinkovic, J. H. (2013). The Minimum Rank Problem for Outerplanar Graphs. (Doctoral Dissertation). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4721&context=etd

Chicago Manual of Style (16th Edition):

Sinkovic, John Henry. “The Minimum Rank Problem for Outerplanar Graphs.” 2013. Doctoral Dissertation, Brigham Young University. Accessed September 28, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4721&context=etd.

MLA Handbook (7th Edition):

Sinkovic, John Henry. “The Minimum Rank Problem for Outerplanar Graphs.” 2013. Web. 28 Sep 2020.

Vancouver:

Sinkovic JH. The Minimum Rank Problem for Outerplanar Graphs. [Internet] [Doctoral dissertation]. Brigham Young University; 2013. [cited 2020 Sep 28]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4721&context=etd.

Council of Science Editors:

Sinkovic JH. The Minimum Rank Problem for Outerplanar Graphs. [Doctoral Dissertation]. Brigham Young University; 2013. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4721&context=etd

18. He, Zhou. Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs : Optimisation de performance d'une classe de réseaux de Pétri déterministes et temporisés : les graphes d'événements valués.

Degree: Docteur es, Mathématiques et informatique. Automatique, 2017, Aix-Marseille; Université Jiaotong (Xi'an, Chine)

Au cours des dernières décennies, la complexité croissante des systèmes de production et de leur commande a rendu crucial le besoin d’utiliser les méthodes formelles… (more)

Subjects/Keywords: Systèmes de production automatisés (SAP); Systèmes à événements discrets; Réseau de Petri temporisé; Evaluation de performance; Optimisation de performance.; Discrete event system; Timed Petri net; Weighted marked graph; Performance evaluation; Performance optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, Z. (2017). Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs : Optimisation de performance d'une classe de réseaux de Pétri déterministes et temporisés : les graphes d'événements valués. (Doctoral Dissertation). Aix-Marseille; Université Jiaotong (Xi'an, Chine). Retrieved from http://www.theses.fr/2017AIXM0166

Chicago Manual of Style (16th Edition):

He, Zhou. “Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs : Optimisation de performance d'une classe de réseaux de Pétri déterministes et temporisés : les graphes d'événements valués.” 2017. Doctoral Dissertation, Aix-Marseille; Université Jiaotong (Xi'an, Chine). Accessed September 28, 2020. http://www.theses.fr/2017AIXM0166.

MLA Handbook (7th Edition):

He, Zhou. “Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs : Optimisation de performance d'une classe de réseaux de Pétri déterministes et temporisés : les graphes d'événements valués.” 2017. Web. 28 Sep 2020.

Vancouver:

He Z. Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs : Optimisation de performance d'une classe de réseaux de Pétri déterministes et temporisés : les graphes d'événements valués. [Internet] [Doctoral dissertation]. Aix-Marseille; Université Jiaotong (Xi'an, Chine); 2017. [cited 2020 Sep 28]. Available from: http://www.theses.fr/2017AIXM0166.

Council of Science Editors:

He Z. Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs : Optimisation de performance d'une classe de réseaux de Pétri déterministes et temporisés : les graphes d'événements valués. [Doctoral Dissertation]. Aix-Marseille; Université Jiaotong (Xi'an, Chine); 2017. Available from: http://www.theses.fr/2017AIXM0166


Penn State University

19. Park, JinHyeong. MANIFOLD LEARNING IN COMPUTER VISION.

Degree: 2008, Penn State University

 Appearance based learning has become very popular in the field of computer vision. In a particular system, a visual datum such as an image is… (more)

Subjects/Keywords: manifold; image occlusion handling; weighted PCA; Least Angle Regression; Spectral Graph Clustering; Motion Segmentation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, J. (2008). MANIFOLD LEARNING IN COMPUTER VISION. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/6731

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

Park, JinHyeong. “MANIFOLD LEARNING IN COMPUTER VISION.” 2008. Thesis, Penn State University. Accessed September 28, 2020. https://submit-etda.libraries.psu.edu/catalog/6731.

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

MLA Handbook (7th Edition):

Park, JinHyeong. “MANIFOLD LEARNING IN COMPUTER VISION.” 2008. Web. 28 Sep 2020.

Vancouver:

Park J. MANIFOLD LEARNING IN COMPUTER VISION. [Internet] [Thesis]. Penn State University; 2008. [cited 2020 Sep 28]. Available from: https://submit-etda.libraries.psu.edu/catalog/6731.

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

Council of Science Editors:

Park J. MANIFOLD LEARNING IN COMPUTER VISION. [Thesis]. Penn State University; 2008. Available from: https://submit-etda.libraries.psu.edu/catalog/6731

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


Texas A&M University

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

Degree: PhD, Industrial Engineering, 2015, Texas A&M University

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Doctoral Dissertation, Texas A&M University. Accessed September 28, 2020. http://hdl.handle.net/1969.1/155568.

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 28 Sep 2020.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/1969.1/155568.

Council of Science Editors:

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


Indian Institute of Science

21. Bhattacharyya, Moitrayee. Probing Ligand Induced Perturbations In Protien Structure Networks : Physico-Chemical Insights From MD Simulations And Graph Theory.

Degree: PhD, Faculty of Science, 2014, Indian Institute of Science

 The fidelity of biological processes and reactions, inspite of the widespread diversity, is programmed by highly specific physico-chemical principles. This underlines our basic understanding of… (more)

Subjects/Keywords: Protein Structure; Protein - Non Covalent Interactions; Nucleic Acids- Non Covalent Interactions; Bacterial LuxS Protein; Protein-Ligand Interactions; Protein Structure Networks; Proteins - Conformation; Allosteric Proteins; Energy-Weighted Network Formalism; Proteins - Allosterism; Protein Structure Network (PSN); Protein Structure Graph (PSN); Protein Complex Energy Network (PcEN); Biochemistry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhattacharyya, M. (2014). Probing Ligand Induced Perturbations In Protien Structure Networks : Physico-Chemical Insights From MD Simulations And Graph Theory. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2341

Chicago Manual of Style (16th Edition):

Bhattacharyya, Moitrayee. “Probing Ligand Induced Perturbations In Protien Structure Networks : Physico-Chemical Insights From MD Simulations And Graph Theory.” 2014. Doctoral Dissertation, Indian Institute of Science. Accessed September 28, 2020. http://etd.iisc.ac.in/handle/2005/2341.

MLA Handbook (7th Edition):

Bhattacharyya, Moitrayee. “Probing Ligand Induced Perturbations In Protien Structure Networks : Physico-Chemical Insights From MD Simulations And Graph Theory.” 2014. Web. 28 Sep 2020.

Vancouver:

Bhattacharyya M. Probing Ligand Induced Perturbations In Protien Structure Networks : Physico-Chemical Insights From MD Simulations And Graph Theory. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2014. [cited 2020 Sep 28]. Available from: http://etd.iisc.ac.in/handle/2005/2341.

Council of Science Editors:

Bhattacharyya M. Probing Ligand Induced Perturbations In Protien Structure Networks : Physico-Chemical Insights From MD Simulations And Graph Theory. [Doctoral Dissertation]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ac.in/handle/2005/2341


Universidade do Rio Grande do Sul

22. Caetano, Tiberio Silva. Graphical models and point set matching.

Degree: 2004, Universidade do Rio Grande do Sul

Point pattern matching in Euclidean Spaces is one of the fundamental problems in Pattern Recognition, having applications ranging from Computer Vision to Computational Chemistry. Whenever… (more)

Subjects/Keywords: Point pattern matching; Computação gráfica; Weighted graph matching; Reconhecimento : Padroes; Probabilistic graphical models; Hidden Markov random fields; Pattern recognition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Caetano, T. S. (2004). Graphical models and point set matching. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/4041

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

Caetano, Tiberio Silva. “Graphical models and point set matching.” 2004. Thesis, Universidade do Rio Grande do Sul. Accessed September 28, 2020. http://hdl.handle.net/10183/4041.

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

MLA Handbook (7th Edition):

Caetano, Tiberio Silva. “Graphical models and point set matching.” 2004. Web. 28 Sep 2020.

Vancouver:

Caetano TS. Graphical models and point set matching. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2004. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/10183/4041.

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

Council of Science Editors:

Caetano TS. Graphical models and point set matching. [Thesis]. Universidade do Rio Grande do Sul; 2004. Available from: http://hdl.handle.net/10183/4041

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

23. Beggas, Fairouz. Decomposition and Domination of Some Graphs : Décomposition et domination pour dans les graphes.

Degree: Docteur es, Informatique, 2017, Lyon

 La théorie des graphes est considérée comme un vaste champ qui permet d'explorer différentes techniques de preuve des mathématiques discrètes. Ainsi, les différents problèmes traités… (more)

Subjects/Keywords: Décomposition; Multidécomposition; [1, 2]-domination; [1, 2]-total domination; Monitoring des arêtes; Monitoring pondéré des arêtes; Monitoring k-uniforme des arêtes; Graph decomposition; Multidecomposition; [1, 2]-dominating set; [1, 2]-total dominating set; Edge monitoring problem; Weighted monitoring problem; K-uniform edge monitoring; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beggas, F. (2017). Decomposition and Domination of Some Graphs : Décomposition et domination pour dans les graphes. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSE1051

Chicago Manual of Style (16th Edition):

Beggas, Fairouz. “Decomposition and Domination of Some Graphs : Décomposition et domination pour dans les graphes.” 2017. Doctoral Dissertation, Lyon. Accessed September 28, 2020. http://www.theses.fr/2017LYSE1051.

MLA Handbook (7th Edition):

Beggas, Fairouz. “Decomposition and Domination of Some Graphs : Décomposition et domination pour dans les graphes.” 2017. Web. 28 Sep 2020.

Vancouver:

Beggas F. Decomposition and Domination of Some Graphs : Décomposition et domination pour dans les graphes. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Sep 28]. Available from: http://www.theses.fr/2017LYSE1051.

Council of Science Editors:

Beggas F. Decomposition and Domination of Some Graphs : Décomposition et domination pour dans les graphes. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSE1051

24. Tibboel, M. Creating high quality indicative routes in heterogeneous virtual environments.

Degree: 2013, Universiteit Utrecht

 In this thesis we will attempt to close the gap between fast grid-based method and epsilon-approximation methods that solve the Weighted Region problem. In order… (more)

Subjects/Keywords: Weighted region problem; epsilon-approximation; Steiner points; pruned-graph methods; A*

…decomposition method is chosen. The cell decomposition results in a weighted graph. A* is used to find… …Return Path Breadth first search Breadth first search [12] on a graph works the same… …number of nodes in the graph. Depth first search Depth first search [12] employs the… …nodes in the graph. Best first search Best first search [12] is the first algorithm… …n log n), where n is the number of nodes in the graph. Dijkstra Dijkstra’s algorithm… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tibboel, M. (2013). Creating high quality indicative routes in heterogeneous virtual environments. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/280265

Chicago Manual of Style (16th Edition):

Tibboel, M. “Creating high quality indicative routes in heterogeneous virtual environments.” 2013. Masters Thesis, Universiteit Utrecht. Accessed September 28, 2020. http://dspace.library.uu.nl:8080/handle/1874/280265.

MLA Handbook (7th Edition):

Tibboel, M. “Creating high quality indicative routes in heterogeneous virtual environments.” 2013. Web. 28 Sep 2020.

Vancouver:

Tibboel M. Creating high quality indicative routes in heterogeneous virtual environments. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2020 Sep 28]. Available from: http://dspace.library.uu.nl:8080/handle/1874/280265.

Council of Science Editors:

Tibboel M. Creating high quality indicative routes in heterogeneous virtual environments. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/280265


University of Cambridge

25. Comsa, Iulia-Maria. Tracking brain dynamics across transitions of consciousness.

Degree: PhD, 2019, University of Cambridge

 How do we lose and regain consciousness? The space between healthy wakefulness and unconsciousness encompasses a series of gradual and rapid changes in brain activity.… (more)

Subjects/Keywords: consciousness; neuroscience of consciousness; states of consciousness; levels of consciousness; impaired consciousness; onset of sleep; sedation; coma; EEG; EEG microstates; brain connectivity; frontoparietal connectivity; temporal brain dynamics; graph theory; Lempel-Ziv complexity; neural complexity; neural integration; brain networks; spectral power; spectral connectivity; weighted phase lag index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comsa, I. (2019). Tracking brain dynamics across transitions of consciousness. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/290496

Chicago Manual of Style (16th Edition):

Comsa, Iulia-Maria. “Tracking brain dynamics across transitions of consciousness.” 2019. Doctoral Dissertation, University of Cambridge. Accessed September 28, 2020. https://www.repository.cam.ac.uk/handle/1810/290496.

MLA Handbook (7th Edition):

Comsa, Iulia-Maria. “Tracking brain dynamics across transitions of consciousness.” 2019. Web. 28 Sep 2020.

Vancouver:

Comsa I. Tracking brain dynamics across transitions of consciousness. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Sep 28]. Available from: https://www.repository.cam.ac.uk/handle/1810/290496.

Council of Science Editors:

Comsa I. Tracking brain dynamics across transitions of consciousness. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/290496

26. Xing, Mengqi. Connectome Analyses of Functional Brain Networks in Patients with Psychiatric Disorders.

Degree: 2016, University of Illinois – Chicago

 The human connectome is a connectivity matrix which maps the neural connection in the brain network. Functional connectivity matrix could be acquired by functional magnetic… (more)

Subjects/Keywords: EEG; fMRI; Weighted Phase Lag; brain connectomics; graph theory; emotion regulation; catatonia

…temporal resolution, but the spatial resolution is limited by the numbers of electrode. Graph… …developed to investigate the properties of the functional network. Time dependent graph theory… …of each module was not consistent over time. 2. Specific aim 2 The proposed Graph… …causality based methods. The Weighted Phase Lag Index (WPLI) in a phase-based approach… …characteristic of their brain networks. C. Graph Theory Graph theory is widely used in the field of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xing, M. (2016). Connectome Analyses of Functional Brain Networks in Patients with Psychiatric Disorders. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20154

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

Xing, Mengqi. “Connectome Analyses of Functional Brain Networks in Patients with Psychiatric Disorders.” 2016. Thesis, University of Illinois – Chicago. Accessed September 28, 2020. http://hdl.handle.net/10027/20154.

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

MLA Handbook (7th Edition):

Xing, Mengqi. “Connectome Analyses of Functional Brain Networks in Patients with Psychiatric Disorders.” 2016. Web. 28 Sep 2020.

Vancouver:

Xing M. Connectome Analyses of Functional Brain Networks in Patients with Psychiatric Disorders. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/10027/20154.

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

Council of Science Editors:

Xing M. Connectome Analyses of Functional Brain Networks in Patients with Psychiatric Disorders. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20154

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

27. Comsa, Iulia-Maria. Tracking brain dynamics across transitions of consciousness.

Degree: PhD, 2019, University of Cambridge

 How do we lose and regain consciousness? The space between healthy wakefulness and unconsciousness encompasses a series of gradual and rapid changes in brain activity.… (more)

Subjects/Keywords: consciousness; neuroscience of consciousness; states of consciousness; levels of consciousness; impaired consciousness; onset of sleep; sedation; coma; EEG; EEG microstates; brain connectivity; frontoparietal connectivity; temporal brain dynamics; graph theory; Lempel-Ziv complexity; neural complexity; neural integration; brain networks; spectral power; spectral connectivity; weighted phase lag index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comsa, I. (2019). Tracking brain dynamics across transitions of consciousness. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/290496 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774595

Chicago Manual of Style (16th Edition):

Comsa, Iulia-Maria. “Tracking brain dynamics across transitions of consciousness.” 2019. Doctoral Dissertation, University of Cambridge. Accessed September 28, 2020. https://www.repository.cam.ac.uk/handle/1810/290496 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774595.

MLA Handbook (7th Edition):

Comsa, Iulia-Maria. “Tracking brain dynamics across transitions of consciousness.” 2019. Web. 28 Sep 2020.

Vancouver:

Comsa I. Tracking brain dynamics across transitions of consciousness. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Sep 28]. Available from: https://www.repository.cam.ac.uk/handle/1810/290496 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774595.

Council of Science Editors:

Comsa I. Tracking brain dynamics across transitions of consciousness. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/290496 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774595


Brno University of Technology

28. Jágr, Petr. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.

Degree: 2020, Brno University of Technology

 The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a… (more)

Subjects/Keywords: algoritmus; asymptotické vyjádření složitosti; Bellman-Fordův algoritmus; cesta; Dijkstrův algoritmus; dynamické programování; Floyd-Warshallův algoritmus; genetické algoritmy; heuristické algoritmy; hladové algoritmy; Java; nejkratší cesta; neorientovaný graf; ohodnocený graf; Omega; Omikron; orientovaný graf; paralelní algoritmy; plánování trasy; pravidelný graf; rekurzivní algoritmy; rozděl a panuj; sled; smyčka; souvislý graf; stupeň vrcholu; tah; teorie grafů; Theta; algorithm; asymptotic notation; Bellman-Ford algorithm; complete graph; degree of a vertex; Dijkstra's algorithm; directed graph; divide and conquer algorithms; dynamic programming; Floyd-Warshall algorithm; genetic algorithms; graph teory; greedy algorithms; heuristic algorithms; Java; loop; move; Omega; Omicron; paralel algorithms; path; path planning; recursive algorithms; regular graph; sequence; the shortest path; Theta; undirected graph; weighted graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jágr, P. (2020). Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187854

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

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2020. Thesis, Brno University of Technology. Accessed September 28, 2020. http://hdl.handle.net/11012/187854.

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

MLA Handbook (7th Edition):

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2020. Web. 28 Sep 2020.

Vancouver:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/11012/187854.

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

Council of Science Editors:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187854

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


Brno University of Technology

29. Jágr, Petr. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.

Degree: 2019, Brno University of Technology

 The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a… (more)

Subjects/Keywords: algoritmus; asymptotické vyjádření složitosti; Bellman-Fordův algoritmus; cesta; Dijkstrův algoritmus; dynamické programování; Floyd-Warshallův algoritmus; genetické algoritmy; heuristické algoritmy; hladové algoritmy; Java; nejkratší cesta; neorientovaný graf; ohodnocený graf; Omega; Omikron; orientovaný graf; paralelní algoritmy; plánování trasy; pravidelný graf; rekurzivní algoritmy; rozděl a panuj; sled; smyčka; souvislý graf; stupeň vrcholu; tah; teorie grafů; Theta; algorithm; asymptotic notation; Bellman-Ford algorithm; complete graph; degree of a vertex; Dijkstra's algorithm; directed graph; divide and conquer algorithms; dynamic programming; Floyd-Warshall algorithm; genetic algorithms; graph teory; greedy algorithms; heuristic algorithms; Java; loop; move; Omega; Omicron; paralel algorithms; path; path planning; recursive algorithms; regular graph; sequence; the shortest path; Theta; undirected graph; weighted graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jágr, P. (2019). Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56214

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

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2019. Thesis, Brno University of Technology. Accessed September 28, 2020. http://hdl.handle.net/11012/56214.

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

MLA Handbook (7th Edition):

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2019. Web. 28 Sep 2020.

Vancouver:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/11012/56214.

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

Council of Science Editors:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56214

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


Brno University of Technology

30. Matula, Radek. Grafická reprezentace grafů: Graphics Graph Representation.

Degree: 2018, Brno University of Technology

 This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph(more)

Subjects/Keywords: Teorie grafů; vrchol; hrana; ohodnocený graf; orientovaný graf; matice sousednosti; matice vzdáleností; matice incidence; Laplaceova matice; seznam sousedů; seznam vrcholů a hran; algoritmus High-Dimensional Embedding; algoritmus založený na silách; pružinový algoritmus; algoritmus Kamada-Kawai; algoritmus Fruchterman-Reingold; Graph theory; vertex; edge; edge-weighted graph; directed graph; adjacency matrix; distance matrix; incidence matrix; Laplacian matrix; list of neighbors; list of vertices and edges; mapping vertices on the circle; High-Dimensional Embedding algorithm; Force-based algorithm; Spring algorithm; Kamada-Kawai algorithm; Fruchterman-Reingold algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Matula, R. (2018). Grafická reprezentace grafů: Graphics Graph Representation. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53896

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

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Thesis, Brno University of Technology. Accessed September 28, 2020. http://hdl.handle.net/11012/53896.

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

MLA Handbook (7th Edition):

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Web. 28 Sep 2020.

Vancouver:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Sep 28]. Available from: http://hdl.handle.net/11012/53896.

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

Council of Science Editors:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53896

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

[1] [2]

.