Year: 1985
Type: other
Abstract: Aba tract: The complexity of the problem "Does a giTengraph contain a complete subgraph with k Tertices?" is 0(n ).
Authors: Jaroslav Nešetřil, Svatopluk Poljak
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W104109059