Pages that link to "Item:Q3902459"
From MaRDI portal
The following pages link to On structured digraphs and program testing (Q3902459):
Displaying 4 items.
- On the computational complexity of path cover problems (Q799105) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Impossible pair constrained test path generation in a program (Q1838316) (← links)
