A note on two problems in connexion with graphs (Q78129): Difference between revisions

@@ Property / publication date @@
+Timestamp +1959-00-00T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 year
Before 0
After 0
-Timestamp
++1959-00-00T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+year
 Before
 After
@@ Property / publication date: 1959 / rank @@
+Normal rank
@@ Property / author @@
+Edsger W. Dijkstra
@@ Property / author: Edsger W. Dijkstra / rank @@
+Normal rank
@@ Property / title @@
+A note on two problems in connexion with graphs (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.16002
@@ Property / zbMATH Open document ID: 0092.16002 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://eudml.org/doc/131436
@@ Property / full work available at URL: https://eudml.org/doc/131436 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+3150490
@@ Property / zbMATH DE Number: 3150490 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+topology
@@ Property / zbMATH Keywords: topology / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q21694527
@@ Property / Wikidata QID: Q21694527 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:78129