The first order definability of graphs: Upper bounds for quantifier depth.
Oleg PikhurkoHelmut VeithOleg VerbitskyPublished in: Discret. Appl. Math. (2006)
Keyphrases
- upper bound
- quantifier elimination
- lower bound
- upper and lower bounds
- finite model theory
- first order logic
- graph theoretic
- tight bounds
- lower and upper bounds
- propositional logic
- graph theory
- graph matching
- constraint propagation
- depth information
- depth map
- higher order
- worst case
- mazurkiewicz traces
- database theory
- tight upper and lower bounds
- branch and bound algorithm
- fixed point
- sample complexity
- graph mining
- graph structure
- functional programming
- bipartite graph
- directed graph
- undirected graph
- graph databases
- graph model
- concept classes
- constant factor
- efficiently computable