scientific article; zbMATH DE number 3557519
From MaRDI portal
Publication:4133404
zbMath0357.90038MaRDI QIDQ4133404
R. Oppenheim, Alan J. Hoffman, D. R. Fulkerson
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Balanced matrices with row sum 3, Maximum \(h\)-colourable subgraph problem in balanced graphs, A note on the duality between matchings and vertex covers in balanced hypergraphs, Reliability, covering and balanced matrices, Resolution and the integrality of satisfiability problems, On the integer properties of scheduling set partitioning models, A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices, One-node cutsets and the dominating set polytope, Restricted coloring models for timetabling, Recognizing max-flow min-cut path matrices, Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths, Restrictions and preassignments in preemptive open shop scheduling, A note on odd/even cycles, Classes of normally and nearly normally torsion-free monomial ideals, On the 0,1 facets of the set covering polytope, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, Broadcast domination and multipacking in strongly chordal graphs, Covering, Packing and Generalized Perfection, On some graph classes related to perfect graphs: a survey, A Class of Balanced Matrices Arising from Location Problems, Weighted maximum-clique transversal sets of graphs, Complement total unimodularity, Optimal design of line replaceable units, Discrete extremal problems, Balanced matrices, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Standard graded vertex cover algebras, cycles and leaves, Structural properties and decomposition of linear balanced matrices, On complexities of minus domination, On the mixed set covering, packing and partitioning polytope, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Dominating set games., Star partitions on graphs, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, Unnamed Item, Balanced Cayley graphs and balanced planar graphs, On minimal forbidden subgraph characterizations of balanced graphs, Local unimodularity of matrix-vector pairs, Stability of depth functions of cover ideals of balanced hypergraphs, A characterization of oriented hypergraphic balance via signed weak walks, Fractional Dominating Parameters, A min-max relation for the partial q-colourings of a graph. II: Box perfection, On minimal forbidden subgraph characterizations of balanced graphs, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Minimax relations for the partial q-colorings of a graph, Decomposition of balanced matrices, Perfect matchings in balanced hypergraphs, A polynomial recognition algorithm for balanced matrices, Domination, independent domination, and duality in strongly chordal graphs, Balanced \(0,\pm 1\) matrices. I: Decomposition, Total weak unimodularity: Testing and applications, On the integrality of an extreme solution to pluperfect graph and balanced systems, Recognizing balanceable matrices, On balanced graphs, On Complexities of Minus Domination, On the equality of symbolic and ordinary powers of binomial edge ideals, Efficient \((j, k)\)-dominating functions, An exact algorithm for multiple depot bus scheduling, Totally-Balanced and Greedy Matrices
