Pages that link to "Item:Q5222874"
From MaRDI portal
The following pages link to Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism (Q5222874):
Displaying 4 items.
- First-order complexity of subgraph isomorphism via Kneser graphs (Q2037624) (← links)
- First-order definitions of subgraph isomorphism through the adjacency and order relations (Q2211263) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)