scientific article; zbMATH DE number 6862117

DOI10.4230/LIPIcs.STACS.2017.25zbMath1402.68087arXiv1702.05447MaRDI QIDQ4636623

Marc Roth, Holger Dell, Radu Curticapean

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1702.05447

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

homomorphismsmatchingsline graphsparameterized complexitycounting complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Compactors for parameterized counting problems ⋮ Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ Unnamed Item ⋮ Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices

This page was built for publication: