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

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Originalspråk	engelska
Titel på värdpublikation	46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Redaktörer	Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi
Antal sidor	15
Utgivningsort	Dagstuhl, Germany
Förlag	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Utgivningsdatum	2019
Sidor	55:1--55:15
ISBN (tryckt)	978-3-95977-109-2
DOI	https://doi.org/10.4230/LIPIcs.ICALP.2019.55
Status	Publicerad - 2019
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	International Colloquium on Automata, Languages and Programming - Patras, Grekland Varaktighet: 8 juli 2019 → 12 juli 2019 Konferensnummer: 46 https://icalp2019.upatras.gr/

Publikationsserier

Namn	Leibniz International Proceedings in Informatics (LIPIcs)
Förlag	Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Volym	132
ISSN (tryckt)	1868-8969

Vetenskapsgrenar

113 Data- och informationsvetenskap

Åtkomst av dokument

10.4230/LIPIcs.ICALP.2019.55Licens: CC BY

LIPIcs-ICALP-2019-55Slutlig publicerad version, 704 KBLicens: CC BY

Citera det här

Equi, M., Grossi, R., Mäkinen, V., & Tomescu, A. (2019). On the Complexity of String Matching for Graphs. I C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Red.), 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (s. 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). redaktör / Christel Baier ; Ioannis Chatzigiannakis ; Paola Flocchini ; Stefano Leonardi. Dagstuhl, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. s. 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. i C Baier, I Chatzigiannakis, P Flocchini & S Leonardi (red), 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, s. 55:1--55:15, International Colloquium on Automata, Languages and Programming, Patras, Grekland, 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). red. / Christel Baier; Ioannis Chatzigiannakis; Paola Flocchini; Stefano Leonardi. Dagstuhl, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. s. 55:1--55:15 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 132).

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › 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. I Baier C, Chatzigiannakis I, Flocchini P, Leonardi S, redaktörer, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2019. s. 55:1--55:15. (Leibniz International Proceedings in Informatics (LIPIcs)). doi: 10.4230/LIPIcs.ICALP.2019.55