Balanced matrices
From MaRDI portal
Publication:5659570
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- Blocking and anti-blocking pairs of polyhedra
- On chromatic number of graphs and set-systems
- Subgraphs with prescribed valencies
Cited in
(79)- Two classes of location problems on tree networks
- Structural properties and decomposition of linear balanced matrices
- On the integer properties of scheduling set partitioning models
- Recognizing balanceable matrices
- On some graph classes related to perfect graphs: a survey
- Improved approximations for guarding 1.5-dimensional terrains
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs
- Extensions of coloring models for scheduling purposes
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
- Quasi-balanced matrices
- Balanced matrices with row sum 3
- Strongly simplicial vertices of powers of trees
- Perfect, ideal and balanced matrices
- Transversal partitioning in balanced hypergraphs
- On some characterisations of totally unimodular matrices
- A decomposition property of polyhedra
- Colouring bottomless rectangles and arborescences
- Restrictions and preassignments in preemptive open shop scheduling
- Good and nice colorings of balanced hypergraphs
- An exact algorithm for multiple depot bus scheduling
- Minimum degree conditions for tight Hamilton cycles
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Domination, independent domination, and duality in strongly chordal graphs
- Totally-Balanced and Greedy Matrices
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- Permuting matrices to avoid forbidden submatrices
- Classification de certaines matrices 0-1
- One-node cutsets and the dominating set polytope
- Coverings and matchings in \(r\)-partite hypergraphs
- Testing balancedness and perfection of linear matrices
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Dioïds and semirings: Links to fuzzy sets and other applications
- A note on the total unimodularity of matrices
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- On the 0,1 facets of the set covering polytope
- Total weak unimodularity: Testing and applications
- Balanced Cayley graphs and balanced planar graphs
- Local unimodularity of matrix-vector pairs
- A generalization of a theorem of König
- Complement total unimodularity
- On testing consecutive-ones property in parallel
- Strong unimodularity for matrices and hypergraphs
- Decomposition of balanced matrices
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
- Restricted coloring models for timetabling
- Convexity in Graphs and Hypergraphs
- Discrete extremal problems
- Covering, Packing and Generalized Perfection
- Optimisation and hypergraph theory
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- A Class of Balanced Matrices Arising from Location Problems
- Perfect zero–one matrices
- On decompositions of a multi-graph into spanning subgraphs
- On balanced graphs
- Dominating set games.
- Balanced matrices
- Integer programming methods for large-scale practical classroom assignment problems
- The domatic number problem on some perfect graph families
- Odd cycles and matrices with integrality properties
- Resolution and the integrality of satisfiability problems
- On the mixed set covering, packing and partitioning polytope
- Graph theoretic relaxations of set covering and set partitioning problems
- Properties of balanced and perfect matrices
- On minimal forbidden subgraph characterizations of balanced graphs
- A polynomial recognition algorithm for balanced matrices
- Idealness of \(k\)-wise intersecting families
- Note on polychromatic coloring of hereditary hypergraph families
- Balancedness of some subclasses of circular-arc graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Decomposition of wheel-and-parachute-free balanced bipartite graphs
- Clique-perfectness and balancedness of some graph classes
- Resistant sets in the unit hypercube
- Reliability, covering and balanced matrices
- Deltas, extended odd holes and their blockers
- Making clusterings fairer by post-processing: algorithms, complexity results and experiments
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Extensions of the Minimum Dominating Set Problem
This page was built for publication: Balanced matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659570)
