csamuelsm / hardness-wiki

A repo/site to work like a wiki of computational problems and their current computational complexity picture.

Hey, I'm Samuel! 👋

I'm a Computer Scientist graduated by UFCA. I'm also a Full-Stack Developer and Graph Theory/Algorithms researcher. I won the Best Scientific Initiation Award at the LV Brazilian Operational Research Symposium (SBPO 2023) in the Graph Theory and Algorithms area.

I'm the creator of the game Guess the Movie and Filme Secreto (Portuguese version).

You can check other projects of mine below and you can know more about me and my works in my website.

My interests are: Graph Theory, Algorithms, Computational Complexity, Parameterized Complexity, Artificial Inteligence, Network Science and Scientific Computing.

I also like to read and know more about game making, design, art, science and maths.

😄 Pronouns: He/Him

If you like my works, please consider sponsoring me:

• Github Sponsors:
• Buy me a coffee:
• PayPal: Donate
• Pix: 9860c0ad-1cfe-4b59-9d76-1a43a4e3461e

hardness-wiki's Issues

Clique

Given a graph $G = (V, E)$, a clique of $G$ is a subset of vertices $S \subseteq V(G)$ such that all vertices of $S$ are pairwise adjacent. The clique problem asks if, given a graph $G$ and a positive integer $k$, is it possible to find a clique with at least $k$ vertices in $G$?

Vertex Cover

Teste