-
1Academic Journal
المؤلفون: Garg, Mohit, Kar, Debajyoti, Khan, Arindam
المساهمون: Mohit Garg and Debajyoti Kar and Arindam Khan
مصطلحات موضوعية: Online Algorithms, Random-Order Model, Maximum Independent Set of Rectangles, Hyperrectangles, Fat Objects, Interval Scheduling
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.58
-
2Academic Journal
المؤلفون: Braverman, Vladimir, Dharangutte, Prathamesh, Shah, Vihan, Wang, Chen
المساهمون: Vladimir Braverman and Prathamesh Dharangutte and Vihan Shah and Chen Wang
مصطلحات موضوعية: Learning-augmented algorithms, maximum independent set, graph algorithms
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.24
-
3Academic Journal
المؤلفون: Nafar, Mohsen, Römer, Michael
المساهمون: Mohsen Nafar and Michael Römer
مصطلحات موضوعية: Decision Diagram, Dynamic Programming, Maximum Independent Set Problem, Dual Bound
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.21
-
4Academic Journal
المؤلفون: Bai, Tian, Xiao, Mingyu
المساهمون: Tian Bai and Mingyu Xiao
مصطلحات موضوعية: Subset Feedback Vertex Set, Prize-Collecting Maximum Independent Set, Parameterized Algorithms, Split Graphs, Chordal Graphs, Dulmage-Mendelsohn Decomposition
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.15
-
5Academic Journal
المؤلفون: Ryo Hidaka, Yohei Hamakawa, Jun Nakayama, Kosuke Tatsumura
المصدر: IEEE Access, Vol 11, Pp 142979-142991 (2023)
مصطلحات موضوعية: Portfolio construction, market graph, maximum independent set, combinatorial optimization, FPGA, Ising machine, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
وصف الملف: electronic resource
-
6Book
المؤلفون: Chalermsook, Parinya, Fomin, Fedor V., Hamm, Thekla, Korhonen, Tuukka, Nederlof, Jesper, Orgo, Ly
المساهمون: Sub Algorithms and Complexity, Algorithms and Complexity, Gørtz, Inge Li, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz
مصطلحات موضوعية: Maximum Independent Set, Treewidth, Approximation Algorithms, Parameterized Approximation
وصف الملف: application/pdf
-
7Conference
المؤلفون: Deleplanque, Samuel
المساهمون: Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA), Université catholique de Lille (UCL)-Université catholique de Lille (UCL), Acoustique - IEMN (ACOUSTIQUE - IEMN), Université catholique de Lille (UCL)-Université catholique de Lille (UCL)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA), JUNIA (JUNIA), Université catholique de Lille (UCL), no information in the text
المصدر: Lecture Notes in Computer Science book series (LNCS, volume 14104) ; 23rd International Conference on Computational Science and Its Applications, ICCSA 2023 Workshops ; https://hal.science/hal-04172858 ; 23rd International Conference on Computational Science and Its Applications, ICCSA 2023 Workshops, Jul 2023, Athens, Greece. pp.429-439, ⟨10.1007/978-3-031-37105-9_29⟩ ; https://link.springer.com/chapter/10.1007/978-3-031-37105-9_29
مصطلحات موضوعية: Quantum Computing, Quantum Annealing, 3SAT, Maximum Independent Set, Combinatorial optimization, [PHYS]Physics [physics], [SPI]Engineering Sciences [physics]
Relation: hal-04172858; https://hal.science/hal-04172858; https://hal.science/hal-04172858/document; https://hal.science/hal-04172858/file/3SAT.Proof.LNCS.546341_1_En_29_Chapter_Author.pdf
-
8Conference
المساهمون: 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
-
9Academic Journal
المساهمون: Édouard Bonnet and Julien Duron and Colin Geniet and Stéphan Thomassé and Alexandra Wesolek
مصطلحات موضوعية: Maximum Independent Set, forbidden induced minors, quasipolynomial-time algorithms
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.23
-
10Academic Journal
المؤلفون: Wanpeng Lei, Jun Yin
المصدر: Axioms; Volume 12; Issue 5; Pages: 411
مصطلحات موضوعية: connectivity, independence number, k-ended tree, maximum independent set
وصف الملف: application/pdf
Relation: Mathematical Analysis; https://dx.doi.org/10.3390/axioms12050411
-
11Academic Journal
المؤلفون: Deniz, Zakir, Levit, V.E., Mandrescu, E.
مصطلحات موضوعية: almost bipartite graph, König-Egervàry graph, Maximum independent set, shedding vertex, unicyclic graph
Relation: Art of Discrete and Applied Mathematics; Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı; https://doi.org/10.26493/2590-9770.1563.5f6; https://hdl.handle.net/20.500.12684/13154; 2-s2.0-85140998900
-
12Academic Journal
المؤلفون: Do Nhu An
المصدر: Tạp chí Khoa học Đại học Đà Lạt, Pp 55-62 (2021)
مصطلحات موضوعية: connected graph, disconnected graph, maximum independent set, regular graph., General Works
وصف الملف: electronic resource
-
13Academic Journal
المؤلفون: Gershtein, Shay, Avron, Uri, Guy, Ido, Milo, Tova, Novgorodov, Slava
المساهمون: Shay Gershtein and Uri Avron and Ido Guy and Tova Milo and Slava Novgorodov
مصطلحات موضوعية: maximum independent set, approximation algorithms, approximation hardness bounds, taxonomy construction, category tree construction
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 220, 25th International Conference on Database Theory (ICDT 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.4
-
14Academic Journal
المؤلفون: Naoyuki TAMURA, Takane OHMORI, Takehide SOH, 大森 嶺, 宋 剛秀, 田村 直之
المصدر: Proceedings of the Annual Conference of JSAI. 2023, :2
-
15Academic Journal
المؤلفون: Zok Tomasz, Badura Jan, Swat Sylwester, Figurski Kacper, Popenda Mariusz, Antczak Maciej
المصدر: International Journal of Applied Mathematics and Computer Science, Vol 30, Iss 2, Pp 315-324 (2020)
مصطلحات موضوعية: rna pseudoknot order, conflict graph, vertex coloring, maximum independent set, integer programming, Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95
وصف الملف: electronic resource
Relation: https://doaj.org/toc/2083-8492
-
16Academic Journal
المؤلفون: Mosca, R
المساهمون: Mosca, R
مصطلحات موضوعية: Maximum independent set problem, Polynomial algorithm, 2K(2)-free graph, Hereditary graph classes
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000833022300001; volume:38; issue:4; firstpage:127; journal:GRAPHS AND COMBINATORICS; https://hdl.handle.net/11564/789316; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85135153370; https://link.springer.com/article/10.1007/s00373-022-02532-9
-
17Academic Journal
المؤلفون: Cardinal, Jean, Iacono, John, Koumoutsos, Grigorios
المساهمون: Jean Cardinal and John Iacono and Grigorios Koumoutsos
مصطلحات موضوعية: Maximum independent set, deamortization, approximation
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.25
-
18Academic Journal
المؤلفون: Haiyan Jiang, Yong Niu, Bo Ai, Zhangdui Zhong, Shiwen Mao
المصدر: IEEE Access, Vol 8, Pp 125814-125825 (2020)
مصطلحات موضوعية: Terahertz communication, bandwidth allocation, quality of service, concurrent scheduling, the conflict graph, maximum independent set, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
وصف الملف: electronic resource
-
19Academic Journal
المؤلفون: Zhonghua Li, Guannan He, Deming Xu, Shanjin Wang
المصدر: IEEE Access, Vol 8, Pp 123381-123397 (2020)
مصطلحات موضوعية: Centralized protocol, maximum independent set, mobile RFID system, NFRA, reader collision avoidance, simulation, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
وصف الملف: electronic resource
-
20Conference
المساهمون: Dynamic Networks : Temporal and Structural Capture Approach (DANTE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), 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é de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), Université de Lyon-Université de Lyon-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)
المصدر: ACM PE-WASUN ; https://hal.science/hal-02949696 ; ACM PE-WASUN, Nov 2020, Alicante, Spain. ⟨10.1145/3416011.3424755⟩
مصطلحات موضوعية: IEEE 80211, Channel bonding, Channel assignment, Performance, Starvation, Conflict graph, Maximum independent set, [INFO]Computer Science [cs]