Pages that link to "Item:Q5212856"
From MaRDI portal
The following pages link to Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (Q5212856):
Displaying 7 items.
- (Q5091161) (← links)
- Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
- Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
- Finding and counting small tournaments in large tournaments (Q6652454) (← links)
