Pages that link to "Item:Q3691772"
From MaRDI portal
The following pages link to Totally-Balanced and Greedy Matrices (Q3691772):
Displayed 13 items.
- Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
- A characterization of the single-crossing domain (Q2453407) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs (Q2883613) (← links)
- Standard graded vertex cover algebras, cycles and leaves (Q3542001) (← links)
- Steiner trees, connected domination and strongly chordal graphs (Q3701460) (← links)
- Convexity in Graphs and Hypergraphs (Q3718757) (← links)
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872) (← links)
- Boundary Properties of Factorial Classes of Graphs (Q4982282) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
- An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix (Q5954079) (← links)