Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		lh3.github.io Immature thoughts on assembly De Bruijn graphs
\|	\|	www.kuniga.me DNA Assembly	3.4 parsecs away Travel
\|	\|	NP-Incompleteness:	3.4 parsecs away Travel
\|	\|	dominiczypen.wordpress.com Making critical graphs as regular as possible \| Musings on general topology and orderings	4.8 parsecs away Travel
\|	\|	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$...	4.8 parsecs away Travel
\|	\|	swethatanamala.github.io Introduction to Graph theory · Swetha's Blog	5.9 parsecs away Travel
\|	\|	As a series of posts, I would be working and explaining on deep graph neural networks. So, In this blog I give introduction to Graph theory	5.9 parsecs away Travel
\|	\|	mkatkov.wordpress.com Semiprime factorization and modular arithmetics \| Crackpot Trisector Notes	25.5 parsecs away Travel
\|		Edit 6.6.2016. Premature optimization is a source for errors. The following is completely wrong. Would like to smoke the same thing again. Linear algebra does not work here. We need characterization of quotient space. What I do not understand is why fast methods are working modulo number itself, but not other prime numbers. Suppose we...	25.5 parsecs away Travel