المؤلفون: A. Mahmoodi, A. Behmaram, T. Došlić, N. Asadi

المصدر: AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 3, Pp 261-267 (2024)

مصطلحات موضوعية: Domination, induced matching, dominating induced matching, maximal matching, saturation number, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://doaj.org/toc/0972-8600; https://doaj.org/toc/2543-3474

URL الوصول: https://doaj.org/article/64d6f37c6f8a4b4fb94276d71ce0c405

المؤلفون: Li, Minming, Robinson, Peter, Zhu, Xianbin

المساهمون: Minming Li and Peter Robinson and Xianbin Zhu

مصطلحات موضوعية: distributed graph algorithm, dynamic network, maximal matching, randomized algorithm, lower bound

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

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.73

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2024.73
https://nbn-resolving.org/urn:nbn:de:0030-drops-196017
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.73

المؤلفون: Dahal, Sameep, Suomela, Jukka

المساهمون: Department of Computer Science, Computer Science Professors, Aalto-yliopisto, Aalto University

مصطلحات موضوعية: Computational complexity, Distributed graph algorithms, Fractional matching, Maximal matching

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

Relation: Theoretical Computer Science; Volume 982; Dahal , S & Suomela , J 2024 , ' Distributed half-integral matching and beyond ' , Theoretical Computer Science , vol. 982 , 114278 . https://doi.org/10.1016/j.tcs.2023.114278; PURE UUID: 4756ea29-9012-48df-ad38-3e85e31b3a84; PURE ITEMURL: https://research.aalto.fi/en/publications/4756ea29-9012-48df-ad38-3e85e31b3a84; PURE LINK: http://www.scopus.com/inward/record.url?scp=85176130012&partnerID=8YFLogxK; PURE FILEURL: https://research.aalto.fi/files/129570467/SCI_Dahal_etal_Theoretical_Computer_Science_2023.pdf; https://aaltodoc.aalto.fi/handle/123456789/124808; URN:NBN:fi:aalto-202312117176

الاتاحة: https://aaltodoc.aalto.fi/handle/123456789/124808
https://doi.org/10.1016/j.tcs.2023.114278

المؤلفون: Eliahou, Shalom

المساهمون: Laboratoire de Mathématiques Pures et Appliquées Joseph Liouville (LMPA), Université du Littoral Côte d'Opale (ULCO)

المصدر: https://hal.science/hal-04234167 ; 2024.

مصطلحات موضوعية: Apéry set, Vertex-maximal matching number, Downset, MSC 05C25, 11B75, 20M14, [MATH]Mathematics [math]

الاتاحة: https://hal.science/hal-04234167
https://hal.science/hal-04234167v5/document
https://hal.science/hal-04234167v5/file/divsetsR1.pdf
https://doi.org/10.1080/00927872.2024.2428807

المؤلفون: Mehdi Djahangiri

المصدر: Sahand Communications in Mathematical Analysis, Vol 19, Iss 3, Pp 111-124 (2022)

مصطلحات موضوعية: uncertainty theory, graph, maximal matching, integer programming, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://scma.maragheh.ac.ir/article_253577_2353068629178988c1d30b7719063cdf.pdf; https://doaj.org/toc/2322-5807; https://doaj.org/toc/2423-3900

URL الوصول: https://doaj.org/article/4739703e112f48e48f49d8a282041954

المؤلفون: Sarah Surya, S., Koipuram, Lian Mathew

المصدر: Proyecciones (Antofagasta, On line); Vol. 42 No. 4 (2023); 931-956 ; Proyecciones. Revista de Matemática; Vol. 42 Núm. 4 (2023); 931-956 ; 0717-6279 ; 10.22199/issn.0717-6279-2023-04

مصطلحات موضوعية: graph pebbling, maximal matching, cover pebbling number, maximal matching cover pebbling number, 05C69, 05C70, 54A25

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

Relation: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5608/4331; https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5608

الاتاحة: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5608
https://doi.org/10.22199/issn.0717-6279-5608

المؤلفون: Dubois, Swan, Feuilloley, Laurent, Petit, Franck, Rabie, Mikaël

