scientific article
From MaRDI portal
Publication:3304125
DOI10.4230/LIPIcs.STACS.2018.27zbMath1487.68125MaRDI QIDQ3304125
Paweł Rzążewski, László Egri, Dániel Marx
Publication date: 5 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Unnamed Item ⋮ Unnamed Item ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- \(H\)-coloring dichotomy revisited
- List homomorphisms of graphs with bounded degrees
- A new line of attack on the dichotomy conjecture
- On the complexity of H-coloring
- List homomorphisms to reflexive graphs
- List homomorphisms and circular arc graphs
- Dichotomy for tree-structured trigraph list homomorphism problems
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth
- A New Proof of the H-Coloring Dichotomy
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Representation of a finite graph by a set of intervals on the real line
- Fourier meets M\"{o}bius: fast subset convolution
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Graph colorings with local constraints -- a survey
- List Partitions
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy
- Bi‐arc graphs and the complexity of list homomorphisms
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
This page was built for publication:
