Engineering Motif Search for Large Graphs

DOI10.1137/1.9781611973754.10MaRDI QIDQ5232527zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Engineering motif search for large motifs
• Finding approximate and constrained motifs in graphs
• Finding approximate and constrained motifs in graphs
• Fast analytical methods for finding significant labeled graph motifs
• Parallel Discovery of Top-k Weighted Motifs in Large Graphs
• Experimental and Efficient Algorithms

Cited in

(12)

• Randomised enumeration of small witnesses using a decision oracle
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• The graph motif problem parameterized by the structure of the input graph
• Constrained multilinear detection and generalized graph motifs
• Deterministic subgraph detection in broadcast CONGEST
• Constrained multilinear detection for faster functional motif discovery
• Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation
• Engineering motif search for large motifs
• Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
• Parameterized algorithms for list \(K\)-cycle
• Determinantal sieving
• Algorithm engineering for color-coding with applications to signaling pathway detection

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

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