Benchmarking Complexity of Dinic's With Scaling

Правка en1, от Chilli, 2019-03-18 00:08:21

In various places(1, 2, ), people have talked about "Dinic's With Scaling" having $$$O(VElog(U))$$$ complexity, where U is the max edge capacity,.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en13 Английский Chilli 2019-03-19 10:44:20 2 Tiny change: 'astest: 0.10 \n\n\nV' -> 'astest: 0.00 \n\n\nV'
en12 Английский Chilli 2019-03-19 10:13:29 109
en11 Английский Chilli 2019-03-19 06:34:52 2 Tiny change: 'haracters:\nMine: 11' -> 'haracters: \nMine: 11'
en10 Английский Chilli 2019-03-19 06:34:35 5
en9 Английский Chilli 2019-03-19 06:33:16 784 (published)
en8 Английский Chilli 2019-03-19 05:16:53 101
en7 Английский Chilli 2019-03-19 04:49:23 108
en6 Английский Chilli 2019-03-19 04:30:32 4 Tiny change: ' fastest: \n\n\n' -> ' fastest: 0.10\n\n\n'
en5 Английский Chilli 2019-03-19 04:17:31 540
en4 Английский Chilli 2019-03-19 03:39:48 334
en3 Английский Chilli 2019-03-18 22:14:30 1042 Tiny change: 'them in a chart.\n' -> 'them in a ![chart](https://i.imgur.com/gKqkpgd.jpg)\n\n'
en2 Английский Chilli 2019-03-18 05:07:24 1400
en1 Английский Chilli 2019-03-18 00:08:21 291 Initial revision (saved to drafts)