Pages that link to "Item:Q888440"
From MaRDI portal
The following pages link to Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440):
Displaying 7 items.
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
- (Q3121527) (← links)
- (Q5090953) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
