Coverings of Bipartite Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- Graphs with unique maximum independent sets
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
- Matrices of 0's and 1's with total support
- Coverings of transfinite matrices
- On the truncated assignment polytope
- Combinatorial aspects of rectangular non-negative matrices
- Predicting the structure of sparse orthogonal factors
- Digraph characterization of structural controllability for linear descriptor systems
- Patterns that preserve sparsity in orthogonal factorization
- Bargaining in a network of buyers and sellers.
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks
- From structural analysis to observer-based residual generation for fault detection
- An efficient method for determining fault isolability properties based on an augmented system model
- A manifold-based approach to sparse global constraint satisfaction problems
- Scaling matrices and counting the perfect matchings in graphs
- Graft analogue of general Kotzig-Lovász decomposition
- Fair-by-design matching
- Nontrivial path covers of graphs: existence, minimization and maximization
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
- Spectral stability of metric-measure Laplacians
- Enumeration of BC-subtrees of trees
- A note on minimal matching covered graphs
- On the fixed controllable subspace in linear structured systems
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- On the point-core of a graph
- Some graphical properties of matrices with non-negative entries
- Strong transfinite version of König's duality theorem
- On fully indecomposable matrices
- Matching structure and bargaining outcomes in buyer-seller networks
- Generic methodology for the probabilistic reliability assessment of some structural properties: a graph theoretical approach
- Diagnosing time-dependent incipient faults
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Test signal generation for service diagnosis based on local structural properties
- Disclosing barriers: a generalization of the canonical partition based on Lovász's formulation
- A polynomial time solvable instance of the feasible minimum cover problem
- Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
- A note on sign-solvability of linear system of equations
- Matrices of zeros and ones
- GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING
- Popular matchings with two-sided preferences and one-sided ties
- A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
- Use of matroid theory in operations research, circuits and systems theory
- Topological conditions for the solvability of linear active networks
- On bounded block decomposition problems for under-specified systems of equations
- Bigraphs versus digraphs via matrices
- Independent edges in bipartite graphs obtained from orientations of graphs
- Geometric Separators for Finite-Element Meshes
- Indeterminates and incidence matrices†
- Making bipartite graphs DM-irreducible
- Partial state observability recovering for linear systems by additional sensor implementation
- Permutations of a semigroup that map to inverses.
- Local null controllability of the three-dimensional Navier-Stokes system with a distributed control having two vanishing components
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
- Reverse propagation of McCormick relaxations
- Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications
- How to Secure Matchings Against Edge Failures
- How to Secure Matchings against Edge Failures
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- Controllability of coupled parabolic systems with multiple underactuations. I: Algebraic solvability
- Structural Analysis
- Online train shunting
- Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms
- Popular matchings with ties and matroid constraints
- Popular matchings with two-sided preferences and one-sided ties
- A graph theoretical approach to the parameters identifiability characterisation
- On the structure of factorizable graphs. II
- Factorization of the minors of characteristic matrix sI-A and DM decomposition of its representation graph
- Discussion on: ``Structural analysis of the partial state and input observability for structured linear systems: application to distributed systems
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems
- Excluding a planar matching minor in bipartite graphs
- Real-time model-based fault detection and isolation for ugvs
- Stable matchings, one-sided ties, and approximate popularity
- Offline analysis of the relaxed upper boundedness for online estimation of optimal event sequences in partially observable Petri nets
- Improved truthful rank approximation for rank-maximal matchings
- Observability analysis and sensor location study for structured linear systems in descriptor form with unknown inputs
- Basilica: new canonical decomposition in matching theory
- Max-utility matchings with popularity via critical vertices
- Truthful approximation for rank-maximal matchings
- Structural analysis and sequential resolution for estimation of guaranteed horizons in partially observable Petri nets
- Eigenvalue approach to dense clusters in hypergraphs
- A transaction-level model for blockchain privacy
- Popular solutions for optimal matchings
- Deterministic and universal truthful mechanism for fair matching
- Satisfiability of non-linear transcendental arithmetic as a certificate search problem
- Proportional allocation of indivisible goods up to the least valued good on average
- Consensus algorithms for the generation of all maximal bicliques
- The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
- Breaking the barrier 2ᵏ for subset feedback vertex set in chordal graphs
- A note on \({\mathtt V}\)-free 2-matchings
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- Classified rank-maximal matchings and popular matchings: algorithms and hardness
- A note on the structural functional observability problem
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Automated design of an FDI system for the wind turbine benchmark
This page was built for publication: Coverings of Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3266931)
