The following pages link to (Q5115821):
Displaying 4 items.
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710814) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)