Concepedia

On the complexity of the subgraph problem

Jaroslav Nešetřil, Svatopluk Poljak

Czech digital mathematics library · 1985 · 229 citations · 0 references

Full text

Open access

Abstract

Aba tract: The complexity of the problem "Does a giTengraph contain a complete subgraph with k Tertices?" is 0(n ).