home.md

@@ -17,6 +17,5 @@ doi = {https://doi.org/10.1016/j.jocs.2023.102156},
 url = {https://www.sciencedirect.com/science/article/pii/S1877750323002168}
 }
 ```
-Given a self-deleting graph $S=(G,f)$, where $G=(V,E)$ is a simple graph and $f:V \to 2^E$ is a delete function, the goal of the TSP-SD is to find the shortest Hamiltonian cycle on $S$. 
-The 11 instances used in `Carmesin23jocs` are available in the `./data/TSPLIB/` directory.
+