Upper and Lower Bounds for Finding Connected Motifs in Vertex-colored Graphs

Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stephane

doi:10.1016/j.jcss.2010.07.003

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Upper and Lower Bounds for Finding Connected Motifs in Vertex-colored Graphs

MPS-Authors

/persons/resource/persons44612

Hermelin, Danny
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Fellows, M. R., Fertin, G., Hermelin, D., & Vialette, S. (2011). Upper and Lower Bounds for Finding Connected Motifs in Vertex-colored Graphs. Journal of Computer and System Sciences, 77(4), 799-811. doi:10.1016/j.jcss.2010.07.003.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-12BD-1

Abstract

There is no abstract available