Authors: Doerr, Benjamin, Rajabi, Amirhossein, Witt, Carsten
Contributors: École polytechnique (X), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Institut Polytechnique de Paris (IP Paris), Department of Applied Mathematics and Computer Science Lyngby (DTU Compute), Danmarks Tekniske Universitet = Technical University of Denmark (DTU), ANR-11-LABX-0056,LMH,LabEx Mathématique Hadamard(2011)
Superior Title: ISSN: 0178-4617.
Subject Terms: Simulated annealing Approximation scheme Minimum spanning trees Runtime analysis Theory, Simulated annealing, Approximation scheme, Minimum spanning trees, Runtime analysis, Theory, [INFO]Computer Science [cs]
Relation: hal-04483183; https://hal.science/hal-04483183; https://hal.science/hal-04483183/document; https://hal.science/hal-04483183/file/Doerr_Rajabi_Witt__Simulated_Annealing_PTAS_MST__Algorithmica__2024.pdf
Authors: Gioan, Emeric, Las Vergnas, Michel
Contributors: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Centre National de la Recherche Scientifique (CNRS), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)
Superior Title: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, 2024, 347 (5), pp.113895.
Subject Terms: Bipolar directed graph, Spanning tree, Computational complexity, Linear programming, Active bijection, Tutte polynomial, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Relation: lirmm-04387449; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449v2/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449v2/file/ABGraphsLP-v27-final-proof-corrections.pdf
Authors: Gioan, Emeric, Las Vergnas, Michel
Contributors: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Centre National de la Recherche Scientifique (CNRS), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)
Superior Title: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, 2024, 347 (5), pp.113895.
Subject Terms: Bipolar directed graph, Spanning tree, Computational complexity, Linear programming, Active bijection, Tutte polynomial, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Relation: lirmm-04387449; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449v2/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449v2/file/ABGraphsLP-v27-final-proof-corrections.pdf
Authors: Gioan, Emeric, Las Vergnas, Michel
Contributors: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Centre National de la Recherche Scientifique (CNRS), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)
Superior Title: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, 2024, 347 (5), pp.113895.
Subject Terms: Bipolar directed graph, Spanning tree, Computational complexity, Linear programming, Active bijection, Tutte polynomial, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Relation: lirmm-04387449; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449v2/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449v2/file/ABGraphsLP-v27-final-proof-corrections.pdf
Authors: Siahaan, Charmenita Enjellina, Rarasati, Niken
Superior Title: Technologica; Vol. 3 No. 1 (2024): Technologica; 10-19 ; 2827-9492
Subject Terms: Algoritma Reverse-Delete, Jaringan Pipa, Minimum Spanning Tree
File Description: application/pdf
Authors: Anonymous
Subject Terms: Discrete-Time Markov Chain, Minimum Spanning Tree, Unsupervised Learning, Community Detection Algorithms
Relation: https://dx.doi.org/10.5281/zenodo.8226703; https://dx.doi.org/10.5281/zenodo.10674508; https://dx.doi.org/10.5281/zenodo.10674537
Authors: Anonymous
Authors: Anonymous
Contributors: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Parallelism, Graphs and Optimization Research Group (ParGO), Universidade Federal do Ceará = Federal University of Ceará (UFC), Universität Ulm - Ulm University Ulm, Allemagne, ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020)
Superior Title: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990 ; Discrete Applied Mathematics, 2024, 346, pp.80-94. ⟨10.1016/j.dam.2023.11.026⟩.
Subject Terms: Digraphs, Packing problems, Arborescences, Branching flows, Safe spanning trees, Parameterized complexity, Fixed-parameter tractability, [INFO]Computer Science [cs], [MATH]Mathematics [math]
Relation: lirmm-04352990; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990/file/Re-re-submission_DAM.pdf
Authors: Бацамут, В. М., Годлевський, С. О., Бабков, Ю. П., Морквін, Д. А.
Superior Title: Radio Electronics, Computer Science, Control; No. 1 (2024): Radio Electronics, Computer Science, Control; 188 ; Радиоэлектроника, информатика, управление; № 1 (2024): Радіоелектроніка, інформатика, управління; 188 ; Радіоелектроніка, iнформатика, управління; № 1 (2024): Радіоелектроніка, інформатика, управління; 188 ; 2313-688X ; 1607-3274
Subject Terms: мережевий об’єкт, зважений неорієнтований граф, зв’язність, транзитивне замкнення, мінімальне кістякове дерево, локальний оптимум, критерій оптимізації, метод, network object, weighted undirected graph, connectivity, transitive closure, minimum spanning tree, local optimum, optimization criterion, method
File Description: application/pdf
Relation: http://ric.zntu.edu.ua/article/view/301007/293143; http://ric.zntu.edu.ua/article/view/301007
Availability: http://ric.zntu.edu.ua/article/view/301007
Contributors: Laboratoire de Génie Electrique de Grenoble (G2ELab ), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Institute of Technology of Cambodia Cambodge (KHM)
Superior Title:
2023 IEEE PES Innovative Smart Grid Technologies Europe (ISGT-Europe)
https://hal.science/hal-04493346
2023 IEEE PES Innovative Smart Grid Technologies Europe (ISGT-Europe), Oct 2023, Grenoble, France. ⟨10.1109/isgteurope56780.2023.10408246⟩
Subject Terms: AC low-voltage graph theory minimum spanning tree shortest path load balancing pole balancing MILP, AC low-voltage, graph theory, minimum spanning tree, shortest path, load balancing, pole balancing, MILP, [SPI]Engineering Sciences [physics]
Relation: hal-04493346; https://hal.science/hal-04493346; https://hal.science/hal-04493346/document; https://hal.science/hal-04493346/file/Designing_AC_Low-Voltage_Topologies_for_a_Non-Electrified_Area__A_Case_Study_in_Cambodia.pdf
Authors: András London, András Pluhár
Superior Title: Applied Network Science, Vol 8, Iss 1, Pp 1-12 (2023)
Subject Terms: Random spanning trees, Small-world networks, Modularity, Network resilience, Spanning tree game, Applied mathematics. Quantitative methods, T57-57.97
Relation: https://doi.org/10.1007/s41109-023-00600-4; https://doaj.org/toc/2364-8228; https://doaj.org/article/296b214a68e64e52aaa03ad42f6d3b48
Authors: Lebon, Quentin, Lefèvre, Josselin, Cousty, Jean, Perret, Benjamin
Contributors: Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Thermo Fisher Scientific Inc., Université Gustave Eiffel, ESIEE Paris, Inês Domingues, Verónica Vasconcelos
Superior Title: Iberoamerican Congress on Pattern Recognition (CIARP) ; https://hal.science/hal-04069187 ; Iberoamerican Congress on Pattern Recognition (CIARP), Inês Domingues; Verónica Vasconcelos, Nov 2023, Coimbra, Portugal. pp.189-200, ⟨10.1007/978-3-031-49018-7_14⟩
Subject Terms: interactive segmentation, watershed, binary partition tree, minimum spanning tree, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO]Computer Science [cs]
Relation: hal-04069187; https://hal.science/hal-04069187; https://hal.science/hal-04069187v3/document; https://hal.science/hal-04069187v3/file/CIARP_2023___Interactive_segmentation_with_incremental_watershed_cuts.pdf
Authors: Gargano, Luisa, Rescigno, Adele A.
Subject Terms: Spanning Trees, Branch vertices, Fixed-parameter tractable algorithms, Modular-width, Theory of computation → Parameterized complexity and exact algorithms, Mathematics of computing → Graph theory
File Description: application/pdf
Authors: Fotakis, Dimitris, Gergatsouli, Evangelia, Pipis, Charilaos, Stouras, Miltiadis, Tzamos, Christos
Subject Terms: algorithms under uncertainty, graph connectivity, spanning tree, noisy queries, online algorithms, stochastic optimization, Theory of computation → Design and analysis of algorithms
File Description: application/pdf
Relation: https://proceedings.neurips.cc/paper/2020/hash/62da5a6d47be0029801ba74a17e47e1a-Abstract.html; https://proceedings.neurips.cc/paper/2017/file/db5cea26ca37aa09e5365f3e7f5dd9eb-Paper.pdf; https://proceedings.neurips.cc/paper/2015/hash/3416a75f4cea9109507cacd8e2f2aefc-Abstract.html; https://dx.doi.org/10.4230/LIPIcs.MFCS.2023; https://dx.doi.org/10.1007/978-3-319-12340-0_14; https://dx.doi.org/10.1137/S0097539791195877; https://dx.doi.org/10.1109/TNET.2017.2725905; https://dx.doi.org/10.1145/2632951.2632990; https://dx.doi.org/10.4230/LIPIcs.STACS.2008.1358; https://dx.doi.org/10.4153/CJM-1970-125-1; https://dx.doi.org/10.3390/s21217254; https://dx.doi.org/10.1109/CVPR.2009.5206863
Authors: Chen, Yu, Khanna, Sanjeev, Tan, Zihan
Subject Terms: Minimum spanning tree, travelling salesman problem, streaming algorithms, Theory of computation → Design and analysis of algorithms
File Description: application/pdf
Authors: Lebon, Quentin, Lefèvre, Josselin, Cousty, Jean, Perret, Benjamin
Contributors: Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Thermo Fisher Scientific Inc., Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout-Centre National de la Recherche Scientifique (CNRS), Université Gustave Eiffel, ESIEE Paris, Inês Domingues, Verónica Vasconcelos
Superior Title: Iberoamerican Congress on Pattern Recognition (CIARP) ; https://hal.science/hal-04069187 ; Iberoamerican Congress on Pattern Recognition (CIARP), Inês Domingues; Verónica Vasconcelos, Nov 2023, Coimbra, Portugal. pp.189-200, ⟨10.1007/978-3-031-49018-7_14⟩
Subject Terms: interactive segmentation, watershed, binary partition tree, minimum spanning tree, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO]Computer Science [cs]
Relation: hal-04069187; https://hal.science/hal-04069187; https://hal.science/hal-04069187v3/document; https://hal.science/hal-04069187v3/file/CIARP_2023___Interactive_segmentation_with_incremental_watershed_cuts.pdf
Authors: Davot, Tom, Destercke, Sébastien, Savourey, David
Contributors: Heuristique et Diagnostic des Systèmes Complexes Compiègne (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)
Superior Title: Springer Lecture Notes in Artificial Intelligence series ; 17th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 2023) ; https://hal.utc.fr/hal-04155185 ; 17th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 2023), Sep 2023, Arras, France. pp.348-358
Subject Terms: Interval-valued optimisation, Operations Research, Minimum Spanning tree, [INFO]Computer Science [cs]
Relation: hal-04155185; https://hal.utc.fr/hal-04155185; https://hal.utc.fr/hal-04155185/document; https://hal.utc.fr/hal-04155185/file/main.pdf
Authors: Guichard, Pierrick, Retière, Nicolas, Mayou, Didier
Contributors: Optique et Matériaux (NEEL - OPTIMA), Institut Néel (NEEL), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), G2Elab-SYstèmes et Réseaux ELectriques (G2Elab-SYREL), Laboratoire de Génie Electrique de Grenoble (G2ELab ), Université Grenoble Alpes, IEEE Power & Energy Society
Superior Title: IEEE PES ISGT EUROPE 2023 "Powering solutions for decarbonized and resilient future smartgrids” ; https://hal.science/hal-04166065 ; IEEE PES ISGT EUROPE 2023 "Powering solutions for decarbonized and resilient future smartgrids”, Université Grenoble Alpes; IEEE Power & Energy Society, Oct 2023, Grenoble, France
Subject Terms: Load flow, Local approach, Lanczos algorithm, Hamiltonian formalism, Spanning trees, [SPI.NRJ]Engineering Sciences [physics]/Electric power, [INFO]Computer Science [cs]
Relation: hal-04166065; https://hal.science/hal-04166065; https://hal.science/hal-04166065/document; https://hal.science/hal-04166065/file/08618-fichier.pdf
Authors: Lebon, Quentin, Lefèvre, Josselin, Cousty, Jean, Perret, Benjamin
Contributors: Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Thermo Fisher Scientific Inc., Inês Domingues, Verónica Vasconcelos
Superior Title: Iberoamerican Congress on Pattern Recognition (CIARP) ; https://hal.science/hal-04069187 ; Iberoamerican Congress on Pattern Recognition (CIARP), Inês Domingues; Verónica Vasconcelos, Nov 2023, Coimbra, Portugal. pp.189-200, ⟨10.1007/978-3-031-49018-7_14⟩
Subject Terms: interactive segmentation, watershed, binary partition tree, minimum spanning tree, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO]Computer Science [cs]
Relation: hal-04069187; https://hal.science/hal-04069187; https://hal.science/hal-04069187v3/document; https://hal.science/hal-04069187v3/file/CIARP_2023___Interactive_segmentation_with_incremental_watershed_cuts.pdf