The Descriptive Complexity of Subgraph Isomorphism Without Numerics
Sign Up to like & getrecommendations! Published in 2018 at "Theory of Computing Systems"
DOI: 10.1007/s00224-018-9864-3
Abstract: Let F be a connected graph with ℓ vertices. The existence of a subgraph isomorphic to F can be defined in first-order logic with quantifier depth no better than ℓ, simply because no first-order formula… read more here.
Keywords: descriptive complexity; connected graphs; quantifier depth; subgraph ... See more keywords