Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths

DOI10.4230/LIPICS.STACS.2022.23MaRDI QIDQ6490972zbMATH OpenFDO

Authors Yung-Chung Chiu, Hsueh-I Lu

Publication date 23 April 2024

zbMATH Keywords

induced subgraphdynamic data structureinduced pathnon-shortest path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths

This page was built for publication: Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490972)