Probably optimal graph motifs
From MaRDI portal
Publication:2957868
DOI10.4230/LIPIcs.STACS.2013.20zbMath1354.68108OpenAlexW2290889164MaRDI QIDQ2957868
Andreas Björklund, Petteri Kaski, Łukasz Kowalik
Publication date: 30 January 2017
Full work available at URL: https://arxiv.org/pdf/1209.1082v3
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
On finding rainbow and colorful paths ⋮ Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ Parameterized algorithms for the module motif problem ⋮ Improved Parameterized Algorithms for Network Query Problems ⋮ Improved parameterized algorithms for network query problems ⋮ Randomised enumeration of small witnesses using a decision oracle ⋮ Algorithms for topology-free and alignment network queries ⋮ Algebraic methods in the congested clique ⋮ Partial information network queries ⋮ Fixed-parameter algorithms for scaffold filling ⋮ Some results on more flexible versions of Graph Motif ⋮ Constrained multilinear detection and generalized graph motifs
This page was built for publication: Probably optimal graph motifs
