Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6490972)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths |
scientific article; zbMATH DE number 7836590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths |
scientific article; zbMATH DE number 7836590 |
Statements
Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (English)
0 references
23 April 2024
0 references
induced subgraph
0 references
induced path
0 references
non-shortest path
0 references
dynamic data structure
0 references
