Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte 
Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders

Roth, Marc; Schmitt, Johannes; Wellnitz, Philip

doi:10.4230/LIPIcs.ICALP.2021.108

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders

MPS-Authors

/persons/resource/persons229250

Wellnitz, Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2021/14177/
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

LIPIcs-ICALP-2021-108.pdf
(Publisher version), 850KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Roth, M., Schmitt, J., & Wellnitz, P. (2021). Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. In N. Bansal, E. Merelli, & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2021.108.

Cite as: https://hdl.handle.net/21.11116/0000-0009-AFBF-C

Abstract

There is no abstract available