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

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-12BD-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-06A5-9

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Fellows, Michael R.¹, Author
Fertin, Guillaume¹, Author
Hermelin, Danny², Author
Vialette, Stephane¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2011Date issued: 2011

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 618696
DOI: 10.1016/j.jcss.2010.07.003
URI: http://dx.doi.org/10.1016/j.jcss.2010.07.003
Other: Local-ID: C1256428004B93B8-CBCF4F1DC0B9CA3AC1257965003AF7C7-FellowsFertinHermelinVialette2011

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Computer and System Sciences

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 77 (4) Sequence Number: - Start / End Page: 799 - 811 Identifier: ISSN: 0022-0000