The following pages link to (Q5672651):
Displaying 14 items.
- How to guard a graph? (Q652526) (← links)
- Cayley permutations (Q792334) (← links)
- Forming partnerships in a virtual factory (Q940918) (← links)
- An algorithm for generating subsets of fixed size with a strong minimal change property (Q1060849) (← links)
- An algorithm for generating shift-register cycles (Q1081585) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- Best Huffman trees (Q1160111) (← links)
- Complexity of finding k-path-free dominating sets in graphs (Q1167535) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- A simple systolic algorithm for generating combinations in lexicographic order (Q1205904) (← links)
- A Gray code for set partitions (Q1239129) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- An application of Ramsey's theory to partitions in groups. I (Q2276985) (← links)
- Service chain placement in SDNs (Q2334053) (← links)
