scientific article; zbMATH DE number 3446921
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Operations research and management science (90Bxx) Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04) Computer science (68-XX) Information and communication theory, circuits (94-XX)
Cited in
(only showing first 100 items - show all)- A novel approach to subgraph selection with multiple weights on arcs
- Algebraic determination of circuits in a directed graph
- The disjunctive graph machine representation of the job shop scheduling problem
- A distributed algorithm to prevent mutual drift between n logical clocks
- Profitability computations on program flow graphs
- Controllable fuzzy matrices
- Sparse matrix factor modification in structural reanalysis
- Product networks:a family of symmetric interconnection networks from a group model
- A dynamic finite element preanalyser
- A Hintikka possible worlds model for certainty levels in medical decision making
- When is the complement of the zero-divisor graph of a commutative ring planar?
- An analysis of a garbage collection operation
- New distance concept and graph theory approach for certain coding techniques design and analysis
- Graph theoretical duality perspective on conjugate structures and its applications
- Connectability and structural controllability of composite systems
- The maximum clique problem
- The exact zero-divisor graph of a reduced ring
- Explicit formulae for limit periodic flows on networks
- Processing of domain experts' knowledge for development of a KBS for risk analysis
- Asymptotic state lumping in transport and diffusion problems on networks with applications to population problems
- Mathematical Modeling and Analysis of Nonlinear Time-Invariant RLC Circuits
- Some results on a spanning subgraph of the complement of the annihilating-ideal graph of a commutative reduced ring
- Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
- Balanced truncation model reduction for 3D linear magneto-quasistatic field problems
- Fast parallel graph searching with applications
- Multiaspect graphs: algebraic representation and algorithms
- From diffusions on graphs to Markov chains via asymptotic state lumping
- A novel numerical method for accelerating the computation of the steady-state in induction machines
- Aspects of Feynman graphs
- Asymptotic behaviour of flows on reducible networks
- An improved dynamic modeling of a multibody system with spherical joints
- Fixed modes in parametrized systems
- Models for concurrent product and process design
- Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)
- Generating all maximal independent sets on trees in lexicographic order
- Some results on the complement of the comaximal ideal graphs of commutative rings
- Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)
- An efficient algorithm to find next-to-shortest path on permutation graphs
- Numerical inverse kinematics for modular reconfigurable robots
- A study on prime arithmetic integer additive set-indexers of graphs
- Coloring of prime graph \(PG_1(R)\) and \(PG_2(R)\) of a ring
- Some results of inclusion graph of a topology
- Study of prime graph of a ring
- On finding fundamental cut sets
- Statistical analysis of financial networks
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- Some results on the comaximal ideal graph of a commutative ring
- When is the complement of the comaximal graph of a commutative ring planar?
- Finding a minimal set of base paths of a program
- Cohen-Macaulay graphs
- Graphix a graph theory sub language
- Some relationships between possibility, truth and certainty
- Topological properties of the recursive Petersen architecture
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- scientific article; zbMATH DE number 7587195 (Why is no real title available?)
- An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
- Input- and output-decoupling structural zeros of linear systems described by Rosenbrock's polynomial matrices
- The k-regular induced subgraph problem
- Families of solutions of nonlinear pseudo-boolean relations
- Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. I
- A new algorithm for digraph isomorphism
- Thin-walled beams as directed curves
- A tabu search algorithm for structural software testing
- On the power of a perturbation for testing non-isomorphism of graphs
- A review on graceful and sequential integer additive set-labeled graphs
- Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
- Supercube: An optimally fault tolerant network architecture
- Parallel algorithms for the single source shortest path problem
- A self-stabilizing algorithm for maximal matching
- Reverse binary graphs
- Consensus in first order nonlinear heterogeneous multi-agent systems with event-based sliding mode control
- Decentralized observers with consensus filters for distributed discrete-time linear systems
- The generalized porous medium equation on graphs: existence and uniqueness of solutions with \(\ell^1\) data
- A graph theoretic approach to multivariable control system design
- An Introduction to Coding Sequences of Graphs
- Most vital links and nodes in weighted networks
- Coefficient relationship between rook and chromatic polynomials
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
- Generalized dynamical systems: differentiable dynamic complexes and differential dynamic systems
- Universal circuit matrix for adjacency graphs of feedback functions
- On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology
- Character triples and Shoda pairs
- The Steiner problem in distributed computing systems
- How the Complex Network of Specklegram Deciphers Intra‐Film Thermal Induced Dynamics?
- Is the formal energy of the mid-point rule convergent?
- Duality relationships between a class of graphs and linear programs
- Chromatic Zagreb and irregularity polynomials of graphs
- A graph theoretic approach to switching function minimization
- Parallel algorithm for analysing activity networks on a tree-structured computer
- Theoretical and computational advances for network diversion
- On derivable trees
- Centers to centroids in graphs
- SOME GRAPH PARAMETERS OF POWER SET GRAPHS
- On bubble generators in directed graphs
- A comparison of three algorithms for finding fundamental cycles in a directed graph
- Application of graph theory to topology generation for logic gates
- An exact method for the minimum feedback arc set problem
- Generalizations of line graphs and applications
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- Operations on independence numbers of certain graph classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770975)