Login / Signup
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
Michael R. Fellows
Guillaume Fertin
Danny Hermelin
Stéphane Vialette
Published in:
ICALP (2007)
Keyphrases
</>
strongly connected
directed graph
undirected graph
hamiltonian cycle
labeled graphs
constraint satisfaction
high quality
graph theoretic
neighborhood graph
attributed graphs
connected components
dna sequences
connected subgraphs
maximum cardinality