Explore >> Select a destination
|
You are here 
|
lh3.github.io | ||
| | | | |
dominiczypen.wordpress.com
|
|
| | | | | Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$... | |
| | | | |
jessegalef.com
|
|
| | | | | You might know all about the 'Birthday Paradox', but I bet you can't solve this mathy variant. Birthdays, Bridges of Konigsberg, de Bruijn Graphs, and... Bgenomics. | |
| | | | |
royvanrijn.com
|
|
| | | | | Follow up on the previous blogpost.Yesterday I wrote an algorithm in Java to generate de Bruijn sequences. But I had a breakthrough after reading:K. Cattell,... | |
| | | | |
www.pullrequest.com
|
|
| | | Reading these foundational books will help you understand software development processes more, how to reduce technical debt, and contribute higher-quality code. | ||
