Advanced search options

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

You searched for `subject:(Graph Laplacians)`

.
Showing records 1 – 4 of
4 total matches.

▼ Search Limiters

Penn State University

1.
Chen, Yao.
Algebraic Multilevel Methods for *Graph* * Laplacians*.

Degree: 2012, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/15362

► This dissertation presents estimates of the convergence rate and computational complexity of an algebraic multilevel preconditioner of *graph* Laplacian problems. The aim is to construct…
(more)

Subjects/Keywords: Algebraic Multigrid Methods; Graph Laplacians; Parallel Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, Y. (2012). Algebraic Multilevel Methods for Graph Laplacians. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/15362

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Chen, Yao. “Algebraic Multilevel Methods for Graph Laplacians.” 2012. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/15362.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Yao. “Algebraic Multilevel Methods for Graph Laplacians.” 2012. Web. 07 Mar 2021.

Vancouver:

Chen Y. Algebraic Multilevel Methods for Graph Laplacians. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/15362.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen Y. Algebraic Multilevel Methods for Graph Laplacians. [Thesis]. Penn State University; 2012. Available from: https://submit-etda.libraries.psu.edu/catalog/15362

Not specified: Masters Thesis or Doctoral Dissertation

University of Colorado

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

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

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

Fox, Alyson Lindsey. “Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Web. 07 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 07]. 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

3. Deweese, Kevin. Bridging the Theory-Practice Gap of Laplacian Linear Solvers.

Degree: 2018, University of California – eScholarship, University of California

URL: http://www.escholarship.org/uc/item/24p9q28q

► Solving Laplacian linear systems is an important task in a variety of practical and theoretical applications. *Laplacians* of structured graphs, such as two and three…
(more)

Subjects/Keywords: Applied mathematics; Computer science; cycle toggling; genetic graph evolution; graph Laplacians; heavy path graphs; KOSZ; linear solvers

…which often require the solution of elliptic partial differential equations. *Graph* *Laplacians*… …embedding representing the physical system.
Another traditional application of *graph* *Laplacians* is… …Normalized *Laplacians*
The normalized Laplacian of a *graph* is the matrix N = D−1/2 LD−1/2 , whose… …applications. *Laplacians* of structured graphs, such as two and three dimensional meshes, have long… …systems on the *Laplacians* of large graphs without mesh-like
structure has emerged as an…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Deweese, K. (2018). Bridging the Theory-Practice Gap of Laplacian Linear Solvers. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/24p9q28q

Not specified: Masters Thesis or Doctoral Dissertation

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

Deweese, Kevin. “Bridging the Theory-Practice Gap of Laplacian Linear Solvers.” 2018. Thesis, University of California – eScholarship, University of California. Accessed March 07, 2021. http://www.escholarship.org/uc/item/24p9q28q.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Deweese, Kevin. “Bridging the Theory-Practice Gap of Laplacian Linear Solvers.” 2018. Web. 07 Mar 2021.

Vancouver:

Deweese K. Bridging the Theory-Practice Gap of Laplacian Linear Solvers. [Internet] [Thesis]. University of California – eScholarship, University of California; 2018. [cited 2021 Mar 07]. Available from: http://www.escholarship.org/uc/item/24p9q28q.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Deweese K. Bridging the Theory-Practice Gap of Laplacian Linear Solvers. [Thesis]. University of California – eScholarship, University of California; 2018. Available from: http://www.escholarship.org/uc/item/24p9q28q

Not specified: Masters Thesis or Doctoral Dissertation

4. Ricatte, Thomas. Hypernode graphs for learning from binary relations between sets of objects : Un modèle d'hypergraphes pour apprendre des relations binaires entre des ensembles d'objets.

Degree: Docteur es, Informatique, 2015, Lille 3

URL: http://www.theses.fr/2015LIL30001

Cette étude a pour sujet les hypergraphes.

This study has for subject the hypergraphs.

Subjects/Keywords: Hypergraphes; Laplaciens de graphe; Noyaux de graphe; Apprentissage spectral; Apprentissage semi-supervisé; Algorithmes de skill rating; Hypergraphs; Graph laplacians; Graph kernels; Spectral learning; Semi-supervised learning; Skill rating algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ricatte, T. (2015). Hypernode graphs for learning from binary relations between sets of objects : Un modèle d'hypergraphes pour apprendre des relations binaires entre des ensembles d'objets. (Doctoral Dissertation). Lille 3. Retrieved from http://www.theses.fr/2015LIL30001

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

Ricatte, Thomas. “Hypernode graphs for learning from binary relations between sets of objects : Un modèle d'hypergraphes pour apprendre des relations binaires entre des ensembles d'objets.” 2015. Doctoral Dissertation, Lille 3. Accessed March 07, 2021. http://www.theses.fr/2015LIL30001.

MLA Handbook (7^{th} Edition):

Ricatte, Thomas. “Hypernode graphs for learning from binary relations between sets of objects : Un modèle d'hypergraphes pour apprendre des relations binaires entre des ensembles d'objets.” 2015. Web. 07 Mar 2021.

Vancouver:

Ricatte T. Hypernode graphs for learning from binary relations between sets of objects : Un modèle d'hypergraphes pour apprendre des relations binaires entre des ensembles d'objets. [Internet] [Doctoral dissertation]. Lille 3; 2015. [cited 2021 Mar 07]. Available from: http://www.theses.fr/2015LIL30001.

Council of Science Editors:

Ricatte T. Hypernode graphs for learning from binary relations between sets of objects : Un modèle d'hypergraphes pour apprendre des relations binaires entre des ensembles d'objets. [Doctoral Dissertation]. Lille 3; 2015. Available from: http://www.theses.fr/2015LIL30001