43 search results - page 1 / 9 » Kron Reduction of Graphs with Applications to Electrical Net... |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
ECML
2005
Springer
14 years 3 months ago
2005
Springer
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
JCO
2010
13 years 8 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...