Finding and listing induced paths and cycles

DOI10.1016/j.dam.2012.01.024zbMath1259.05094OpenAlexW1976577139MaRDI QIDQ1941391

R. Sritharan, Chính T. Hoàng, Joe Sawada, Marcin Kaminski

Publication date: 12 March 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.024

zbMATH Keywords

graph algorithminduced cycleinduced path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Induced subgraph isomorphism: are some patterns substantially easier than others? ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques ⋮ A fast deterministic detection of small pattern graphs in graphs without large cliques ⋮ Detecting and Counting Small Pattern Graphs ⋮ Detecting and enumerating small induced subgraphs in \(c\)-closed graphs ⋮ Best match graphs and reconciliation of gene trees with species trees

This page was built for publication: Finding and listing induced paths and cycles