Skip to main content
Theoretical Computer Science
Christian Sommer's user avatar
Christian Sommer's user avatar
Christian Sommer's user avatar
Christian Sommer
  • Member for 13 years, 7 months
  • Last seen more than 8 years ago
Profile Activity
Stats
761
reputation
13k
reached
10
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
7
bronze badges
Top tags
View all tags
28
Score
5
Posts
50
Posts %
28
Score
3
Posts
30
Posts %
17
Score
5
Posts
50
Posts %
17
Score
3
Posts
30
Posts %
11
Score
1
Posts
10
Posts %
11
Score
1
Posts
10
Posts %
Top posts
answer
11
Partitioning graphs while minimizing inter-partition edges
Feb 23, 2014
answer
10
Special cases of Graphic TSP
Apr 3, 2012
answer
10
About properties of adjacency matrix when a graph is planar
Apr 6, 2012
answer
7
Computing a transitive completion / path existence oracle
Jul 20, 2014
answer
5
Are any of the state of the art Maximum Flow algorithms practical?
Sep 2, 2014
answer
4
Core algorithms deployed
Nov 24, 2013
answer
4
Dynamic all-pairs shortest paths - O(1) query
Mar 18, 2013
answer
3
Online version of All pair shortest path when path weights are updated
Aug 25, 2013
answer
2
The existence of planar distance preserver?
Apr 25, 2011
answer
0
How do the state-of-the-art pathfinding algorithms for changing graphs (D*, D*-Lite, LPA*, etc) differ?
Feb 24, 2013