Image de couverture de livre

Simultaneous recovery of a sparse topology and the admittance of an electrical network

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Samperio, Álvaro
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control 94C15 (Primary) 05C85, 05C90 (Secondary) G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
par: Koutsoutis, Alex, et autres
Publié: (2025)

On the Number of Degenerate Simplex Pivots
par: Kukharenko, Kirill, et autres
Publié: (2023)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP
par: Sun, Chunlin, et autres
Publié: (2023)

How Local Separators Shape Community Structure in Large Networks
par: Frenkel, Sarah, et autres
Publié: (2025)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
par: Hikima, Yuya, et autres
Publié: (2024)

On the Complexity of the Bilevel Shortest Path Problem
par: Henke, Dorothee, et autres
Publié: (2024)

Games on deBruijn Graphs and Cycle Means
par: Drenska, Nadejda
Publié: (2026)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

Measuring Ransomware Lateral Movement Susceptibility via Privilege-Weighted Adjacency Matrix Exponentiation
par: Tyagi, Satyam, et autres
Publié: (2025)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
par: McFarland, Caleb
Publié: (2026)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Designing Capacitated Subnetworks for Shortest Path Routing
par: Chimani, Markus, et autres
Publié: (2026)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
par: Warme, David M.
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
par: Warme, David M.
Publié: (2024)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
par: De Meyer, Lucas
Publié: (2025)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
par: Lalou, Mohammed, et autres
Publié: (2025)

A new density limit for unanimity in majority dynamics on random graphs
par: Kim, Jeong Han, et autres
Publié: (2025)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
par: Cheng, Cong-Dian
Publié: (2017)

Identifying faulty edges in resistive electrical networks
par: Fiedorowicz, Barbara, et autres
Publié: (2025)

A topological decoupling of modified nodal analysis including controlled sources
par: Garcia, Idoia Cortes, et autres
Publié: (2026)

Caterpillar GNN: Replacing Message Passing with Efficient Aggregation
par: Černý, Marek
Publié: (2025)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
par: Dau, Son Hoang, et autres
Publié: (2022)

Towards a dichotomy for the switch list homomorphism problem for signed graphs
par: Kim, Hyobin, et autres
Publié: (2021)

Forbidden paths and cycles in the undirected underlying graph of a 2-quasi best match graph
par: Korchmaros, Annachiara
Publié: (2024)

Merge Trees of Periodic Filtrations
par: Edelsbrunner, Herbert, et autres
Publié: (2024)

Revisiting Madigan and Mosurski: Collapsibility via Minimal Separators
par: Heng, Pei, et autres
Publié: (2025)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
par: Aref, Samin, et autres
Publié: (2025)

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
par: Geniet, Colin, et autres
Publié: (2022)

Bayesian Linear Programming under Learned Uncertainty: Posterior Feasibility Guarantees, Scenario Certification, and Applications
par: Chatterjee, Debashis
Publié: (2026)

Recolouring Homomorphisms to triangle-free reflexive graphs
par: Lee, Jae-baek, et autres
Publié: (2021)

Hypertrees and their host trees: a survey
par: Di Fonzo, Pablo De Caria
Publié: (2025)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

On the Wasserstein alignment problem
par: Pal, Soumik, et autres
Publié: (2025)

On treewidth and maximum cliques
par: Chudnovsky, Maria, et autres
Publié: (2024)

On Chollet's Permanent Conjecture for Graph Laplacians
par: Pant, Priyanshu, et autres
Publié: (2026)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
par: Renani, Neda Bagheri, et autres
Publié: (2025)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
par: Dahlmeier, J Niklas, et autres
Publié: (2025)