Graph theory applications
From MaRDI portal
Publication:1189421
zbMath0747.05001MaRDI QIDQ1189421
Publication date: 18 September 1992
Published in: Universitext (Search for Journal in Brave)
Applications of graph theory (05C90) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Clique-partitioned graphs, Semistate models of electrical circuits including memristors, Sensor Network Localization on the Group of Three-Dimensional Displacements, An improved two-stage optimization-based framework for unequal-areas facility layout, A geometric Birkhoffian formalism for nonlinear RLC networks, The tractability index of memristive circuits: branch-oriented and tree-based models, Maximum planar subgraphs and nice embeddings: Practical layout tools, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Bounds on the Steiner radius of a graph, Review of Similarities between Adjacency Model and Relational Model, Graph theory approach to exceptional points in wave scattering, Asymptotic stability of robust heteroclinic networks, Finding large planar subgraphs and large subgraphs of a given genus, An analysis of heuristics for graph planarization, Wrapping graphs and partial semi-hyper groups, A central limit theorem and higher order results for the angular bispectrum, Dynamical properties of electrical circuits with fully nonlinear memristors, Turning restriction design in traffic networks with a budget constraint, Does contraction preserve triangular meshes?, Binary Steiner trees: structural results and an exact solution approach, The power graph on the conjugacy classes of a finite group, Augmented nodal matrices and normal trees, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, DAEs in Circuit Modelling: A Survey, High-resolution asymptotics for the angular bispectrum of spherical random fields, A convex optimisation framework for the unequal-areas facility layout problem, Structural similarity of directed universal hierarchical graphs: a low computational complexity approach, The hyperbolicity problem in electrical circuit theory, Closing ranks in rigid multi-agent formations using edge contraction, On the subgroup structure of the hyperoctahedral group in six dimensions, Lucas graphs, Almost complete and equable heteroclinic networks, A network flow approach to a city emergency evacuation planning, Cyclic matrices of weighted digraphs, A computational method for determining strong stabilizability of \(n\)-D systems, An algorithm for computing the stable coalition structures in tree-graph communication games, A compact transformation of arc routing problems into node routing problems, Facility layout objective functions and robust layouts, Characterizing the scale dimension of a high-dimensional classification problem, Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances
