z-logo
open-access-imgOpen Access
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
Author(s) -
Massimo Equi,
Roberto Grossi,
Veli Mäkinen
Publication year - 2019
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - degree (music) , bounded function , binary number , matching (statistics) , mathematics , computer science , combinatorics , discrete mathematics , theoretical computer science , arithmetic , physics , statistics , mathematical analysis , acoustics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom