scientific article; zbMATH DE number 3446921
From MaRDI portal
Publication:4770975
zbMath0285.05102MaRDI QIDQ4770975
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04) Operations research and management science (90Bxx) Computer science (68-XX) Information and communication theory, circuits (94-XX)
Related Items
Operations on independence numbers of certain graph classes, Balanced Truncation Model Reduction for 3D Linear Magneto-Quasistatic Field Problems, Geometric Methods in Dynamical Systems Modelling: Electrical, Mechanical and Control Systems, Unnamed Item, Design of an atomized organization structure: a graph-theoretic approach, SOME GRAPH PARAMETERS OF POWER SET GRAPHS, An analysis of a garbage collection operation, Syndrome-decoding algorithms for static-diagnosis models, Families of solutions of nonlinear pseudo-boolean relations, Level graphs and approximate shortest path algorithms, Unnamed Item, Generalized dynamical systems: differentiable dynamic complexes and differential dynamic systems, Unnamed Item, Analysis of the Parallel Schwarz Method for Growing Chains of Fixed-Sized Subdomains: Part I, An Exact Method for the Minimum Feedback Arc Set Problem, Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract), How the Complex Network of Specklegram Deciphers Intra‐Film Thermal Induced Dynamics?, Computation of diameter, radius and center of permutation graphs, Subdomain separability in global optimization, Application of graph theory to topology generation for logic gates, Techniques for analyzing dynamic random graph models of web-like networks: An overview, On data retrieval from unambiguous bit matrices, A dynamic finite element preanalyser, Unnamed Item, Block cutpoint decomposition for markovian queueing systems, Some results on a spanning subgraph of the complement of the annihilating-ideal graph of a commutative reduced ring, A study on prime arithmetic integer additive set-indexers of graphs, A linear time algorithm to construct a tree 4-spanner on trapezoid graphs, Algorithms for weighted graph problems on the modified cellular graph automaton, A new algorithm for digraph isomorphism, Graphix a graph theory sub language, Sparse matrix factor modification in structural reanalysis, Centers to centroids in graphs, Finding a minimal set of base paths of a program, Some sequential graph colouring algorithms, Parallel algorithm for analysing activity networks on a tree-structured computer, An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs, On tree roots of graphs, Product networks:a family of symmetric interconnection networks from a group model, On bubble generators in directed graphs, On derivable trees, Unnamed Item, Numerical inverse kinematics for modular reconfigurable robots, Transport on Networks—A Playground of Continuous and Discrete Mathematics in Population Dynamics, A review on graceful and sequential integer additive set-labeled graphs, A new method to find out the chromatic partition of a symmetric graph, Consensus in first order nonlinear heterogeneous multi-agent systems with event-based sliding mode control, Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs, The exact annihilating-ideal graph of a commutative ring, Duality relationships between a class of graphs and linear programs, Analyse und Synthese zuverlässiger Netze, A comparison of three algorithms for finding fundamental cycles in a directed graph, Input- and output-decoupling structural zeros of linear systems described by Rosenbrock's polynomial matrices, Optimum feedback patterns in multivariable control systems, Fixed modes in parametrized systems, Unnamed Item, MEASURING GEOMETRIC COMPLEXITY OF 3D MODELS FOR FEATURE RECOGNITION, An optimal parallel algorithm for computing cut vertices and blocks on interval graphs, Mathematical Modeling and Analysis of Nonlinear Time-Invariant RLC Circuits, Some results of inclusion graph of a topology, Chromatic Zagreb and irregularity polynomials of graphs, ON THE STRUCTURE OF DIRECTED GRAPHS WITH APPLICATIONS: A Rapprochement with Systems Theory Part II, The lifted root number conjecture for fields of prime degree over the rationals: an approach via trees and Euler systems, Generating all maximal independent sets on trees in lexicographic order, Explicit formulae for limit periodic flows on networks, Is the formal energy of the mid-point rule convergent?, Some results on the complement of the comaximal ideal graphs of commutative rings, Solving the maximum clique problem using a tabu search approach, A distributed algorithm to prevent mutual drift between n logical clocks, Prallel algorithms for analyzing activity networks, Maximum of k-th maximal spanning trees of a weighted graph, Topological properties of the recursive Petersen architecture, Fast parallel graph searching with applications, The generalized porous medium equation on graphs: existence and uniqueness of solutions with \(\ell^1\) data, When is the annihilating ideal graph of a zero-dimensional semiquasilocal commutative ring planar? Nonquasilocal case, Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis, Multiaspect graphs: algebraic representation and algorithms, Some relationships between possibility, truth and certainty, Supercube: An optimally fault tolerant network architecture, A novel approach to subgraph selection with multiple weights on arcs, Character triples and Shoda pairs, Efficient monolithic simulation techniques for the stationary lattice Boltzmann equation on general meshes, The signature method for DAEs arising in the modeling of electrical circuits, Thin-walled beams as directed curves, On the Generation of Curvilinear Meshes Through Subdivision of Isoparametric Elements, Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs, On decentralized stabilization of interconnected systems, On the planarity of a graph associated to a commutative ring and on the planarity of its complement, On the herdability of linear time-invariant systems with special topological structures, An Introduction to Coding Sequences of Graphs, Eulerian graphs and automorphisms of a maximal graph, On decentralized stabilization and structure of linear large scale systems, When is the complement of the zero-divisor graph of a commutative ring planar?, An adaptive parallel algorithm for analyzing activity networks, A Hintikka possible worlds model for certainty levels in medical decision making, A graph theoretic approach to multivariable control system design, Parallel algorithms for the single source shortest path problem, Event-triggered sliding mode based consensus tracking in second order heterogeneous nonlinear multi-agent systems, From diffusions on graphs to Markov chains via asymptotic state lumping, Most vital links and nodes in weighted networks, A graph theoretic approach to switching function minimization, Decentralized observers with consensus filters for distributed discrete-time linear systems, Asymptotic behaviour of flows on reducible networks, Reducing conflict resolution time for solving graph problems in broadcast communications, Multi-relations in Z. A cross between multi-sets and binary relations, Topological code of graphs, Controllable fuzzy matrices, An efficient and accurate short-characteristics solver for radiative transfer problems, Processing of domain experts' knowledge for development of a KBS for risk analysis, On the intersection rank of a graph, Stirling networks: A versatile combinatorial topology for multiprocessor systems, Statistical analysis of financial networks, A self-stabilizing algorithm for maximal matching, The incremental agreement, Robustness analysis of leader-follower consensus for multi-agent systems characterized by double integrators, A tabu search algorithm for structural software testing, A novel numerical method for accelerating the computation of the steady-state in induction machines, a generalized network flow model with application to power supply-demand problems, Optimal interconnection in digital systems satisfying concurrency constraints, Algebraic determination of circuits in a directed graph, When is the complement of the comaximal graph of a commutative ring planar?, Faster algorithm to find anti-risk path between two nodes of an undirected graph, On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology, A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs, Connectability and structural controllability of composite systems, Asymptotic state lumping in transport and diffusion problems on networks with applications to population problems, Coefficient relationship between rook and chromatic polynomials, On finding fundamental cut sets, Generalizations of line graphs and applications, The \(k\)-regular induced subgraph problem, Profitability computations on program flow graphs, Solving singularly constrained generalized network problems, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, Theoretical and computational advances for network diversion, Markov Chain Approach to Probabilistic Guidance for Swarms of Autonomous Agents, Cohen-Macaulay graphs, Efficient Prüfer-like coding and counting labelled hypertrees, An improved dynamic modeling of a multibody system with spherical joints, Analysis of loop methods for simulating gas networks, The exact zero-divisor graph of a reduced ring, A recursive formulation for flexible multibody dynamics. I: Open-loop systems, Fundamental circuits and cut-sets used in cryptography, Efficient computing methods for parallel processing: An implementation of the Viterbi algorithm, An efficient algorithm to find next-to-shortest path on permutation graphs, Aspects of Feynman Graphs, New distance concept and graph theory approach for certain coding techniques design and analysis, Szpilrajn's theorem on fuzzy orderings, Models for concurrent product and process design, A new backtracking algorithm for generating the family of maximal independent sets of a graph, A linear-time algorithm for classifying the states of a finite Markov chain, Graph theoretical duality perspective on conjugate structures and its applications, The disjunctive graph machine representation of the job shop scheduling problem, Shortest paths in networks with vector weights, On the power of a perturbation for testing non-isomorphism of graphs, Singular perturbations involving fast diffusion, Transitive reduction of a nilpotent Boolean matrix, Reverse binary graphs, The Steiner problem in distributed computing systems, Finding maximum cliques in arbitrary and in special graphs, The maximum clique problem, Universal circuit matrix for adjacency graphs of feedback functions, Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
