EDID v1.3

Finding the Edge Ranking Number through Vertex Partitions

The Traveling Salesman Problem for Cubic Graphs

Optimal Point Removal in Closed-2PM Labeling

A Fast Algorithm for the Generalized K-keyword Proximity

Final_Report_96_(Generalized honeycomb torus is Hamiltonian)

Using a Minimal Number of Resets When Testing

A Polynomial Time Algorithm for Obtaining Minimum Edge