Engineering Motif Search for Large Graphs

DOI10.1137/1.9781611973754.10zbMath1429.68177OpenAlexW1710394092MaRDI QIDQ5232527

Juho Lauri, Andreas Björklund, Łukasz Kowalik, Petteri Kaski

Publication date: 12 September 2019

Published in: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973754.10

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

The graph motif problem parameterized by the structure of the input graph ⋮ Deterministic Subgraph Detection in Broadcast CONGEST. ⋮ Randomised enumeration of small witnesses using a decision oracle ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ Finding Hamiltonian Cycle in Graphs of Bounded Treewidth ⋮ Unnamed Item ⋮ Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

This page was built for publication: Engineering Motif Search for Large Graphs