Czech Digital Mathematics Library (Institute of Mathematics CAS) · 1985 · 230 citations · 0 references
Open access
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationComputational ComplexityGraph AlgorithmsGraph TheoryComputational Complexity Of Graph AlgorithmsSpace Complexity Of Graph ProblemsSubgraph Isomorphism
Aba tract: The complexity of the problem "Does a giTengraph contain a complete subgraph with k Tertices?" is 0(n ).