scientific article; zbMATH DE number 3446921
From MaRDI portal
Publication:4770975
zbMATH Open0285.05102MaRDI QIDQ4770975FDOQ4770975
Authors: Narsingh Deo
Publication date: 1974
Title of this publication is not available (Why is that?)
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)
- The disjunctive graph machine representation of the job shop scheduling problem
- A dynamic finite element preanalyser
- A distributed algorithm to prevent mutual drift between n logical clocks
- Controllable fuzzy matrices
- Connectability and structural controllability of composite systems
- The maximum clique problem
- The exact zero-divisor graph of a reduced ring
- Mathematical Modeling and Analysis of Nonlinear Time-Invariant RLC Circuits
- Asymptotic state lumping in transport and diffusion problems on networks with applications to population problems
- Explicit formulae for limit periodic flows on networks
- Multiaspect graphs: algebraic representation and algorithms
- Fast parallel graph searching with applications
- Fixed modes in parametrized systems
- From diffusions on graphs to Markov chains via asymptotic state lumping
- An improved dynamic modeling of a multibody system with spherical joints
- Asymptotic behaviour of flows on reducible networks
- Models for concurrent product and process design
- Numerical inverse kinematics for modular reconfigurable robots
- An efficient algorithm to find next-to-shortest path on permutation graphs
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- On finding fundamental cut sets
- Statistical analysis of financial networks
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- Cohen-Macaulay graphs
- An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
- Some relationships between possibility, truth and certainty
- The \(k\)-regular induced subgraph problem
- A new algorithm for digraph isomorphism
- Thin-walled beams as directed curves
- A review on graceful and sequential integer additive set-labeled graphs
- On the power of a perturbation for testing non-isomorphism of graphs
- Supercube: An optimally fault tolerant network architecture
- Parallel algorithms for the single source shortest path problem
- A self-stabilizing algorithm for maximal matching
- Decentralized observers with consensus filters for distributed discrete-time linear systems
- Most vital links and nodes in weighted networks
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
- On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology
- The Steiner problem in distributed computing systems
- Is the formal energy of the mid-point rule convergent?
- On derivable trees
- On bubble generators in directed graphs
- Centers to centroids in graphs
- Generalizations of line graphs and applications
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- Szpilrajn's theorem on fuzzy orderings
- On decentralized stabilization of interconnected systems
- Optimum feedback patterns in multivariable control systems
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Robustness analysis of leader-follower consensus for multi-agent systems characterized by double integrators
- Solving singularly constrained generalized network problems
- Singular perturbations involving fast diffusion
- Efficient monolithic simulation techniques for the stationary lattice Boltzmann equation on general meshes
- An adaptive parallel algorithm for analyzing activity networks
- Markov chain approach to probabilistic guidance for swarms of autonomous agents
- The lifted root number conjecture for fields of prime degree over the rationals: an approach via trees and Euler systems
- Maximum of k-th maximal spanning trees of a weighted graph
- Prallel algorithms for analyzing activity networks
- On tree roots of graphs
- A linear-time algorithm for classifying the states of a finite Markov chain
- Block cutpoint decomposition for markovian queueing systems
- The incremental agreement
- An efficient and accurate short-characteristics solver for radiative transfer problems
- Transitive reduction of a nilpotent Boolean matrix
- Solving the maximum clique problem using a tabu search approach
- Finding maximum cliques in arbitrary and in special graphs
- Geometric Methods in Dynamical Systems Modelling: Electrical, Mechanical and Control Systems
- Shortest paths in networks with vector weights
- Faster algorithm to find anti-risk path between two nodes of an undirected graph
- Efficient Prüfer-like coding and counting labelled hypertrees
- On decentralized stabilization and structure of linear large scale systems
- a generalized network flow model with application to power supply-demand problems
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- The exact annihilating-ideal graph of a commutative ring
- A recursive formulation for flexible multibody dynamics. I: Open-loop systems
- Analysis of loop methods for simulating gas networks
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Product networks:a family of symmetric interconnection networks from a group model
- Sparse matrix factor modification in structural reanalysis
- Profitability computations on program flow graphs
- When is the complement of the zero-divisor graph of a commutative ring planar?
- An analysis of a garbage collection operation
- A Hintikka possible worlds model for certainty levels in medical decision making
- Graph theoretical duality perspective on conjugate structures and its applications
- New distance concept and graph theory approach for certain coding techniques design and analysis
- Some results on a spanning subgraph of the complement of the annihilating-ideal graph of a commutative reduced ring
- Balanced truncation model reduction for 3D linear magneto-quasistatic field problems
- Processing of domain experts' knowledge for development of a KBS for risk analysis
- Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
- Aspects of Feynman graphs
- A novel numerical method for accelerating the computation of the steady-state in induction machines
- Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)
- Generating all maximal independent sets on trees in lexicographic order
- Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)
- Some results on the complement of the comaximal ideal graphs of commutative rings
- A study on prime arithmetic integer additive set-indexers of graphs
- Some results of inclusion graph of a topology
- Coloring of prime graph \(PG_1(R)\) and \(PG_2(R)\) of a ring
- Study of prime graph of a ring
- Some results on the comaximal ideal graph of a commutative ring
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)