Maria Predari
Biographic Data
| ID | 8548485 |
|---|---|
| NAME | Maria Predari |
| GIVEN NAMES | Maria |
| FAMILY NAME | Predari |
| SIGNATURE | PREDARI M |
| AFFILIATIONS | Humboldt-Universität zu Berlin |
| ORCID | 0000-0002-9545-0623 |
| VERIFIED | No |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 1 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2023 |
| LATEST PUBLICATION YEAR | 2023 |
| H-INDEX | 0 |
Greedy optimization of resistance-based graph robustness with global and local edge insertions
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph G . We consider two optimization problems of adding k new edges to G such that the resulting graph has minimal total effective resistance (i.e., is most robust)—one where the new edges can be anywhere in the graph and one where the new edges need to be incident to a specified focus node. The total effective resistance and effective resistanc…
No prominent works on this page.
Greedy optimization of resistance-based graph robustness with global and local edge insertions
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph G . We consider two optimization problems of adding k new edges to G such that the resulting graph has minimal total effective resistance (i.e., is most robust)—one where the new edges can be anywhere in the graph and one where the new edges need to be incident to a specified focus node. The total effective resistance and effective resistanc…
Advanced Graph Neural Networks (1 work) · Algorithm (1 work) · Artificial Intelligence (1 work) · Complex Network Analysis Techniques (1 work) · Computer Science (1 work) · Graph (1 work) · Graph bandwidth (1 work) · Graph theory and applications (1 work) · Greedy algorithm (1 work) · Laplacian matrix (1 work)