Graph algorithms for spanning structures encompass a family of techniques designed to extract sparse subgraphs that preserve essential connectivity and distance properties of the original network.

Lobachevsky University scientists are implementing a research project "Algorithmic, Complex and Structural Problems of Graph Theory and Discrete Optimization". At the head of the research team is ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...