scientific article

Krishnaiyan Thulasiraman, M. N. S. Swamy

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

matroids graph algorithms electrical networks finite graphs

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Graph theory (05Cxx)

Related Items

Competitive location and pricing on networks with random utilities, Circularity of the numerical range, The Boolean pivot operation, \(M\)-matrices, and reducible matrices, Superperfect pairs of trees in graphs, Competitive location on a network, Heisenberg-integrable spin systems, Closed iterative calculus, Frames and factorization of graph Laplacians, The mathematical foundations of bond graphs. II: Duality, The mathematical foundations of bond graphs. III: Matroid theory, Perfect pairs of trees in graphs, Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem, On finding optimal and near-optimal lineal spanning trees, \((r|p)\)-centroid problems on networks with vertex and edge demand, Unicursal resistive networks, Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem, The mathematical foundations of bond graphs. I: Algebraic theory, Dominator sequences in bipartite graphs, The bases of weighted graphs, Cut technique in valued relational systems: Mainsprings and applications, Block structure and stability of the genetic code, Adjoint nullator‐norator networks, Object-based image labeling through learning by example and multi-level segmentation, A numerical optimization procedure for complex pipe and duct network design, Evolutionary synthesis of low-sensitivity digital filters using adjacency matrix, New approximation algorithms for minimum cycle bases of graphs, Genetic code from tRNA point of view, Sequential competitive location on networks, Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture, A theory of rectangular dual graphs, Crises and chaotic transients studied by the generalized cell mapping digraph method, ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS, Cycles and spanning trees, An approach to improving the Mayeda method for graph realization from a matrix, Games with permission structures: The conjunctive approach, EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH, MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES, PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS), CHAIN STRUCTURES IN SCHEDULES TASKS, MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE, Successive partition of edges of bipartite graph into matchings, The reduction of binary fuzzy relations and its applications, Conditions for weak ergodicity of inhomogeneous Markov chains, Statistical theory for the ratio model of paired comparisons, Fractional arboricity, strength, and principal partitions in graphs and matroids, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Low-energy excitations in the three-dimensional random-field Ising model, Tellegen's theorem for 2-isomorphic networks, Clustering: a neural network approach, Solving sparse linear systems of equations using the modified digraph approach, Properties of Gomory-Hu co-cycle bases, On extendibility of voltage and current regimes from subnetworks, Repeated games with \(M\)-period bounded memory (pure strategies), Graph theoretical duality perspective on conjugate structures and its applications, The clique-partitioning problem, The maximum clique problem, An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph, Modelling fuzzy universal resource identifiers: a first approach