aboutsummaryrefslogtreecommitdiff
path: root/math/planarity/pkg-descr
diff options
context:
space:
mode:
Diffstat (limited to 'math/planarity/pkg-descr')
-rw-r--r--math/planarity/pkg-descr3
1 files changed, 1 insertions, 2 deletions
diff --git a/math/planarity/pkg-descr b/math/planarity/pkg-descr
index a6684c2cff08..cf0c6f600224 100644
--- a/math/planarity/pkg-descr
+++ b/math/planarity/pkg-descr
@@ -5,5 +5,4 @@ Algorithm, which is now the fastest and simplest linear-time method for
planar graph embedding and planarity obstruction isolation (i.e. Kuratowski
subgraph isolation).
-WWW: http://dx.doi.org/10.7155/jgaa.00091
-WWW: https://github.com/graph-algorithms/edge-addition-planarity-suite/
+See also: https://github.com/graph-algorithms/edge-addition-planarity-suite/