On the Complexity of String Matching for Graphs

Massimo Equi; Roberto Grossi; Veli Mäkinen; Alexandru Tomescu

doi:10.4230/LIPIcs.ICALP.2019.55

On the Complexity of String Matching for Graphs

Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru Tomescu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

Original language	English
Title of host publication	46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Editors	Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi
Number of pages	15
Place of Publication	Dagstuhl, Germany
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date	2019
Pages	55:1--55:15
ISBN (Print)	978-3-95977-109-2
DOIs	https://doi.org/10.4230/LIPIcs.ICALP.2019.55
Publication status	Published - 2019
MoE publication type	A4 Article in conference proceedings
Event	International Colloquium on Automata, Languages and Programming - Patras, Greece Duration: 8 Jul 2019 → 12 Jul 2019 Conference number: 46 https://icalp2019.upatras.gr/

Publication series

Name	Leibniz International Proceedings in Informatics (LIPIcs)
Publisher	Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Volume	132
ISSN (Print)	1868-8969

Fields of Science

113 Computer and information sciences

Access to Document

10.4230/LIPIcs.ICALP.2019.55Licence: CC BY

LIPIcs-ICALP-2019-55Final published version, 704 KBLicence: CC BY

Cite this

Equi, M., Grossi, R., Mäkinen, V., & Tomescu, A. (2019). On the Complexity of String Matching for Graphs. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (pp. 55:1--55:15). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 132). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2019.55

Equi, Massimo ; Grossi, Roberto ; Mäkinen, Veli et al. / On the Complexity of String Matching for Graphs. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). editor / Christel Baier ; Ioannis Chatzigiannakis ; Paola Flocchini ; Stefano Leonardi. Dagstuhl, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. pp. 55:1--55:15 (Leibniz International Proceedings in Informatics (LIPIcs)).

@inproceedings{756ce08c93724112b7f1a9d501ae88e7,

title = "On the Complexity of String Matching for Graphs",

keywords = "113 Computer and information sciences",

author = "Massimo Equi and Roberto Grossi and Veli M{\"a}kinen and Alexandru Tomescu",

year = "2019",

doi = "10.4230/LIPIcs.ICALP.2019.55",

language = "English",

isbn = "978-3-95977-109-2",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",

pages = "55:1----55:15",

editor = "Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi",

booktitle = "46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)",

address = "Germany",

note = "International Colloquium on Automata, Languages and Programming, ICALP 2019 ; Conference date: 08-07-2019 Through 12-07-2019",

url = "https://icalp2019.upatras.gr/",

}

Equi, M, Grossi, R, Mäkinen, V & Tomescu, A 2019, On the Complexity of String Matching for Graphs. in C Baier, I Chatzigiannakis, P Flocchini & S Leonardi (eds), 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 55:1--55:15, International Colloquium on Automata, Languages and Programming, Patras, Greece, 08/07/2019. https://doi.org/10.4230/LIPIcs.ICALP.2019.55

On the Complexity of String Matching for Graphs. / Equi, Massimo; Grossi, Roberto; Mäkinen, Veli et al.
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). ed. / Christel Baier; Ioannis Chatzigiannakis; Paola Flocchini; Stefano Leonardi. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. p. 55:1--55:15 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 132).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - On the Complexity of String Matching for Graphs

AU - Equi, Massimo

AU - Grossi, Roberto

AU - Mäkinen, Veli

AU - Tomescu, Alexandru

N1 - Conference code: 46

PY - 2019

Y1 - 2019

KW - 113 Computer and information sciences

U2 - 10.4230/LIPIcs.ICALP.2019.55

DO - 10.4230/LIPIcs.ICALP.2019.55

M3 - Conference contribution

SN - 978-3-95977-109-2

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 55:1--55:15

BT - 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

A2 - Baier, Christel

A2 - Chatzigiannakis, Ioannis

A2 - Flocchini, Paola

A2 - Leonardi, Stefano

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

CY - Dagstuhl, Germany

T2 - International Colloquium on Automata, Languages and Programming

Y2 - 8 July 2019 through 12 July 2019

ER -

Equi M, Grossi R, Mäkinen V , Tomescu A. On the Complexity of String Matching for Graphs. In Baier C, Chatzigiannakis I, Flocchini P, Leonardi S, editors, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2019. p. 55:1--55:15. (Leibniz International Proceedings in Informatics (LIPIcs)). doi: 10.4230/LIPIcs.ICALP.2019.55