Sign in
Upper and lower bounds for finding connected motifs in vertex-colored graphs.
Michael R. Fellows
Guillaume Fertin
Danny Hermelin
Stéphane Vialette
Published in:
J. Comput. Syst. Sci. (2011)
Keyphrases
</>
upper and lower bounds
upper bound
lower bound
directed graph
lower and upper bounds
strongly connected
undirected graph
labeled graphs
attributed graphs
dna sequences
connected components
dnf formulas
connected graphs
probability distribution
sample complexity