| Title: |
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Marek Cygan |
-
Institute of Informatics, University of Warsaw, Poland
|
| Fedor V. Fomin |
-
University of Bergen, Norway
-
St. Petersburg Department of Steklov Institute of Mathematics of the Russian Academy of Sciences, Russia
|
| Alexander Golovnev |
-
New York University, USA
-
St. Petersburg Department of Steklov Institute of Mathematics of the Russian Academy of Sciences, Russia
|
| Alexander S. Kulikov |
-
St. Petersburg Department of Steklov Institute of Mathematics of the Russian Academy of Sciences, Russia
|
| Ivan Mihajlin |
-
University of California—San Diego, USA
|
| Jakub Pachocki |
-
Carnegie Mellon University, USA
|
| Arkadiusz Socala |
-
University of Warsaw, Poland, Institute of Informatics
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1319051,
1065106
|
| DBLP Key: |
conf/soda/CyganFGKMPS16
|
| Author Comments: |
|