Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"vertex weighted graph"”.

  1. Path and cycle hitting problems: algorithms and complexity

    Most graph-theoretic problems are known to be NP-complete on general graphs. It is considered unlikely that there exist polynomial-time algorithms for solving them. Motivated by the fact that many of these problems have real-world applications, researchers have been primarily focused on designing …

    greece Repository record for Path and cycle hitting problems: algorithms and complexity (opens in a new tab)

  2. On Properties of r<sub>w</sub>-Regular Graphs

    If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition …

    etsu Repository record for On Properties of r<sub>w</sub>-Regular Graphs (opens in a new tab) Download PDF for On Properties of r<sub>w</sub>-Regular Graphs (opens in a new tab)

  3. Vertex Weighted Spectral Clustering

    … into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of …

    etsu Repository record for Vertex Weighted Spectral Clustering (opens in a new tab) Download PDF for Vertex Weighted Spectral Clustering (opens in a new tab)