The following pages link to Balanced matrices (Q2433704):
Displaying 33 items.
- Oriented hypergraphs: introduction and balance (Q396889) (← links)
- On weighted efficient total domination (Q414423) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Balanced Cayley graphs and balanced planar graphs (Q712243) (← links)
- A characterization of oriented hypergraphic balance via signed weak walks (Q745211) (← links)
- Balancing matrices with line shifts (Q795048) (← links)
- Properties of balanced and perfect matrices (Q1194854) (← links)
- Structural properties and decomposition of linear balanced matrices (Q1196165) (← links)
- Balanced matrices with row sum 3 (Q1336681) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- How many matrices can be spectrally balanced simultaneously? (Q1650021) (← links)
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients (Q1669013) (← links)
- Non total-unimodularity neutralized simplicial complexes (Q1707913) (← links)
- Location routing problems on trees (Q1735670) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- On pseudomatroid property of matrices (Q1970490) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems (Q2052179) (← links)
- Oriented hypergraphs: balanceability (Q2124629) (← links)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals (Q2313415) (← links)
- Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra (Q2467476) (← links)
- A polynomial recognition algorithm for balanced matrices (Q2565686) (← links)
- Recognizing balanceable matrices (Q2583120) (← links)
- Linear balanceable and subcubic balanceable graphs (Q2874096) (← links)
- Properties of SLUR Formulae (Q2891367) (← links)
- Balanced matrices and the set covering polytope (Q3987196) (← links)
- From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes (Q4294726) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Balancing Regular Matrix Pencils (Q5470533) (← links)