المساهمون: DistributEd aLgorithms and sYStems (DELYS), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Graphes, AlgOrithmes et AppLications (GOAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-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)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), ANR-22-CE25-0008,SKYDATA,Un nouveau paradigme de donnée: Les données autononomes et intelligentes(2022), ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018)

المصدر: 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)
https://hal.science/hal-04101692
2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023), Jun 2023, Pisa, Italy. pp.7:1--7:15, ⟨10.4230/LIPIcs.SAND.2023.7⟩

مصطلحات موضوعية: NP-hardness, Robustness, dynamic network, temporal graphs, edge removal, connectivity, packing/covering problems, maximal independent set, maximal matching, minimum dominating set, perfect matching, [INFO]Computer Science [cs]

جغرافية الموضوع: Pisa, Italy

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2304.05831; ARXIV: 2304.05831

الاتاحة: https://hal.science/hal-04101692
https://hal.science/hal-04101692v2/document
https://hal.science/hal-04101692v2/file/LIPIcs.SAND.2023.7.pdf
https://doi.org/10.4230/LIPIcs.SAND.2023.7

المؤلفون: Le, Hung, Milenković, Lazar, Solomon, Shay, Vassilevska Williams, Virginia

المساهمون: Hung Le and Lazar Milenković and Shay Solomon and Virginia Vassilevska Williams

مصطلحات موضوعية: maximal matching, approximate matching, dynamic algorithm, vertex updates

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

Relation: Is Part Of LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.96

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2022.96
https://nbn-resolving.org/urn:nbn:de:0030-drops-156923
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.96

المؤلفون: Dani, Varsha, Gupta, Aayush, Hayes, Thomas P., Pettie, Seth

المساهمون: Varsha Dani and Aayush Gupta and Thomas P. Hayes and Seth Pettie

مصطلحات موضوعية: Distributed Algorithms, Energy-Aware Computation, Radio Networks, Maximal Matching, Sensor Networks

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

Relation: Is Part Of LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.19

الاتاحة: https://doi.org/10.4230/LIPIcs.DISC.2021.19
https://nbn-resolving.org/urn:nbn:de:0030-drops-148219
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.19

المؤلفون: Assadi, Sepehr, Solomon, Shay

المساهمون: Sepehr Assadi and Shay Solomon

مصطلحات موضوعية: dynamic graph algorithms, hypergraph, maximal matching, matching, set cover

وصف الملف: 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.8

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2021.8
https://nbn-resolving.org/urn:nbn:de:0030-drops-145899
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.8

المؤلفون: Bouquet, Valentin, Delbot, François, Picouleau, Christophe, Rovedakis, Stephane

المساهمون: CEDRIC. Optimisation Combinatoire (CEDRIC - OC), Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM), CEDRIC. Réseaux et Objets Connectés (CEDRIC - ROC), Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)

المصدر: ISSN: 0304-3975.

مصطلحات موضوعية: Minimum Dominating Set, Minimum maximal matching, Diameter, Claw-free graphs, Line graphs, Complexity, [MATH]Mathematics [math], [INFO]Computer Science [cs]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2304.09701; hal-04549484; https://hal.science/hal-04549484; ARXIV: 2304.09701

الاتاحة: https://hal.science/hal-04549484
https://doi.org/10.1016/j.tcs.2024.114561

المؤلفون: Kyeong‐Eun Han, Jongtae Song, Dae‐Ub Kim, JiWook Youn, Chansung Park, Kwangjoon Kim

المصدر: ETRI Journal, Vol 40, Iss 3, Pp 337-346 (2018)

مصطلحات موضوعية: Grant‐aware, High performance, Input‐buffered switch, Scheduling, Low latency, Maximal matching algorithm, Telecommunication, TK5101-6720, Electronics, TK7800-8360

وصف الملف: electronic resource

Relation: https://doaj.org/toc/1225-6463; https://doaj.org/toc/2233-7326

URL الوصول: https://doaj.org/article/1b3158390f114f3a8ef28779e9c89273

