Search Results - "Kernelization algorithm"

1

A 5k-vertex kernel for P2-packing

Contributors: Li, W Ye, J Cao, Y et al.

Source: Theoretical Computer Science. 910:1-13

Subject Terms: 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

Access URL: http://arxiv.org/pdf/1804.02801
http://arxiv.org/abs/1804.02801

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

2

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

Authors: Cordasco G. Gargano L. Rescigno A. A. et al.

Contributors: Cordasco G. Gargano L. Rescigno A. A. et al.

Subject Terms: 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

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

View record from BASE

Nájsť tento článok vo Web of Science

3

Approximation and Kernelization for Chordal Vertex Deletion

Authors: Marcin Pilipczuk Bart M. P. Jansen

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

Subject Terms: 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

Access URL: 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

View record at OpenAIRE

Nájsť tento článok vo Web of Science

4

Parameterized complexity for iterated type partitions and modular-width

Authors: Cordasco G. Gargano L. Rescigno A. A. et al.

Contributors: Cordasco G. Gargano L. Rescigno A. A. et al.

Subject Terms: 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

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

View record from BASE

Nájsť tento článok vo Web of Science

5

Approximation and kernelization for chordal vertex deletion

Authors: Jansen, Bart M.P. Pilipczuk, Marcin

Source: 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

Subject Terms: Approximation algorithm, Chordal vertex deletion, Kernelization algorithm

File Description: 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

Availability: 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

View record from BASE

Nájsť tento článok vo Web of Science

6

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

Authors: 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) et al.

Contributors: 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) et al.

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

Subject Terms: 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]