Pages that link to "Item:Q3691772"
From MaRDI portal
The following pages link to Totally-Balanced and Greedy Matrices (Q3691772):
Displayed 50 items.
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- Location problems (Q1062596) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- An efficient algorithm for solving a special class of LP's (Q1074311) (← links)
- Forbidden submatrices (Q1103620) (← links)
- Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Search-hide games on trees (Q1129971) (← links)
- Classes of bipartite graphs related to chordal graphs (Q1179261) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- Structural properties and decomposition of linear balanced matrices (Q1196165) (← links)
- Induced matchings (Q1262877) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- Greedy sets and related problems (Q1278939) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Solving the uncapacited plant location problem on trees (Q1327217) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Decomposition of balanced matrices (Q1569060) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Greedy oriented flows (Q1751094) (← links)
- On complexities of minus domination (Q1751171) (← links)
- An algorithmic framework for tool switching problems with multiple objectives (Q1751917) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- Solving covering problems and the uncapacitated plant location problem on trees (Q1838422) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Decomposition of wheel-and-parachute-free balanced bipartite graphs (Q1900140) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Online clustering with variable sized clusters (Q1939661) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Storage management of items in two levels of availability (Q1969867) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Koszul multi-Rees algebras of principal \(L\)-Borel ideals (Q2029203) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- Doubly lexical ordering of dense 0--1 matrices (Q2366069) (← links)
- The one-dimensional Euclidean domain: finitely many obstructions are not enough (Q2397665) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
- Balanced matrices (Q2433704) (← links)
- Which claw-free graphs are strongly perfect? (Q2433718) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)