All geek questions in one place

Amazing families of algorithms over implicit graphs

Dynamic programming, by definition, allows you to find the shortest / longest path for an implicit dag. Each DP algorithm simply does this.

The holographic algorithm can be freely described as something that calculates perfect matches in implicit flat graphs.

So my question is: are there any other families of algorithms that use well-known algorithms for implicit graphs to achieve significant acceleration?

+3
source share
2 answers

, , matroid. - , , ( , ( ) 2 ), .

, - !

+3

, , - . , , NP . , .

, , , , . , .

, , , (, , -); , . , , . , . , .

, ; , ( ). " " . - , - , .

, ; , .

, , , , , !

+3

Source: https://habr.com/ru/post/1742213/

More articles:


All Articles