// ---------------------------------------------------------------------
//
-// Copyright (C) 2000 - 2016 by the deal.II authors
+// Copyright (C) 2000 - 2017 by the deal.II authors
//
// This file is part of the deal.II library.
//
*
* Both algorithms are described in the paper "On orienting edges of
* unstructured two- and three-dimensional meshes", R. Agelek, M. Anderson, W.
- * Bangerth, W. L. Barth (submitted, 2016). A preprint is available as <a
+ * Bangerth, W. L. Barth, accepted for publication in the ACM Transactions
+ * on Mathematical Software. A preprint is available as <a
* href="http://arxiv.org/abs/1512.02137">arxiv
* 1512.02137</a>.
*
// ---------------------------------------------------------------------
//
-// Copyright (C) 2006 - 2016 by the deal.II authors
+// Copyright (C) 2006 - 2017 by the deal.II authors
//
// This file is part of the deal.II library.
//
* we have this convention. We also know that it is always possible to
* have opposite faces have parallel normal vectors. (For both things,
* see the Agelek, Anderson, Bangerth, Barth paper mentioned in the
- * publications list.)
+ * documentation of the GridReordering class.)
*
* The problem is that we originally had another condition, namely that
* faces 0, 2 and 6 have normals that point into the cell, while the