-
1دورية أكاديمية
المؤلفون: Cláudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Sales
المصدر: Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Graph Theory (2023)
مصطلحات موضوعية: digraphs, branchings, branching flows, arc-disjoint flows, [math]mathematics [math], [info.info-cc]computer science [cs]/computational complexity [cs.cc], [info.info-ds]computer science [cs]/data structures and algorithms [cs.ds], [math.math-co]mathematics [math]/combinatorics [math.co], Mathematics, QA1-939
وصف الملف: electronic resource
-
2
المؤلفون: Carvalho, Cláudio, Costa, Jonas, Lopes, Raul, Maia, Ana Karolinna, Nisse, Nicolas, Sales, Cláudia
المساهمون: Universidade Federal do Ceará = Federal University of Ceará (UFC), Departamento de Computaçãos [Ceará] (DC/UFC), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), UFC - Universidade Federal do Ceará = Federal University of Ceará, Université Côte d'Azur (UCA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), STIC-AmSud project GALOP (Graphs ALgorithms for Optimization Problems), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019), ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-18-CE40-0025,ASSK,Algorithmes avec décomposition moins connu: graphes et matroids(2018)
المصدر: Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, In press, 25:1 (10), pp.15. ⟨10.46298/dmtcs.9302⟩مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Branchings, General Computer Science, Digraphs, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Arc-disjoint flows, Discrete Mathematics and Combinatorics, Branching flows, [MATH]Mathematics [math], Theoretical Computer Science
وصف الملف: application/pdf
-
3
المؤلفون: Stéphane Bessy, Jørgen Bang-Jensen
المساهمون: Department of Mathematics and Computer Science [Odense] (IMADA), University of Southern Denmark (SDU), Algorithmes, Graphes et Combinatoire (ALGCO), 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)
المصدر: Bang-Jensen, J & Bessy, S 2014, ' (Arc-)disjoint flows in networks ', Theoretical Computer Science, bind 526, s. 28-40 . https://doi.org/10.1016/j.tcs.2014.01.011
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2014, 526, pp.28-40. ⟨10.1016/j.tcs.2014.01.011⟩مصطلحات موضوعية: Spanning connected, Discrete mathematics, General Computer Science, Eulerian digraph, Linkages, Arc-disjoint flows, Eulerian path, Digraph, Disjoint sets, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Theoretical Computer Science, Vertex (geometry), Arc (geometry), Combinatorics, symbols.namesake, Even cycle factor, Bounded function, Odd cycle factor, symbols, Acyclic digraph, ComputingMilieux_MISCELLANEOUS, Mathematics
-
4دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.