Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

Michael Fellows, G Fertin, D Hermelin, S Vialette

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper published in Proceedings › peer-review

Original language	English
Title of host publication	Lecture Notes in Computer Science
Place of Publication	Berlin, Germany
Publisher	Springer
Pages	-
Number of pages	12
ISBN (Print)	0302-9743
Publication status	Published - 2007
Event	ICALP 2007. International Colloquium on Automata, Languages and Programming - Wroclaw Duration: 9 Jul 2007 → 13 Jul 2007

Conference	ICALP 2007. International Colloquium on Automata, Languages and Programming
Period	9/07/07 → 13/07/07

Cite this

@inproceedings{55973ea1dc2f4c0583bdee74cda3a359,

title = "Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs",

author = "Michael Fellows and G Fertin and D Hermelin and S Vialette",

year = "2007",

language = "English",

isbn = "0302-9743",

pages = "--",

booktitle = "Lecture Notes in Computer Science",

publisher = "Springer",

address = "Switzerland",

note = "ICALP 2007. International Colloquium on Automata, Languages and Programming ; Conference date: 09-07-2007 Through 13-07-2007",

}

TY - GEN

T1 - Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

AU - Fellows, Michael

AU - Fertin, G

AU - Hermelin, D

AU - Vialette, S

PY - 2007

Y1 - 2007

M3 - Conference Paper published in Proceedings

SN - 0302-9743

SP - -

BT - Lecture Notes in Computer Science

PB - Springer

CY - Berlin, Germany

T2 - ICALP 2007. International Colloquium on Automata, Languages and Programming

Y2 - 9 July 2007 through 13 July 2007

ER -