z-logo
open-access-imgOpen Access
Graph Motif Problems Parameterized by Dual
Author(s) -
Guillaume Fertin,
Christian Komusiewicz
Publication year - 2020
Publication title -
journal of graph algorithms and applications
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00538
Subject(s) - parameterized complexity , computer science , motif (music) , dual graph , graph , dual (grammatical number) , combinatorics , theoretical computer science , mathematics , algorithm , planar graph , physics , art , literature , 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