المؤلفون: Bonnet, Edouard, Duron, Julien, Geniet, Colin, Thomassé, Stéphan, Wesolek, Alexandra

المساهمون: LIP, Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Technical University of Berlin / Technische Universität Berlin (TUB), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)

المصدر: ESA 2023 ; https://hal.science/hal-04292975 ; ESA 2023, Sep 2023, Amsterdam, Netherlands

مصطلحات موضوعية: forbidden induced minors, (quasi)polynomial-time algorithms, Maximum Independent Set, [INFO]Computer Science [cs]

جغرافية الموضوع: Amsterdam, Netherlands

Relation: hal-04292975; https://hal.science/hal-04292975; https://hal.science/hal-04292975/document; https://hal.science/hal-04292975/file/mis-ind-minor.pdf

الاتاحة: https://hal.science/hal-04292975
https://hal.science/hal-04292975/document
https://hal.science/hal-04292975/file/mis-ind-minor.pdf

المؤلفون: Lokshtanov, Daniel, Pilipczuk, Marcin, Leeuwen, Erik Jan van

المساهمون: Sub Algorithms and Complexity, Algorithms and Complexity

مصطلحات موضوعية: Independence, efficient domination, P-6-free graphs, (quasi) polynomial-time algorithms, Taverne

وصف الملف: application/pdf

Relation: https://dspace.library.uu.nl/handle/1874/407578

الاتاحة: https://dspace.library.uu.nl/handle/1874/407578

المؤلفون: Ganian, Robert, Narayanaswamy, N. S., Ordyniak, Sebastian, Rahul, C. S., Ramanujan, M. S.

المساهمون: Robert Ganian and N. S. Narayanaswamy and Sebastian Ordyniak and C. S. Rahul and M. S. Ramanujan

مصطلحات موضوعية: f-factors, connected f-factors, quasi-polynomial time algorithms, randomized algorithms

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.41

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2016.41
https://nbn-resolving.org/urn:nbn:de:0030-drops-65013
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.41

المؤلفون: Lokshtanov, Daniel, Pilipczuk, Marcin, Leeuwen, Erik Jan van, Sub Algorithms and Complexity, Algorithms and Complexity

المصدر: ACM Transactions on Algorithms, 14(1). Association for Computing Machinery (ACM)

مصطلحات موضوعية: Computational complexity theory, 010102 general mathematics, Induced subgraph, 0102 computer and information sciences, Independence, efficient domination, 01 natural sciences, Graph, Vertex (geometry), Combinatorics, Mathematics (miscellaneous), 010201 computation theory & mathematics, Dominating set, Independent set, (quasi) polynomial-time algorithms, P-6-free graphs, Pairwise comparison, 0101 mathematics, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c94ad2813a6999b6667c005d220084cd
https://doi.org/10.1145/3147214

المؤلفون: Lokshtanov, Daniel, Pilipczuk, Marcin, Leeuwen, Erik Jan van

المساهمون: Sub Algorithms and Complexity, Algorithms and Complexity

مصطلحات موضوعية: FOS: Computer and information sciences, (quasi) polynomial-time algorithms, Computer Science - Data Structures and Algorithms, P-6-free graphs, Data Structures and Algorithms (cs.DS), Independence, efficient domination, MathematicsofComputing_DISCRETEMATHEMATICS

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74e9141815ceda77adb7d630ef3eb3f5