Difference between revisions
map-of-knowledge
Status and infobox
- status:
—→ open - kind:
—→ problem - year:
—→ 1964 - statement:
—→ Is there a layout of a knowledge graph that keeps time, dependency and similarity faithful at every zoom level, and can it be computed efficiently?
Source +17 −0
+---
+title: Drawing the map of knowledge
+kind: problem
+status: open
+year: 1964
+statement: Is there a layout of a knowledge graph that keeps time, dependency and similarity faithful at every zoom level, and can it be computed efficiently?
+space: algorithms
+---
+Every map of knowledge chooses what its geometry means and gives up the rest. Garfield's 1964 citation historiographs put time on one axis; later maps of science place fields by citation similarity and lose chronology. Even one clean criterion is hard: minimizing the edge crossings of a drawing is NP-hard, shown by Garey and Johnson in 1983. This atlas has two drawings with different trade-offs: the Map keeps containment and loses time, and the Chart keeps time and field and loses similarity. A layout that keeps all three at every scale is an open problem.
+
+## Sources
+
+- [Wikipedia: Graph drawing](https://en.wikipedia.org/wiki/Graph_drawing)
+- [Wikipedia: Crossing number (graph theory)](https://en.wikipedia.org/wiki/Crossing_number_(graph_theory))
+- [Wikipedia: Citation analysis](https://en.wikipedia.org/wiki/Citation_analysis)
+
+[[Space:algorithms|Algorithms]] · [[Continent:computation|Computation]]
Revision 69 as rendered
Every map of knowledge chooses what its geometry means and gives up the rest. Garfield's 1964 citation historiographs put time on one axis; later maps of science place fields by citation similarity and lose chronology. Even one clean criterion is hard: minimizing the edge crossings of a drawing is NP-hard, shown by Garey and Johnson in 1983. This atlas has two drawings with different trade-offs: the Map keeps containment and loses time, and the Chart keeps time and field and loses similarity. A layout that keeps all three at every scale is an open problem.