Výsledky vyhľadávania - "kernelization algorithm"
-
1
Autori:
Zdroj: IEEE Transactions on Computational Biology and Bioinformatics. :1-13
-
2
Autori: a ďalší
Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)
Prístupová URL adresa: http://arxiv.org/abs/2412.00704
-
3
Autori:
Prispievatelia:
Predmety: FOS: Computer and information sciences, Parameterized complexity, trivially perfect graphs, Computer Science - Computational Complexity, graph modification, Computer Science - Data Structures and Algorithms, kernelization algorithms, Theory of computation → Parameterized complexity and exact algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC)
Popis súboru: application/pdf
-
4
Autori:
Témy: Parameterized complexity, kernelization algorithms, graph modification, trivially perfect graphs, InProceedings, Text, doc-type:ResearchArticle, publishedVersion
URL:
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.15
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) -
5
Autori: Abu-Khzam, Faisal N.
Zdroj: Journal of Computer and System Sciences. 76:524-531
Predmety: Computer Networks and Communications, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, Hitting Set, Fixed-parameter algorithms, Hypergraphs, 01 natural sciences, Theoretical Computer Science, Vertex cover, Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Kernelization, Crown decomposition
Prístupová URL adresa: https://core.ac.uk/display/82499395
https://laur.lau.edu.lb:8443/xmlui/handle/10725/2772
https://www.sciencedirect.com/science/article/pii/S0022000009000786
https://dblp.uni-trier.de/db/journals/jcss/jcss76.html#Abu-Khzam10
https://doi.org/10.1016/j.jcss.2009.09.002
https://www.sciencedirect.com/science/article/abs/pii/S0022000009000786 -
6
Autori: Wen-Yu Gao
Zdroj: Chinese Journal of Computers. 33:2211-2218
Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
-
7
Autori: Abu-Khzam, Faisal N.
Zdroj: Information Processing Letters. 110:621-624
Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
-
8
Autori: Abu-Khzam, Faisal N.
Témy: Article
URL:
http://hdl.handle.net/10725/2772 http://www.sciencedirect.com/science/article/pii/S0022000009000786
Journal of Computer and System Sciences -
9
-
10
-
11
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Theoretical Computer Science. 910:1-13
Predmety: 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
Prístupová URL adresa: http://arxiv.org/pdf/1804.02801
http://arxiv.org/abs/1804.02801 -
12
Autori: a ďalší
Zdroj: Algorithmica. Aug2024, Vol. 86 Issue 8, p2448-2478. 31p.
-
13
Autori: a ďalší
Prispievatelia: a ďalší
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
-
14
Autori:
Zdroj: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. :1399-1418
Predmety: 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
Prí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 -
15
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: 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
-
16
Autori:
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
Popis súboru: 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
-
17
Autori: Lampis, Michael
Zdroj: Information Processing Letters. 111(23-24):1089-1091
Popis súboru: print
Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58598
-
18
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://theses.hal.science/tel-04638902 ; Algorithme et structure de données [cs.DS]. Université d'Orléans, 2023. Français. ⟨NNT : 2023ORLE1090⟩.
Predmety: 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
-
19
Autori:
Prispievatelia:
Predmety: 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
Dostupnosť: http://www.theses.fr/2023ORLE1090/document
-
20
Autori:
Zdroj: RAIRO: Operations Research (2804-7303); 2024, Vol. 58 Issue 2, p1131-1146, 16p
Full Text Finder
Nájsť tento článok vo Web of Science