History


Help on query formulation
Arguments concerning the domain of a special case of the shortest path problem. (A legrövidebb utak probléma speciális esetének értelmezési tartományára vonatkozó megfontolások.) (Hungarian)
Polygon 24, No. 1, 37-43 (2016).
From the introduction: We present arguments connetted with the restriction of the domain of a problem on determining the shortest path between two vertices of a graph. Our purpose is to simplify this type of problems.
Classification: K30
Valid XHTML 1.0 Transitional Valid CSS!