HTTP/2 303
tracestate: gorouter=56d4bb091ddb996b
server: Oscar Platform 0.1477.0
age: 0
set-cookie: sim-inst-token="1::1759998698169:05acb732"; Domain=.springer.com; Path=/; secure; HttpOnly
set-cookie: trackid="20yztjtwjlm7vyafuoi4crgqs"; Domain=.springer.com; Path=/; secure; HttpOnly
traceparent: 00-d05eb62f32b4472c5fb53cd997b265bc-d42d6d2e7b652bee-01
x-b3-traceid: 31e99ef6d65cf68a
x-b3-sampled: 1
cache-control: no-cache
x-frame-options: DENY
x-dump-request-bodies: 0
x-vcap-request-id: d05eb62f-32b4-472c-5fb5-3cd997b265bc
location: https://idp.springer.com/authorize?response_type=cookie&client_id=springerlink&redirect_uri=https%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2FBF01386390
x-b3-spanid: 052e456774cb5d03
via: 1.1 google, 1.1 varnish
accept-ranges: bytes
date: Thu, 09 Oct 2025 00:11:38 GMT
x-served-by: cache-bom-vanm7210021-BOM, cache-bom-vanm7210088-BOM
x-cache: MISS, MISS, MISS
x-cache-hits: 0, 0
x-timer: S1759968698.936388,VS0,VE434
vary: x-frame-options,X-Oscar-Cache-Mode
alt-svc: h3=":443";ma=86400,h3-29=":443";ma=86400,h3-27=":443";ma=86400
content-length: 0
HTTP/2 302
cache-control: no-cache, no-store, max-age=0, must-revalidate
content-security-policy: frame-ancestors 'none';
expires: 0
location: https://link.springer.com/article/10.1007/BF01386390
pragma: no-cache
set-cookie: idp_session=sVERSION_1a3a4f37d-ca0e-4e9b-b992-e09434babbde; Domain=.springer.com; Path=/; Secure; SameSite=None; HttpOnly
set-cookie: idp_session_http=hVERSION_1a4acdba3-9afa-46c6-81d7-5b5830229175; Domain=.springer.com; Path=/; HttpOnly
set-cookie: idp_marker=435a36dc-3eae-4d03-98f9-b84236097f1e; Domain=.springer.com; Path=/; Max-Age=34560000; HttpOnly
strict-transport-security: max-age=31536000 ; includeSubDomains
traceparent: 00-2e8d9d90fd6846046f850d40321d6bd0-a8622c7a72cdc4bb-01
x-content-type-options: nosniff
x-frame-options: DENY
x-vcap-request-id: 2e8d9d90-fd68-4604-6f85-0d40321d6bd0
x-xss-protection: 1; mode=block
via: 1.1 google, 1.1 varnish
x-cdn-origin: SNPaaS
accept-ranges: bytes
date: Thu, 09 Oct 2025 00:11:38 GMT
x-served-by: cache-bom-vanm7210080-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1759968698.425573,VS0,VE368
vary: x-forwarded-proto
alt-svc: h3=":443";ma=86400,h3-29=":443";ma=86400,h3-27=":443";ma=86400
content-length: 0
HTTP/2 200
x-frame-options: DENY
x-b3-spanid: 7f299043a6b5318d
set-cookie: sim-inst-token="1::1759998698169:05acb732"; Domain=.springer.com; Path=/; secure; HttpOnly
set-cookie: user.uuid.v2="064c3482-4235-4d16-a76f-d000e72d4e25"; Expires=Fri, 09 Jan 2026 00:11:39 GMT; Domain=.springer.com; Path=/; secure; HttpOnly
traceparent: 00-9e48ed3ba6fa4924682c16febe8a823d-3fb8b809c339c4b5-01
server: Oscar Platform 0.1477.0
x-b3-sampled: 1
x-b3-traceid: fbe1c1628c16f3dd
x-vcap-request-id: 9e48ed3b-a6fa-4924-682c-16febe8a823d
content-encoding: gzip
accept-ranges: bytes
content-type: text/html; charset=utf-8
via: 1.1 google, 1.1 varnish
x-dump-request-bodies: 0
age: 0
etag: "0efd9d420baae0400f3f0eee15045990"
tracestate: gorouter=01eaa41158bfc7ef
date: Thu, 09 Oct 2025 00:11:39 GMT
x-served-by: cache-bom-vanm7210021-BOM, cache-bom-vanm7210088-BOM
x-cache: MISS, MISS, MISS
x-cache-hits: 0, 0
x-timer: S1759968699.807111,VS0,VE718
vary: x-frame-options,X-Oscar-Cache-Mode, Accept-Encoding
alt-svc: h3=":443";ma=86400,h3-29=":443";ma=86400,h3-27=":443";ma=86400
A note on two problems in connexion with graphs | Numerische Mathematik
Skip to main content
Access this article
Subscribe and save
Springer+
from €37.37 /Month
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime
View plans
Buy Now
Price includes VAT (India)
Instant access to the full article PDF.
References
Kruskal Jr., J. B.: On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem. Proc. Amer. Math. Soc.7, 48–50 (1956).
Google Scholar
Loberman, H., andA. Weinberger: Formal Procedures, for Connecting Terminals with a Minimum Total Wire Length. J. Ass. Comp. Mach.4, 428–437 (1957).
Google Scholar
Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956.
Berge, C.: Théorie des graphes et ses applications, pp. 68–69 Paris Dunod 1958.
Google Scholar
Download references
Author information
Authors and Affiliations
Mathematisch Centrum, 2e Boerhaavestraat 49, Amsterdam-O
E. W. Dijkstra
