eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2020-12-04
34:1
34:17
10.4230/LIPIcs.FSTTCS.2020.34
article
Weighted Tiling Systems for Graphs: Evaluation Complexity
Aiswarya, C.
1
2
https://orcid.org/0000-0002-4878-7581
Gastin, Paul
3
https://orcid.org/0000-0002-1313-7722
Chennai Mathematical Institute, India
IRL ReLaX, CNRS, France
LSV, ENS Paris-Saclay, CNRS, Université Paris-Saclay, France
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of every node belongs to a set of permissible tiles, and assigns a weight accordingly. The weight of a labeling is the semiring-product of the weights assigned to the nodes, and the weight of the graph is the semiring-sum of the weights of labelings. We show that we can model interesting algorithmic questions using this formalism - like computing the clique number of a graph or computing the permanent of a matrix. The evaluation problem is, given a weighted tiling system and a graph, to compute the weight of the graph. We study the complexity of the evaluation problem and give tight upper and lower bounds for several commutative semirings. Further we provide an efficient evaluation algorithm if the input graph is of bounded tree-width.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol182-fsttcs2020/LIPIcs.FSTTCS.2020.34/LIPIcs.FSTTCS.2020.34.pdf
Weighted graph tiling
tiling automata
Evaluation
Complexity
Tree-width