Christian Wulff-Nilsen

Search results

• 2009

  Girth of a Planar Digraph with Real Edge Weights in O(nlog³n) Time.

  Wulff-Nilsen, C., 2009, p. 1-8, 8 p.

  Research output: Working paper › Research

• Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid

  Wulff-Nilsen, C., 2009, Datalogisk Institut, Københavns Universitet (DIKU), 15 p.

  Research output: Working paper › Research

• Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time.

  Wulff-Nilsen, C., 2009, p. 1-47, 47 p.

  Research output: Working paper › Research

• Solving the Replacement Paths Problem for Planar Directed Graphs in O(nlog n) Time

  Wulff-Nilsen, C., 2009, København: Datalogisk Institut, p. 1-21, 21 p.

  Research output: Working paper › Research
• 2008

  Computing the Maximum Detour of a Plane Graph in Subquadratic Time

  Wulff-Nilsen, C., 2008, København: Department of Computer Science, University of Copenhagen, 25 p.

  Research output: Working paper › Research

  Open Access

  File
  842 Downloads (Pure)

• Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time

  Wulff-Nilsen, C., 2008, DIKU, p. 1-10, 10 p.

  Research output: Working paper

  Open Access

  File
  1637 Downloads (Pure)

• Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time

  Wulff-Nilsen, C., 2008, København: Department of Computer Science, University of Copenhagen, 30 p.

  Research output: Working paper

  Open Access

  File
  2036 Downloads (Pure)