The following pages link to (Q3266932):
Displaying 41 items.
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem (Q602719) (← links)
- Hierarchical decomposition of symmetric discrete systems by matroid and group theories (Q687038) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications (Q1062429) (← links)
- A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations (Q1100219) (← links)
- Principal structures of submodular systems (Q1139052) (← links)
- Combinatorial aspects of rectangular non-negative matrices (Q1245964) (← links)
- Maximum rank matrix completion (Q1300879) (← links)
- Predicting the structure of sparse orthogonal factors (Q1318224) (← links)
- Graph-theoretic approach to symbolic analysis of linear descriptor systems (Q1319989) (← links)
- Block triangularization of skew-symmetric matrices (Q1381281) (← links)
- Bargaining in a network of buyers and sellers. (Q1427496) (← links)
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks (Q1747895) (← links)
- Principal structure of layered mixed matrices (Q1813973) (← links)
- Some recent results in combinatorial approaches to dynamical systems (Q1823209) (← links)
- A theorem on the principal structure for independent matchings (Q1897351) (← links)
- Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure (Q1923614) (← links)
- A manifold-based approach to sparse global constraint satisfaction problems (Q2010101) (← links)
- Graft analogue of general Kotzig-Lovász decomposition (Q2081503) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- Bilateral bargaining in networks (Q2373790) (← links)
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations (Q2408155) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- On the point-core of a graph (Q2523702) (← links)
- Some graphical properties of matrices with non-negative entries (Q2532578) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation (Q2867138) (← links)
- A new efficient and flexible algorithm for the design of testable subsystems (Q2930585) (← links)
- Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559) (← links)
- A Method for Sensor Placement Taking into Account Diagnosability Criteria (Q3601361) (← links)
- Fault Diagnosis Of A Water For Injection System Using Enhanced Structural Isolation (Q3601373) (← links)
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— (Q3731772) (← links)
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations (Q3761563) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- Popular Matchings with Ties and Matroid Constraints (Q5351863) (← links)
- On the Inversion of Sparse Matrices (Q5723446) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
- Offline analysis of the relaxed upper boundedness for online estimation of optimal event sequences in partially observable Petri nets (Q6580668) (← links)
- Basilica: new canonical decomposition in matching theory (Q6667586) (← links)
