| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6876016 | Theoretical Computer Science | 2015 | 10 Pages |
Abstract
Finally, we derive several results relating the complexity of the edge-colored variant of induced subgraph isomorphism to that of the standard variant.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Peter Floderus, MirosÅaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell,