On the public citation graph

Minimizing Effective Resistance of a Graph

0 signed · 446 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/1097-461x(2001)81:1<29::aid-qua6>3.0.co;2-yopenalex-snapshot
Resistance distance in graphs and random walks
inferredcites →https://doi.org/10.1007/978-0-387-31256-9openalex-snapshot
Convex Analysis and Nonlinear Optimization
inferredcites →https://doi.org/10.1007/978-1-4757-9859-3openalex-snapshot
Convex analysis and nonlinear optimization : theory and examples
inferredcites →https://doi.org/10.1007/bf01164627openalex-snapshot
Resistance distance
inferredcites →https://doi.org/10.1007/s00214-003-0460-4openalex-snapshot
Resistance distance and Laplacian spectrum
inferredcites →https://doi.org/10.1016/0012-365x(93)90538-5openalex-snapshot
Some minimax problems for graphs
inferredcites →https://doi.org/10.1016/0024-3795(85)90187-9openalex-snapshot
Properties of Euclidean and non-Euclidean distance matrices
inferredcites →https://doi.org/10.1016/j.jpdc.2006.08.010openalex-snapshot
Distributed average consensus with least-mean-square deviation
inferredcites →https://doi.org/10.1016/j.laa.2006.03.006openalex-snapshot
Upper bounds on algebraic connectivity via convex optimization
inferredcites →https://doi.org/10.1016/j.sysconle.2004.02.022openalex-snapshot
Fast linear iterations for distributed averaging
inferredcites →https://doi.org/10.1016/s0024-3795(02)00538-4openalex-snapshot
On graphs with algebraic connectivity equal to minimum edge density
inferredcites →https://doi.org/10.1016/s0024-3795(97)10022-2openalex-snapshot
Some characterizations of symmetric inverse M-matrices
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1017/cbo9780511840371openalex-snapshot
Topics in Matrix Analysis
inferredcites →https://doi.org/10.1063/1.1697872openalex-snapshot
The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers
inferredcites →https://doi.org/10.1063/1.1722193openalex-snapshot
Concavity of Resistance Functions
inferredcites →https://doi.org/10.1080/03081089008817967openalex-snapshot
Absolute algebraic connectivity of trees
inferredcites →https://doi.org/10.1080/10556789908805766openalex-snapshot
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
inferredcites →https://doi.org/10.1080/15427951.2005.10129100openalex-snapshot
Symmetry Analysis of Reversible Markov Chains
inferredcites →https://doi.org/10.1137/050639430openalex-snapshot
Embedded in the Shadow of the Separator
inferredcites →https://doi.org/10.1137/s0036144503423264openalex-snapshot
Fastest Mixing Markov Chain on a Graph
inferredcites →https://doi.org/10.1137/s0036144504443821openalex-snapshot
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
inferredcites →https://doi.org/10.1145/369691.369734openalex-snapshot
Design of robust global power and ground networks
inferredcites →https://doi.org/10.1145/73007.73062openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferredcites →https://doi.org/10.21136/cmj.1973.101168openalex-snapshot
Algebraic connectivity of graphs
inferredcites →https://doi.org/10.2172/947970openalex-snapshot
DSDP5 user guide - software for semidefinite programming.
inferredcites →https://doi.org/10.4171/022-3/63openalex-snapshot
Convex optimization of graph Laplacian eigenvalues
inferredcites →https://doi.org/10.5860/choice.31-0986openalex-snapshot
Optimal design of experiments
inferredcites →https://doi.org/10.5948/upo9781614440222openalex-snapshot
Random Walks and Electric Networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.23932523zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1002/3527600434.eap726openalex-snapshot
Graph and Network Theory
inferred← citeshttps://doi.org/10.1002/9781119266235.ch8openalex-snapshot
Topology Design and Identification for Dynamic Networks
inferred← citeshttps://doi.org/10.1002/jnm.1881openalex-snapshot
Error bounds for reduction of multi‐port resistor networks
inferred← citeshttps://doi.org/10.1002/nla.70041openalex-snapshot
Sensitivity of Perron and Fiedler Eigenpairs to Structural Perturbations of a Network
inferred← citeshttps://doi.org/10.1002/qua.24740openalex-snapshot
Effective resistances for ladder‐like chains
inferred← citeshttps://doi.org/10.1007/11786986_42openalex-snapshot
Design Is as Easy as Optimization
inferred← citeshttps://doi.org/10.1007/16618_2023_57openalex-snapshot
On Semicircular Elements Induced by Connected Finite Graphs
inferred← citeshttps://doi.org/10.1007/978-1-0716-4546-8_10openalex-snapshot
Scalable Epidemic Simulation Using FAVITES-Lite
inferred← citeshttps://doi.org/10.1007/978-1-4614-0857-4_4openalex-snapshot
Joint Optimization of Resources and Routes for Minimum Resistance: From Communication Networks to Power Grids
inferred← citeshttps://doi.org/10.1007/978-3-030-05411-3_64openalex-snapshot
A Genetic Algorithm for Enhancing the Robustness of Complex Networks Through Link Protection
inferred← citeshttps://doi.org/10.1007/978-3-030-14082-3_6openalex-snapshot
A Quantum Algorithm for Minimising the Effective Graph Resistance upon Edge Addition
inferred← citeshttps://doi.org/10.1007/978-3-030-36687-2_18openalex-snapshot
Change Point Detection in a Dynamic Stochastic Blockmodel
inferred← citeshttps://doi.org/10.1007/978-3-030-36687-2_61openalex-snapshot
Comparative Network Robustness Evaluation of Link Attacks
inferred← citeshttps://doi.org/10.1007/978-3-031-21131-7_33openalex-snapshot
Incremental Computation of Effective Graph Resistance for Improving Robustness of Complex Networks: A Comparative Study
inferred← citeshttps://doi.org/10.1007/978-3-031-23929-8_2openalex-snapshot
Effective Resistance Based Weight Thresholding for Community Detection
inferred← citeshttps://doi.org/10.1007/978-3-031-85386-9_14openalex-snapshot
Community Detection in Complex Networks Exploiting Spectral Graph Sparsification for Efficient Disaster Response
inferred← citeshttps://doi.org/10.1007/978-3-031-87804-6_3openalex-snapshot
An Exploration of Graph Distances, Graph Curvature, and Applications to Network Analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-02315-5_7openalex-snapshot
Vertex-Glued Connected Finite Graphs and Mutually Free Semicircular Elements
inferred← citeshttps://doi.org/10.1007/978-3-319-09333-8_19openalex-snapshot
Computing the Kirchhoff Index of Some xyz-Transformations of Regular Molecular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-15010-9_5openalex-snapshot
Network Topology Design for UAV Swarming with Wind Gusts
inferred← citeshttps://doi.org/10.1007/978-3-319-22216-5_2openalex-snapshot
Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-22216-5_3openalex-snapshot
Transmission of Energy
inferred← citeshttps://doi.org/10.1007/978-3-319-55550-8_3openalex-snapshot
Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_10openalex-snapshot
Minimizing Landscape Resistance for Habitat Conservation
inferred← citeshttps://doi.org/10.1007/978-3-319-68022-4_5openalex-snapshot
Averaging with Exogenous Inputs and Electrical Networks
inferred← citeshttps://doi.org/10.1007/978-90-481-9707-1_34openalex-snapshot
UAV Swarms: Models and Effective Interfaces
inferred← citeshttps://doi.org/10.1007/978-981-13-1471-1_5openalex-snapshot
Multi-objective Optimization to Improve Robustness in Networks
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_24openalex-snapshot
Approximating Total Effective Resistance Minimization with Small Budget
inferred← citeshttps://doi.org/10.1007/s00010-024-01096-8openalex-snapshot
Mathematical models of functional extreme leaning machins: operator-algebraic and free-probabilistic approaches
inferred← citeshttps://doi.org/10.1007/s00034-026-03598-zopenalex-snapshot
Enumeration of Resistance Distances for Two Classes of Edge Blow-Up Graphs
inferred← citeshttps://doi.org/10.1007/s00285-023-01937-1openalex-snapshot
Spectral dynamics of guided edge removals and identifying transient amplifiers for death–Birth updating
inferred← citeshttps://doi.org/10.1007/s00332-010-9088-4openalex-snapshot
Synchronization of Coupled Limit Cycles
inferred← citeshttps://doi.org/10.1007/s00332-020-09674-1openalex-snapshot
Nonlinear Network Dynamics with Consensus–Dissensus Bifurcation
inferred← citeshttps://doi.org/10.1007/s00365-017-9365-7openalex-snapshot
Spectrally Optimized Pointset Configurations
inferred← citeshttps://doi.org/10.1007/s00422-012-0481-yopenalex-snapshot
Shaping bursting by electrical coupling and noise
inferred← citeshttps://doi.org/10.1007/s00500-019-04470-wopenalex-snapshot
A novel measure of edge and vertex centrality for assessing robustness in complex networks
inferred← citeshttps://doi.org/10.1007/s10107-010-0344-zopenalex-snapshot
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
inferred← citeshttps://doi.org/10.1007/s10107-020-01590-2openalex-snapshot
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
inferred← citeshttps://doi.org/10.1007/s10589-021-00270-xopenalex-snapshot
A Laplacian approach to $$\ell _1$$-norm minimization
inferred← citeshttps://doi.org/10.1007/s10618-015-0447-5openalex-snapshot
Optimizing network robustness by edge rewiring: a general framework
inferred← citeshttps://doi.org/10.1007/s10846-019-01039-5openalex-snapshot
Stochastic Multi-Robot Patrolling with Limited Visibility
inferred← citeshttps://doi.org/10.1007/s11222-024-10527-0openalex-snapshot
The polytope of optimal approximate designs: extending the selection of informative experiments
inferred← citeshttps://doi.org/10.1007/s11227-025-07578-zopenalex-snapshot
Estimating graph robustness through the Kirchhoff index and sampling techniques
inferred← citeshttps://doi.org/10.1007/s11785-023-01456-3openalex-snapshot
Free Probability on the Limit $$C^{*}$$-Algebra Induced by a Chain of Graphs
inferred← citeshttps://doi.org/10.1007/s12190-024-02225-xopenalex-snapshot
Mathematical analysis for interacting multi functional extreme learning machines
inferred← citeshttps://doi.org/10.1007/s13278-023-01137-1openalex-snapshot
Greedy optimization of resistance-based graph robustness with global and local edge insertions
inferred← citeshttps://doi.org/10.1007/s40314-025-03154-6openalex-snapshot
RDDGN: minimizing the total resistance distance and diameter using graph neural networks
inferred← citeshttps://doi.org/10.1007/s40324-017-0108-2openalex-snapshot
Computing the smallest eigenpairs of the graph Laplacian
inferred← citeshttps://doi.org/10.1007/s41109-023-00569-0openalex-snapshot
Comparative evaluation of strategies for improving the robustness of complex networks
inferred← citeshttps://doi.org/10.1007/s41109-025-00739-2openalex-snapshot
Disrupting road networks: a case study on the vulnerabilities of the city of Messina
inferred← citeshttps://doi.org/10.1007/s43036-021-00163-0openalex-snapshot
The semicircular law of free probability as noncommutative multivariable operator theory
inferred← citeshttps://doi.org/10.1016/j.aam.2018.07.002openalex-snapshot
The maximum relaxation time of a random walk
inferred← citeshttps://doi.org/10.1016/j.aam.2024.102733openalex-snapshot
Simplicial Kirchhoff index of random complexes
inferred← citeshttps://doi.org/10.1016/j.amc.2016.05.003openalex-snapshot
The Kirchhoff indices and the matching numbers of unicyclic graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126036openalex-snapshot
The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129354openalex-snapshot
Computation of resistance distances and Kirchhoff indices for two classes of graphs
inferred← citeshttps://doi.org/10.1016/j.apmt.2020.100674openalex-snapshot
Analytical transport network theory & structural mechanics: Towards computationally inexpensive multi-functional materials design
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2012.03.003openalex-snapshot
Performance metrics in the average consensus problem: A tutorial
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111264openalex-snapshot
Graph-theoretic approaches for analyzing the resilience of distributed control systems: A tutorial and survey
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111922openalex-snapshot
Modelling of memristor networks and the effective memristor
inferred← citeshttps://doi.org/10.1016/j.chaos.2025.116897openalex-snapshot
Analytical study of resistance distance and Kirchhoff index under edge perturbations in weighted graphs
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.12.013openalex-snapshot
Robust network planning in nonuniform traffic scenarios
inferred← citeshttps://doi.org/10.1016/j.commatsci.2025.114194openalex-snapshot
Van der Waals-driven network restructuring explains time-dependent piezoresistivity in soft nanocomposites
inferred← citeshttps://doi.org/10.1016/j.dam.2011.09.017openalex-snapshot
The Kirchhoff indices of join networks
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.008openalex-snapshot
The Kirchhoff indexes of some composite networks
inferred← citeshttps://doi.org/10.1016/j.dam.2014.02.015openalex-snapshot
The Kirchhoff index of subdivisions of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.014openalex-snapshot
Comparison theorems on resistance distances and Kirchhoff indices of S , T -isomers
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.039openalex-snapshot
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.010openalex-snapshot
On the Kirchhoff index of graphs with diameter 2
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.007openalex-snapshot
The resistance perturbation distance: A metric for the analysis of dynamic networks
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.012openalex-snapshot
Algorithmic techniques for finding resistance distances on structured graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112387openalex-snapshot
Resistance distance of blowups of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114327openalex-snapshot
Resistance distance and Kirchhoff index of unbalanced blowups of graphs
inferred← citeshttps://doi.org/10.1016/j.esr.2025.101660openalex-snapshot
Robustness and resilience of energy systems to extreme events: A review of assessment methods and strategies
inferred← citeshttps://doi.org/10.1016/j.fraope.2023.100014openalex-snapshot
Robust edge weight synthesis for LPV multi-agent systems with integral quadratic constraints
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.10.293openalex-snapshot
Customized algorithms for growing connected resistive networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.10.401openalex-snapshot
Complexities and Performance Limitations in Growing Time-Delay Noisy Linear Consensus Networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1278openalex-snapshot
Network Design in the Presence of a Link Jammer: a Zero-Sum Game Formulation
inferred← citeshttps://doi.org/10.1016/j.ifacol.2019.12.140openalex-snapshot
Augmented Consensus Algorithm for Discrete-time Dynamical Systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2024.10.107openalex-snapshot
On the Optimal Communication Weights in Distributed Optimization Algorithms
inferred← citeshttps://doi.org/10.1016/j.ijepes.2013.11.009openalex-snapshot
On eigenvalues to the Y-bus matrix
inferred← citeshttps://doi.org/10.1016/j.jmaa.2021.125728openalex-snapshot
Hubs-biased resistance distances on graphs and networks
inferred← citeshttps://doi.org/10.1016/j.jpowsour.2017.10.053openalex-snapshot
Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 2. Flow with reactions
inferred← citeshttps://doi.org/10.1016/j.jpowsour.2017.10.061openalex-snapshot
Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions
inferred← citeshttps://doi.org/10.1016/j.jspi.2024.106200openalex-snapshot
Mixed-integer linear programming for computing optimal experimental designs
inferred← citeshttps://doi.org/10.1016/j.laa.2008.10.027openalex-snapshot
Characterization of symmetric M-matrices as resistive inverses
inferred← citeshttps://doi.org/10.1016/j.laa.2009.05.032openalex-snapshot
Kirchhoff Indexes of a network
inferred← citeshttps://doi.org/10.1016/j.laa.2012.01.017openalex-snapshot
The communicability distance in graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2013.08.039openalex-snapshot
The Moore–Penrose inverse of the normalized graph Laplacian
inferred← citeshttps://doi.org/10.1016/j.laa.2018.01.026openalex-snapshot
Resistance distances in extended or contracted networks
inferred← citeshttps://doi.org/10.1016/j.laa.2018.04.003openalex-snapshot
Moore–Penrose inverse of the incidence matrix of a distance regular graph
inferred← citeshttps://doi.org/10.1016/j.laa.2021.05.012openalex-snapshot
Kirchhoff index of simplicial networks
inferred← citeshttps://doi.org/10.1016/j.laa.2022.01.002openalex-snapshot
Effective resistance is more than distance: Laplacians, Simplices and the Schur complement
inferred← citeshttps://doi.org/10.1016/j.neucom.2020.12.075openalex-snapshot
NetKI: A kirchhoff index based statistical graph embedding in nearly linear time
inferred← citeshttps://doi.org/10.1016/j.neucom.2026.133016openalex-snapshot
CBERR: Community-based effective resistance graph rewiring
inferred← citeshttps://doi.org/10.1016/j.orl.2023.10.002openalex-snapshot
Minimizing the effective graph resistance by adding links is NP-hard
inferred← citeshttps://doi.org/10.1016/j.patrec.2026.07.034openalex-snapshot
Modular effective resistance-guided multi-scale graph representation learning
inferred← citeshttps://doi.org/10.1016/j.physa.2023.129241openalex-snapshot
Rewiring or adding links: A real-world case study of network vulnerability
inferred← citeshttps://doi.org/10.1016/j.pmcj.2025.102106openalex-snapshot
Efficient community detection in disaster networks using spectral sparsification
inferred← citeshttps://doi.org/10.1016/j.procs.2011.04.021openalex-snapshot
A measure of the local connectivity between graph vertices
inferred← citeshttps://doi.org/10.1016/j.procs.2021.04.218openalex-snapshot
Disrupting the Connectivity of Multiagent Peering Networks: a Model Study
inferred← citeshttps://doi.org/10.1016/j.socnet.2013.05.003openalex-snapshot
Resistance distance, closeness, and betweenness
inferred← citeshttps://doi.org/10.1016/j.sysconle.2014.05.008openalex-snapshot
A distributed solution to the network reconstruction problem
inferred← citeshttps://doi.org/10.1016/j.sysconle.2017.02.007openalex-snapshot
Sparsity-promoting optimal control of systems with symmetries, consensus and synchronization networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114066openalex-snapshot
Modeling spatial networks by contact graphs of disk packings
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114700openalex-snapshot
Resistance distances in directed graphs: Definitions, properties, and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115102openalex-snapshot
Diagonal of pseudoinverse of graph Laplacian: Fast estimation and exact results
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116133openalex-snapshot
Approximating total effective resistance minimization with small budget
inferred← citeshttps://doi.org/10.1017/nws.2014.4openalex-snapshot
Structure of complex networks: Quantifying edge-to-edge relations by failure-induced flow redistribution
inferred← citeshttps://doi.org/10.1038/srep40642openalex-snapshot
Inferring Centrality from Network Snapshots
inferred← citeshttps://doi.org/10.1051/m2an/2023102openalex-snapshot
Optimizing network robustness via Krylov subspaces
inferred← citeshttps://doi.org/10.1051/mmnp/2025009openalex-snapshot
Geometries of mixed graphs in complex vector spaces. Hierarchies and clusters in complex networks
inferred← citeshttps://doi.org/10.1063/5.0259197openalex-snapshot
Corona covering number of graphs
inferred← citeshttps://doi.org/10.1063/5.0338320openalex-snapshot
Vertex-level diffusion scaling from resistance distance
inferred← citeshttps://doi.org/10.1080/00150517.2025.2522433openalex-snapshot
An Introductory Survey of Recursions in the Computation of Resistance Distance
inferred← citeshttps://doi.org/10.1080/00207179.2025.2503305openalex-snapshot
A Stackelberg game for optimal control energy of multi-agent networks under cyber-attacks
inferred← citeshttps://doi.org/10.1080/03081087.2016.1256945openalex-snapshot
Effective resistances and Kirchhoff index in subdivision networks
inferred← citeshttps://doi.org/10.1080/03081087.2018.1499704openalex-snapshot
Green's function in partial subdivision networks
inferred← citeshttps://doi.org/10.1080/03081087.2024.2349197openalex-snapshot
Quantum hitting time according to a given distribution
inferred← citeshttps://doi.org/10.1080/15427951.2012.715115openalex-snapshot
Approximations of the Generalized Inverse of the Graph Laplacian Matrix
inferred← citeshttps://doi.org/10.1088/1367-2630/16/10/105015openalex-snapshot
Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation
inferred← citeshttps://doi.org/10.1088/1367-2630/ac14acopenalex-snapshot
Path Laplacians versus fractional Laplacians as nonlocal operators on networks
inferred← citeshttps://doi.org/10.1088/1742-5468/2011/11/p11018openalex-snapshot
The correlation of metrics in complex networks with applications in functional brain networks
inferred← citeshttps://doi.org/10.1088/1742-5468/2015/11/p11024openalex-snapshot
Corona graphs as a model of small-world networks
inferred← citeshttps://doi.org/10.1088/1742-5468/abfcb5openalex-snapshot
Random walks on networks with preferential cumulative damage: generation of bias and aging
inferred← citeshttps://doi.org/10.1088/1742-5468/ac57baopenalex-snapshot
Resistance distance distribution in large sparse random graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1245/1/012081openalex-snapshot
Network Analysis of Saccharomyces cerevisiae
inferred← citeshttps://doi.org/10.1088/1742-6596/1306/1/012031openalex-snapshot
On Edge Irregular Total k-labeling and Total Edge Irregularity Strength of Barbell Graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1767/1/012009openalex-snapshot
Detour homometric number of a graph
inferred← citeshttps://doi.org/10.1088/1751-8113/44/7/075102openalex-snapshot
Effect of trap position on the efficiency of trapping in treelike scale-free networks
inferred← citeshttps://doi.org/10.1088/1751-8113/47/37/375203openalex-snapshot
Resistance distances in composite graphs
inferred← citeshttps://doi.org/10.1088/1751-8121/acc144openalex-snapshot
A measure of dissimilarity between diffusive processes on networks
inferred← citeshttps://doi.org/10.1088/1755-1315/1615/1/012070openalex-snapshot
Graph-Theoretic and AI Approaches to Smart Urban Mobility Systems: A Survey
inferred← citeshttps://doi.org/10.1088/2632-072x/ac730dopenalex-snapshot
Discrete curvature on graphs from the effective resistance*
inferred← citeshttps://doi.org/10.1090/ecgd/287openalex-snapshot
Modulus on graphs as a generalization of standard graph theoretic quantities
inferred← citeshttps://doi.org/10.1090/qam/1576openalex-snapshot
A primal-dual optimization strategy for elliptic partial differential equations
inferred← citeshttps://doi.org/10.1093/comjnl/bxab132openalex-snapshot
Benchmark for Discriminating Power of Edge Centrality Metrics
inferred← citeshttps://doi.org/10.1093/comjnl/bxac052openalex-snapshot
Resistance Distances In Simplicial Networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxv014openalex-snapshot
Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network
inferred← citeshttps://doi.org/10.1093/comjnl/bxz080openalex-snapshot
Hitting Times for Random Walks on Sierpiński Graphs and Hierarchical Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxz141openalex-snapshot
Spectra, Hitting Times and Resistance Distances ofq- Subdivision Graphs
inferred← citeshttps://doi.org/10.1093/comnet/cnaf052openalex-snapshot
Feature-based network construction: from sampling to what-if analysis
inferred← citeshttps://doi.org/10.1093/comnet/cnx021openalex-snapshot
Fast link prediction for large networks using spectral embedding
inferred← citeshttps://doi.org/10.1093/comnet/cnx043openalex-snapshot
Random multi-hopper model: super-fast random walks on graphs
inferred← citeshttps://doi.org/10.1101/842732openalex-snapshot
An edge-based formulation of elastic network models
inferred← citeshttps://doi.org/10.1103/6bph-n6zjopenalex-snapshot
Electrical transport in tunably disordered metamaterials
inferred← citeshttps://doi.org/10.1103/physreve.101.062147openalex-snapshot
Random walks on networks with stochastic resetting
inferred← citeshttps://doi.org/10.1103/physreve.106.044139openalex-snapshot
Random walks on complex networks under time-dependent stochastic resetting
inferred← citeshttps://doi.org/10.1103/physreve.81.031118openalex-snapshot
Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
inferred← citeshttps://doi.org/10.1103/physreve.85.066122openalex-snapshot
Complex networks in the Euclidean space of communicability distances
inferred← citeshttps://doi.org/10.1103/physreve.89.012801openalex-snapshot
Resiliently evolving supply-demand networks
inferred← citeshttps://doi.org/10.1103/physreve.96.032311openalex-snapshot
Pseudoinverse of the Laplacian and best spreader node in a network
inferred← citeshttps://doi.org/10.1103/physrevlett.133.067401openalex-snapshot
Braess’s Paradox Analog in Physical Networks of Optimal Exploration
inferred← citeshttps://doi.org/10.1103/physrevresearch.1.033211openalex-snapshot
Edge-based formulation of elastic network models
inferred← citeshttps://doi.org/10.1103/prxquantum.4.010313openalex-snapshot
Advantages and Limitations of Quantum Routing
inferred← citeshttps://doi.org/10.1109/acc.2010.5531506openalex-snapshot
Robustness of noisy consensus dynamics with directed communication
inferred← citeshttps://doi.org/10.1109/acc.2012.6315116openalex-snapshot
On the optimal synchronization of oscillator networks via sparse interconnection graphs
inferred← citeshttps://doi.org/10.1109/acc.2012.6315299openalex-snapshot
Establishing connectivity in proximity networks
inferred← citeshttps://doi.org/10.1109/acc.2014.6858992openalex-snapshot
Transient losses in synchronizing renewable energy integrated power networks
inferred← citeshttps://doi.org/10.1109/acc.2014.6859345openalex-snapshot
Schur-convex robustness measures in dynamical networks
inferred← citeshttps://doi.org/10.1109/acc.2014.6859497openalex-snapshot
Sparsity-promoting optimal control of consensus and synchronization networks
inferred← citeshttps://doi.org/10.1109/acc.2015.7170757openalex-snapshot
In-network leader selection for acyclic graphs
inferred← citeshttps://doi.org/10.1109/acc.2015.7170900openalex-snapshot
An interior point method for growing connected resistive networks
inferred← citeshttps://doi.org/10.1109/access.2019.2961002openalex-snapshot
Security of Vehicle Platooning: A Game-Theoretic Approach
inferred← citeshttps://doi.org/10.1109/access.2022.3211395openalex-snapshot
Distributed Off-Policy Temporal Difference Learning Using Primal-Dual Method
inferred← citeshttps://doi.org/10.1109/acssc.2015.7421356openalex-snapshot
Numerical investigation of metrics for epidemic processes on graphs
inferred← citeshttps://doi.org/10.1109/allerton.2010.5707021openalex-snapshot
Designing node and edge weights of a graph to meet Laplacian eigenvalue constraints
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852385openalex-snapshot
Minimizing heat loss in DC networks using batteries
inferred← citeshttps://doi.org/10.1109/apap47170.2019.9225089openalex-snapshot
Identification of Critical Nodes in Power System Based on Graph Theory and PageRank Algorithm
inferred← citeshttps://doi.org/10.1109/asicon.2011.6157190openalex-snapshot
Power grid sizing via convex programming
inferred← citeshttps://doi.org/10.1109/asonam55673.2022.10068613openalex-snapshot
Faster Greedy Optimization of Resistance-based Graph Robustness
inferred← citeshttps://doi.org/10.1109/ausctw.2012.6164915openalex-snapshot
Distributed delay minimization in stochastic routing for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/cac53003.2021.9728026openalex-snapshot
Robustness of Systems with Undirected Graph Under Jamming Attack: A Game-theoretic Approach
inferred← citeshttps://doi.org/10.1109/cca.2016.7587833openalex-snapshot
Effective resistance criterion for negative curvature: Application to congestion control
inferred← citeshttps://doi.org/10.1109/cdc.2006.377308openalex-snapshot
A One-Parameter Family of Distributed Consensus Algorithms with Boundary: From Shortest Paths to Mean Hitting Times
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738734openalex-snapshot
On the structure of graph edge designs that optimize the algebraic connectivity
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400448openalex-snapshot
Efficient and robust communication topologies for distributed decision making in networked systems
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717226openalex-snapshot
A majorization-minimization approach to design of power transmission networks
inferred← citeshttps://doi.org/10.1109/cdc.2011.6160545openalex-snapshot
Graph weight design for Laplacian eigenvalue constraints with multi-agent systems applications
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161026openalex-snapshot
Optimal topology design for dynamic networks
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161270openalex-snapshot
Rearranging trees for robust consensus
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161287openalex-snapshot
Improving damping of power networks: Power scheduling and impedance adaptation
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161337openalex-snapshot
Distributed control for optimal reactive power compensation in smart microgrids
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161482openalex-snapshot
Algorithms for leader selection in large dynamical networks: Noise-free leaders
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161507openalex-snapshot
Algorithms for leader selection in large dynamical networks: Noise-corrupted leaders
inferred← citeshttps://doi.org/10.1109/cdc.2012.6425812openalex-snapshot
Node certainty in collective decision making
inferred← citeshttps://doi.org/10.1109/cdc.2012.6425879openalex-snapshot
Performance of leader-follower networks in directed trees and lattices
inferred← citeshttps://doi.org/10.1109/cdc.2014.7040189openalex-snapshot
Systemic measures for performance and robustness of large-scale interconnected dynamical networks
inferred← citeshttps://doi.org/10.1109/cdc.2014.7040425openalex-snapshot
Robotic surveillance and Markov chains with minimal first passage time
inferred← citeshttps://doi.org/10.1109/cdc.2015.7401998openalex-snapshot
Coherence and convergence rate in networked dynamical systems
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798259openalex-snapshot
Online algorithms for network formation
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799167openalex-snapshot
Distributed adaptive optimization and control of network structures
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264417openalex-snapshot
Distributed voltage regulation of islanded inertialess AC microgrids with lossy networks
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264533openalex-snapshot
Learning the exact topology of undirected consensus networks
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029630openalex-snapshot
Attack Resilient Interconnected Second Order Systems: A Game-Theoretic Approach
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029965openalex-snapshot
Linear Noisy Networks with Stochastic Components
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9682966openalex-snapshot
Distributed H∞Edge Weight Synthesis for Cooperative Systems
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683513openalex-snapshot
Robustness of the terminal behaviour of resistive electrical networks
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683525openalex-snapshot
On the properties of Laplacian pseudoinverses
showing the first 200 of 417 · page through all 417
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.