Probably optimal graph motifs

DOI10.4230/LIPICS.STACS.2013.20MaRDI QIDQ2957868zbMATH OpenOpenAlexFDO

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

Publication date 30 January 2017

Full work available at URL https://arxiv.org/pdf/1209.1082v3

zbMATH Keywords

FPT algorithmgraph motif

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Constrained multilinear detection and generalized graph motifs
• Maximum Motif Problem in Vertex-Colored Graphs
• Complexity issues in vertex-colored graph pattern matching
• Graph motif problems parameterized by dual
• Some results on more flexible versions of Graph Motif

Cited in

(12)

• Randomised enumeration of small witnesses using a decision oracle
• Partial information network queries
• Algorithms for topology-free and alignment network queries
• Some results on more flexible versions of Graph Motif
• Improved parameterized algorithms for network query problems
• Fixed-parameter algorithms for scaffold filling
• Constrained multilinear detection and generalized graph motifs
• On finding rainbow and colorful paths
• Improved parameterized algorithms for network query problems
• Parameterized algorithms for the module motif problem
• Spotting trees with few leaves
• Spotting trees with few leaves

This page was built for publication: Probably optimal graph motifs

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