Pages that link to "Item:Q1941391"
From MaRDI portal
The following pages link to Finding and listing induced paths and cycles (Q1941391):
Displaying 8 items.
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- Best match graphs and reconciliation of gene trees with species trees (Q2303745) (← links)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
