Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more

New answers tagged

3 votes

Number of graphs that almost contain a $k$-clique

It is easy to see that for $k = 2$ the only graph almost containing $k$-clique is an empty graph $nK_1$. I don't have a proof, but I guess, that $\#G(n, 3)$ is exponential. Also the number $\#G(n, 3)$ ...
Smylic's user avatar
  • 225
0 votes

Finding an $st$-path in a planar graph which is adjacent to the fewest number of faces

First off, note that this problem is only well-specified for a given planar embedding (or plane graph) of the planar graph, the planar graph itself is not enough as it doesn't encode which vertices ...
MarioVX's user avatar
  • 11
0 votes

The Hydra Game algorithm

Glad it's not just me facing the same problem. I also cannot reproduce the expected value of 938038. The algorithm is definitely unclear. I have tried 4 variants of what I think the algorithm could be ...
Andrew Parker's user avatar
0 votes

The Hydra Game algorithm

One thing I have noticed is that the question asker assumed "right-most" meant the "last" leaf on the level with the most leaves, and the other answers here have assumed "...
NaturalLogZ's user avatar
0 votes

The Hydra Game algorithm

This is my mediocre attempt to write a program that solves the problem ...
Abdelhakim AKODADI's user avatar
0 votes

The Hydra Game algorithm

The problem is in the line: i = hydra.index(max(hydra)) Running the code and printing: print(hydra, i, step) gives us this: <...
Saaasaab's user avatar

Top 50 recent answers are included