maxdan94
  • Member for 8 years, 1 month
  • Last seen more than a month ago
  • Paris, France
72 answers
480 votes
175k views
974 bookmarks
What papers should everyone read?
7 answers
56 votes
4k views
16 bookmarks
For which problems in P is it easier to verify the result than to find it?
10 answers
40 votes
13k views
20 bookmarks
Data for testing graph algorithms
0 answers
16 votes
550 views
5 bookmarks
Linear-time algorithm to test if clique number equals degeneracy bound?
2 answers
12 votes
777 views
3 bookmarks
Graph classes for which the diameter can be computed in linear time
1 answers
10 votes
2k views
3 bookmarks
Count $k$-hop neighborhood for every vertex
3 answers
8 votes
362 views
2 bookmarks
Check if graph stays connected after edge swap
3 answers
8 votes
804 views
7 bookmarks
Is this vertex ordering optimization NP-Hard?
0 answers
2 votes
32 views
1 bookmarks
Pagerank update upon vertex removal
0 answers
2 votes
300 views
1 bookmarks
Can Lexicographic BFS be implemented in logspace?