Výsledky vyhledávání - "Kernelization Algorithm"

A 5k-vertex kernel for P2-packing

Autoři: Li, W Ye, J Cao, Y a další

Přispěvatelé: Li, W Ye, J Cao, Y a další

Zdroj: Theoretical Computer Science. 910:1-13

Témata: FOS: Computer and information sciences, P2-packing, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Kernelization algorithm, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Crown decomposition

Přístupová URL adresa: http://arxiv.org/pdf/1804.02801
http://arxiv.org/abs/1804.02801

Parameterized Complexity of (d, r)-Domination via Modular Decomposition

Autoři: Cordasco G. Gargano L. Rescigno A. A. a další

Přispěvatelé: Cordasco G. Gargano L. Rescigno A. A. a další

Témata: Contamination minimization, Domination, Kernelization Algorithm, Parameterized Complexity

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001537885900007; ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025; volume:15411; firstpage:94; lastpage:110; numberofpages:17; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11386/4906398

Dostupnost: https://hdl.handle.net/11386/4906398
https://doi.org/10.1007/978-981-96-2845-2_7

Approximation and Kernelization for Chordal Vertex Deletion

Autoři: Marcin Pilipczuk Bart M. P. Jansen

Zdroj: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. :1399-1418

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Computer Science - Data Structures and Algorithms, Chordal vertex deletion, Kernelization algorithm, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 16. Peace & justice, 10. No inequality, Approximation algorithm, 01 natural sciences

Přístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611974782.91
http://arxiv.org/pdf/1605.03001
http://arxiv.org/abs/1605.03001
https://research.tue.nl/en/publications/5ba1974f-e611-4dc6-a9f0-48d349391097
https://research.tue.nl/en/publications/d324136f-e21d-44d6-98dd-fe115953863d
https://doi.org/10.1137/1.9781611974782.91
https://research.tue.nl/en/publications/94059a6f-9417-42c2-9c5e-9eec318a431f
https://doi.org/10.1137/17M112035X
https://dblp.uni-trier.de/db/journals/corr/corr1605.html#JansenP16
https://epubs.siam.org/doi/10.1137/1.9781611974782.91
http://dblp.uni-trier.de/db/journals/corr/corr1605.html#JansenP16
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F5ba1974f-e611-4dc6-a9f0-48d349391097
https://scholar.archive.org/work/mnathcxadjeohp33bpzv72mxsy
https://research.tue.nl/en/publications/approximation-and-kernelization-for-chordal-vertex-deletion
https://dblp.uni-trier.de/db/journals/siamdm/siamdm32.html#JansenP18
https://epubs.siam.org/doi/abs/10.1137/17M112035X
https://locus.siam.org/doi/abs/10.1137/17M112035X

Parameterized complexity for iterated type partitions and modular-width

Autoři: Cordasco G. Gargano L. Rescigno A. A. a další

Přispěvatelé: Cordasco G. Gargano L. Rescigno A. A. a další

Témata: Fixed-parameter tractability, Kernelization algorithm, Modular-width, Neighborhood diversity, Parameterized complexity

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001218584300001; volume:350; firstpage:100; lastpage:122; numberofpages:23; journal:DISCRETE APPLIED MATHEMATICS; https://hdl.handle.net/11591/523408

Dostupnost: https://hdl.handle.net/11591/523408
https://doi.org/10.1016/j.dam.2024.03.009

Approximation and kernelization for chordal vertex deletion

Autoři: Jansen, Bart M.P. Pilipczuk, Marcin

Zdroj: Jansen, B M P & Pilipczuk, M 2018, 'Approximation and kernelization for chordal vertex deletion', SIAM Journal on Discrete Mathematics, vol. 32, no. 3, pp. 2258-2301. https://doi.org/10.1137/17M112035X

Témata: Approximation algorithm, Chordal vertex deletion, Kernelization algorithm

Popis souboru: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/000450810500037; info:eu-repo/semantics/altIdentifier/pissn/0895-4801; info:eu-repo/semantics/altIdentifier/eissn/1095-7146

Dostupnost: https://research.tue.nl/en/publications/94059a6f-9417-42c2-9c5e-9eec318a431f
https://doi.org/10.1137/17M112035X
https://pure.tue.nl/ws/files/108399972/17m112035x.pdf
https://www.scopus.com/pages/publications/85053879017

Graph modification and covering : Parameterized approaches ; Modification et couverture de graphes : Approches paramétrées

Autoři: Dumas, Maël Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL) a další

Přispěvatelé: Dumas, Maël Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL) a další

Zdroj: https://theses.hal.science/tel-04638902 ; Algorithme et structure de données [cs.DS]. Université d'Orléans, 2023. Français. ⟨NNT : 2023ORLE1090⟩.

Témata: Graph, Parameterized complexity, Kernelization algorithm, Graph modification, Graph covering, Graphe, Complexité paramétrée, Algorithme de noyau, Modification de graphes, Couverture de graphes, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Relation: NNT: 2023ORLE1090

Dostupnost: https://theses.hal.science/tel-04638902
https://theses.hal.science/tel-04638902v1/document
https://theses.hal.science/tel-04638902v1/file/2023ORLE1090_va.pdf

Modification et couverture de graphes : Approches paramétrées ; Graph modification and covering : Parameterized approaches

Autoři: Dumas, Maël Orléans Todinca, Ioan

Přispěvatelé: Dumas, Maël Orléans Todinca, Ioan

Témata: Graphe, Complexité paramétrée, Algorithme de noyau, Modification de graphes, Couverture de graphes, Graph, Parameterized complexity, Kernelization algorithm, Graph modification, Graph covering, 005.1

Relation: http://www.theses.fr/2023ORLE1090/document

Dostupnost: http://www.theses.fr/2023ORLE1090/document

A kernel of order 2k-c log k for vertex cover

Autoři: Lampis, Michael

Zdroj: Information Processing Letters. 111(23-24):1089-1091

Témata: Graph algorithms, Parameterized complexity, Kernelization algorithm, Vertex cover

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58598