Pages that link to "Item:Q2872118"
From MaRDI portal
The following pages link to Detecting and Counting Small Pattern Graphs (Q2872118):
Displaying 10 items.
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Counting and detecting small subgraphs via equations (Q2848542) (← links)
- Finding patterns in an unknown graph (Q3164974) (← links)
- Recognizing small subgraphs (Q4861348) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)