Pagwin/new_blog
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

correction

Browse source
This commit is contained in:
Pagwin 2025-05-27 21:03:32 -04:00
parent c30aea7451
commit 6cb55d904c
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
posts/tolerant-graph-synchronization.md
View file

@ -51,7 +51,7 @@ The reason I don't include those yet is because I'm not sure what needs to be in
I suspect (with my gut) the optimal solution is just to have the initial non-black node be red and then have the rule "if any neighbors are red turn red".
I don't know if exponential graphs like social graphs mess that solution up though or if all the alternatives do no better.
I don't know if ~~exponential graphs~~(edit: made up a term oops) scale-free networks like social graphs mess that solution up though or if all the alternatives do no better.
## Conclusion