- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.076 seconds)Spelling suggestions: "subject:"bipartiter graph"" "subject:"bipartiter raph""
| 1 |
A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite GraphsHelmberg, Christoph, Rocha, Israel, Schwerdtfeger, Uwe 13 November 2015 (has links) (PDF)
We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph. This is accomplished by solving the dual graph embedding problem which arises from a semidefinite programming formulation. In particular, the problem for trees can be solved in time cubic in the number of vertices.
|
| 2 |
A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite GraphsHelmberg, Christoph, Rocha, Israel, Schwerdtfeger, Uwe 13 November 2015 (has links)
We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph. This is accomplished by solving the dual graph embedding problem which arises from a semidefinite programming formulation. In particular, the problem for trees can be solved in time cubic in the number of vertices.
|
| 3 |
Convex mathematical programs for relational matching of object viewsSchellewald, Christian. Unknown Date (has links) (PDF)
University, Diss., 2005--Mannheim. / Erscheinungsjahr an der Haupttitelstelle: 2004.
|
Page generated in 0.0809 seconds