المؤلفون: TAVAKOLİ, Mostofa, DOSLİC, ‎tomislav

المصدر: Hacettepe Journal of Mathematics and Statistics

مصطلحات موضوعية: Statistics and Probability, Matematik, Algebra and Number Theory, maximal matching‎, ‎product graph‎, ‎saturation number‎, ‎independent domination number‎, Geometry and Topology, Mathematics, Analysis

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efbc41911f9834120166b04cf36d99a1
https://doi.org/10.15672/hujms.1095437

المؤلفون: Tural, Mustafa Kemal

مصطلحات موضوعية: Matching, Maximal matching polytope, Matching polytope, Valid inequalities, Maximal matching, Eşleme, Maksimal eşleme politopu, Eşleme politopu, Geçerli eşitsizlikler, Maksimal Eşleme

Relation: TURAL M. K. , "Valid Inequalities for the Maximal Matching Polytope", Adıyaman University Journal of Science, cilt.9, ss.374-385, 2019; 385; 374; https://hdl.handle.net/11511/57995

الاتاحة: https://hdl.handle.net/11511/57995
https://doi.org/10.37094/adyujsci.540858

المؤلفون: Assadi, Sepehr, Solomon, Shay

المساهمون: Sepehr Assadi and Shay Solomon

مصطلحات موضوعية: Maximal Independent Set, Maximal Matching, Sublinear-Time Algorithms, Bounded Neighborhood Independence

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

Relation: Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.17

الاتاحة: https://doi.org/10.4230/LIPIcs.ICALP.2019.17
https://nbn-resolving.org/urn:nbn:de:0030-drops-105931
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.17

المؤلفون: Dhungyel Parshu Ram, Grundspeņķis Jānis

المصدر: Applied Computer Systems, Vol 21, Iss 1, Pp 61-65 (2017)

مصطلحات موضوعية: dzongkha word segmentation, maximal matching, n-gram, natural language processing, Computer software, QA76.75-76.765

وصف الملف: electronic resource

Relation: https://doaj.org/toc/2255-8691

URL الوصول: https://doaj.org/article/8b1213268c9446daba3fb97437a44e38

المؤلفون: Drmota, Michael, Ramos, Lander, Requilé, Clément, Rué Perna, Juan José

المساهمون: Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

مصطلحات موضوعية: Àrees temàtiques de la UPC::Matemàtiques i estadística, Combinatorial analysis, asymptotic enumeration, central limit laws, subcritical graph classes, maximal independent set, maximal matching, Anàlisi combinatòria

Relation: Drmota, M., Ramos, L., Requilé, C., Rue, J. Maximal independent sets and maximal matchings in series-parallel and related graph classes. A: International Conference on the Analysis of Algorithms. "29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)". Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 18:1-18:15.; http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8911; http://hdl.handle.net/2117/122032

الاتاحة: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8911
http://hdl.handle.net/2117/122032

المؤلفون: Natarajan Meghanathan

المصدر: Journal of King Saud University: Computer and Information Sciences, Vol 28, Iss 2, Pp 230-246 (2016)

مصطلحات موضوعية: Maximal matching, Assortative matching, Dissortative matching, Assortativity index, Complex networks, Node similarity, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S1319157815001238; https://doaj.org/toc/1319-1578

URL الوصول: https://doaj.org/article/df30585cf99c4abc9413de8fe8970f9a

المؤلفون: Kazuhiro KURITA, Kunihiro WASA, Yasuaki KOBAYASHI, 和佐 州洋, 小林 靖明, 栗田 和宏

المصدر: Proceedings of the Annual Conference of JSAI. 2021, :2

المؤلفون: Andrii Morozov, Tamara Loktikova, Iurii Iefremov, Anatolii Dykyi, Pavlo Zabrodskyy

المصدر: Eastern-European Journal of Enterprise Technologies, 6(4 (102)), 21-28, (2019-12-31)

مصطلحات موضوعية: matching, maximal matching, bipartite graph, prolonged path, assignment problem

Relation: oai:zenodo.org:3603842

الاتاحة: https://doi.org/10.15587/1729-4061.2019.188104