user avatar
user avatar
user avatar
maxdan94
  • Member for 8 years, 6 months
  • Last seen more than 1 year ago
  • Paris, France
480 votes
72 answers
177k views

What papers should everyone read?

56 votes
7 answers
4k views

For which problems in P is it easier to verify the result than to find it?

40 votes
10 answers
13k views

Data for testing graph algorithms

17 votes
0 answers
568 views

Linear-time algorithm to test if clique number equals degeneracy bound?

12 votes
2 answers
801 views

Graph classes for which the diameter can be computed in linear time

  • 3,160
11 votes
1 answer
2k views

Count $k$-hop neighborhood for every vertex

  • 111
8 votes
3 answers
390 views

Check if graph stays connected after edge swap

  • 83
8 votes
3 answers
854 views

Is this vertex ordering optimization NP-Hard?

  • 533
2 votes
0 answers
32 views

Pagerank update upon vertex removal

2 votes
0 answers
310 views

Can Lexicographic BFS be implemented in logspace?

  • 21