An Algorithmic Framework for Locally Constrained Homomorphisms

Authors: Bulteau, Laurent, Dabrowski, Konrad, Köhler, Noleen, Ordyniak, Sebastian, Paulusma, Daniël

Contributors: Bulteau, Laurent, Bekos, M.A., Kaufmann, M.

Source: Lecture Notes in Computer Science ISBN: 9783031159138
Bekos, M.A. & Kaufmann, M. (Eds.). Graph-Theoretic Concepts in Computer Science. WG 2022. : Springer, pp. 114-128, Lecture Notes in Computer Science, Vol.13453

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), fracture number, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, (locally constrained) graph homomorphism parameterized complexity fracture number, integer linear programming, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), parameterized complexity, role assignment, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism, deletion set/modulator to small components, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism parameterized complexity deletion set/modulator to small components role assignment integer linear programming, Computer Science - Computational Complexity, Combinatorics (math.CO), Recherche opérationnelle, (locally constrained) graph homomorphism, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2201.11731
https://hal.science/hal-04495171v1
https://doi.org/10.1007/978-3-031-15914-5_9
https://hal.science/hal-04495171v1/document
http://dro.dur.ac.uk/37188/
http://dro.dur.ac.uk/37188/1/37188.pdf
https://doi.org/10.1007/978-3-031-15914-5_9

An Algorithmic Framework for Locally Constrained Homomorphisms

Authors: Bulteau, Laurent, Dabrowski, Konrad, Köhler, Noleen, Ordyniak, Sebastian, Paulusma, Daniël

Contributors: Laboratoire d'Informatique Gaspard-Monge (LIGM), École nationale des ponts et chaussées (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Newcastle University Newcastle, Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), University of Leeds, Durham University

Source: ISSN: 0895-4801 ; SIAM Journal on Discrete Mathematics ; https://hal.science/hal-04797299 ; SIAM Journal on Discrete Mathematics, 2024, 38 (2), pp.1315-1350. ⟨10.1137/22M1513290⟩.

Subject Terms: (locally constrained) graph homomorphism parameterized complexity fracture number, (locally constrained) graph homomorphism, parameterized complexity, fracture number, [INFO]Computer Science [cs]

Availability: https://hal.science/hal-04797299
https://hal.science/hal-04797299v1/document
https://hal.science/hal-04797299v1/file/main-long.pdf
https://doi.org/10.1137/22M1513290