The extremal length of a network
From MaRDI portal
Publication:1130499
DOI10.1016/S0022-247X(62)80004-3zbMath0107.43604WikidataQ92163575 ScholiaQ92163575MaRDI QIDQ1130499
Publication date: 1962
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs, Packing rooted directed cuts in a weighted directed graph, Blocking and anti-blocking pairs of polyhedra, Perfect, ideal and balanced matrices, Ideal clutters, Extremal length of an infinite network related to an accessible boundary point, Reexamination of Ohm's law and a relation to generalized analytic functions, Square tilings with prescribed combinatorics, The combinatorial Riemann mapping theorem, Hyperbolic and parabolic packings, Circuit duality for recurrent Markov processes, Transboundary extremal length, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, Shortest paths in distance-regular graphs, Energy and length in a topological planar quadrilateral, Estimating Dirichlet's integral and electrical conductance for systems which are not self-adjoint, Heat kernels on infinite graph networks and deformed Sierpinski gaskets, Random walk on the Speiser graph of a Riemann surface, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, On the width—length inequality, A homogenization result for planar, polygonal networks, Extremal length and rayleigh's reciprocal theorem, Extremal length and rayleigh's reciprocal theorem, On the width-length inequality
Cites Work
