Finding Approximate and Constrained Motifs in Graphs
type: Item
instance of: scholarly article
title: Finding Approximate and Constrained Motifs in Graphs
zbMATH Open document ID: 1339.92025
DOI: 10.1007/978-3-642-21458-5_33
author: Riccardo Dondi
author: Guillaume Fertin
author: Stéphane Vialette
published in: Combinatorial Pattern Matching
publication date: 2011-06-29T00:00:00Z
Mathematics Subject Classification ID: 92C42
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5915017
zbMATH Keywords: constrained graph motif
zbMATH Keywords: metabolic network analysis
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
full work available at URL: 978-3-642-21458-5 33
OpenAlex ID: W2179833021
cites work: On the Kernelization Complexity of Colorful Motifs
cites work: Some APX-completeness results for cubic graphs
cites work: Color-coding
cites work: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
cites work: The Turing way to parameterized complexity
cites work: Maximum Motif Problem in Vertex-Colored Graphs
cites work: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
cites work: Finding and Counting Vertex-Colored Subtrees
cites work: Research in Computational Molecular Biology
cites work: Q5710169
cites work: Non deterministic polynomial optimization problems and their approximations
description: scientific article