Suchergebnisse - "[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]"

Treffer weiter einschränken
  1. 1

    Monitoring edge-geodetic sets in graphs

    Autoren: Dev, Subhadeep Dey, Sanjana Foucaud, Florent et al.

    Weitere Verfasser: Dev, Subhadeep Dey, Sanjana Foucaud, Florent et al.

    Quelle: Discrete Applied Mathematics. 377:598-610

    Schlagwörter: Edge-geodetic set, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Monitoring, Combinatorics, Feedback edge set, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences, NP-completeness

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2210.03774

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Soft-ECM: An extension of Evidential C-Means for complex data

    Autoren: Soubeiga, Armel Guyet, Thomas Antoine, Violaine

    Weitere Verfasser: Soubeiga, Armel Guyet, Thomas Antoine, Violaine

    Quelle: 2025 IEEE International Conference on Fuzzy Systems (FUZZ). :1-6

    Schlagwörter: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Machine Learning, FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Artificial Intelligence (cs.AI), Discrete Mathematics (cs.DM), [SDV.SPEE] Life Sciences [q-bio]/Santé publique et épidémiologie, Artificial Intelligence, Discrete Mathematics, Machine Learning (cs.LG)

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2507.13417
    https://inria.hal.science/hal-05162452v1

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    An overview on simple P systems with specific variants of derivation modes

    Autoren: Alhazov, Artiom Freund, Rudolf Ivanov, Sergiu et al.

    Weitere Verfasser: Alhazov, Artiom Freund, Rudolf Ivanov, Sergiu et al.

    Quelle: Journal of Membrane Computing. 7:326-340

    Schlagwörter: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ET0L systems, P systems, Computational completeness, Derivation modes, Prescribed teams, Regular sets

    Zugangs-URL: https://univ-evry.hal.science/hal-05195631v1
    https://doi.org/10.1007/s41965-025-00198-9

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Bounds and extremal graphs for monitoring edge-geodetic sets in graphs

    Autoren: Foucaud, Florent Marcille, Clara Myint, Zin Mar et al.

    Weitere Verfasser: Foucaud, Florent Marcille, Clara Myint, Zin Mar et al.

    Quelle: Discrete Applied Mathematics. 366:106-119

    Schlagwörter: Monitoring edge geodetic set, FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Girth, Discrete Mathematics (cs.DM), FOS: Mathematics, Geodetic set, Subdivisions, Chromatic number, Mathematics - Combinatorics, k-clique sum, Combinatorics (math.CO), Computer Science - Discrete Mathematics

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2403.09122

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide

    Autoren: Ghasemi, Fatemeh Grange, Julien Kanté, Mamadou Moustapha et al.

    Weitere Verfasser: Ghasemi, Fatemeh Grange, Julien Kanté, Mamadou Moustapha et al.

    Schlagwörter: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Almost-wide, Flip-flatness

    Zugangs-URL: https://hal.science/hal-05332862v1

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    Probability-graphons: Limits of large dense weighted graphs

    Autoren: Abraham, Romain Delmas, Jean-François Weibel, Julien

    Weitere Verfasser: Abraham, Romain Delmas, Jean-François Weibel, Julien

    Quelle: Innovations in Graph Theory. 2:25-117

    Schlagwörter: FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Graphons, Discrete Mathematics (cs.DM), Probability (math.PR), Dense graph limits, Stochastic networks, Decorated graphs, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Probability-graphons, FOS: Mathematics, Weighted graphs, Mathematics - Probability, Random graphs, Computer Science - Discrete Mathematics

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2312.15935
    https://hal.science/hal-04361443v1/document
    https://hal.science/hal-04361443v1
    https://doi.org/10.5802/igt.7

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    Tridendriform algebras on hypergraph polytopes

    Autoren: Curien, Pierre-Louis Delcroix-Oger, Bérénice Obradović, Jovana

    Weitere Verfasser: Curien, Pierre-Louis Delcroix-Oger, Bérénice Obradović, Jovana

    Quelle: Algebraic Combinatorics. 8:201-234

    Schlagwörter: Nestohedra, Polydendriform structure, [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], 01 natural sciences, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], FOS: Mathematics, 18M60, 52B05, Hypergraph polytopes, Mathematics - Combinatorics, Shuffle product, Combinatorics (math.CO), 0101 mathematics, Associative product, Tridendriform structure

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2201.05365
    https://hal.science/hal-03525971v3
    https://hal.science/hal-03525971v3/document

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    The combinatorics of Motzkin polyominoes

    Autoren: Baril, Jean-Luc Kirgizov, Sergey Ramírez, José et al.

    Weitere Verfasser: Baril, Jean-Luc Kirgizov, Sergey Ramírez, José et al.

    Quelle: Discrete Applied Mathematics. 364:1-15

    Schlagwörter: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], FOS: Computer and information sciences, Motzkin word, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Discrete Mathematics (cs.DM), Bijections, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Generating function, Computer Science - Discrete Mathematics

    Zugangs-URL: http://arxiv.org/abs/2401.06228

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  9. 9

    Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms

    Autoren: Ildikó Schlotter András Sebő Optimisation Combinatoire (G-SCOP_OC) et al.

    Weitere Verfasser: Ildikó Schlotter András Sebő Optimisation Combinatoire (G-SCOP_OC) et al.

    Quelle: SIAM Journal on Discrete Mathematics. 39:484-504

    Schlagwörter: FOS: Computer and information sciences, 68Q17 (Primary) 05C85, 05C12, 68R10, 68Q25 (Secondary), G.2.1, G.2.2, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Complexity (cs.CC), F.2.2, 01 natural sciences, Computer Science - Computational Complexity, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)

    Zugangs-URL: http://arxiv.org/abs/2211.12862

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  10. 10

    An asymptotically optimal algorithm for generating bin cardinalities

    Autoren: Devroye, Luc Los, Dimitrios

    Weitere Verfasser: Devroye, Luc Los, Dimitrios

    Quelle: Mathematics and Computers in Simulation. 228:147-155

    Schlagwörter: FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], 65C10, 60C05, 11K45, 68W20, 68U20, 68W27, 68W40, Discrete Mathematics (cs.DM), Poissonization, Power of two choices, G.3, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], G.2.m, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Multinomial distribution, Hashing, F.2.2, Computer Science - Data Structures and Algorithms, Balls-into-bins, Data Structures and Algorithms (cs.DS), Balanced allocations, Expected time analysis, Random variate generation, Simulation, Computer Science - Discrete Mathematics

    Zugangs-URL: http://arxiv.org/abs/2404.07011

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  11. 11

    On the [r, s, t]-coloring of the square of cylindrical grids

    Autoren: Effantin, Brice JARDIN, Nicolas

    Weitere Verfasser: Effantin, Brice JARDIN, Nicolas

    Quelle: Discrete Mathematics Letters, Vol 15, Pp 15-22 (2025)

    Schlagwörter: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], total coloring, vertex coloring, QA1-939, cartesian product, edge coloring, Mathematics

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://doaj.org/article/0e0afada48ac4b7c8c541dca969fe876

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  12. 12

    Helly groups

    Autoren: Chalopin, Jérémie Chepoi, Victor Genevois, Anthony et al.

    Weitere Verfasser: Chalopin, Jérémie Chepoi, Victor Genevois, Anthony et al.

    Quelle: Geometry & Topology. 29:1-70

    Schlagwörter: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], FOS: Mathematics, Mathematics - Combinatorics, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-MG] Mathematics [math]/Metric Geometry [math.MG], Group Theory (math.GR), Combinatorics (math.CO), 0101 mathematics, Mathematics - Group Theory, 01 natural sciences

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2002.06895

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  13. 13

    Endhered Patterns in Matchings and RNA

    Autoren: Célia Biane Greg Hampikian Sergey Kirgizov et al.

    Weitere Verfasser: Célia Biane Greg Hampikian Sergey Kirgizov et al.

    Quelle: Journal of Computational Biology. 32:28-46

    Schlagwörter: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Quantitative Biology - Biomolecules, Discrete Mathematics (cs.DM), FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Biomolecules (q-bio.BM), Combinatorics (math.CO), [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Computer Science - Discrete Mathematics

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/39714916
    http://arxiv.org/abs/2404.18802
    https://hal.science/hal-04563757v2
    https://hal.science/hal-04563757v2/document

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  14. 14

    Reconfiguration of Digraph Homomorphisms

    Autoren: Lévêque, Benjamin Mühlenthaler, Moritz Suzan, Thomas et al.

    Weitere Verfasser: Lévêque, Benjamin Mühlenthaler, Moritz Suzan, Thomas et al.

    Quelle: SIAM Journal on Discrete Mathematics. 39:327-360

    Schlagwörter: FOS: Computer and information sciences, Combinatorial Reconfiguration, Discrete Mathematics (cs.DM), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Digraph Homomorphisms, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2205.09210
    https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.43

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  15. 15

    Benefits of Hypergraphs for Density-Based Clustering

    Autoren: Hauseux, Louis Avrachenkov, Konstantin Zerubia, Josiane

    Weitere Verfasser: Hauseux, Louis Avrachenkov, Konstantin Zerubia, Josiane

    Quelle: 2024 32nd European Signal Processing Conference (EUSIPCO). :2302-2306

    Schlagwörter: percolation, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], hypergraphs, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, geometric graphs, density estimator, [INFO] Computer Science [cs], hierarchical clustering

    Dateibeschreibung: application/pdf

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  16. 16

    Optimal Adjacency Labels for Subgraphs of Cartesian Products

    Autoren: Louis Esperet Nathaniel Harms Viktor Zamaraev et al.

    Weitere Verfasser: Louis Esperet Nathaniel Harms Viktor Zamaraev et al.

    Quelle: SIAM Journal on Discrete Mathematics. 38:2181-2193

    Schlagwörter: FOS: Computer and information sciences, Adjacency labeling schemes, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, 05C78, 05C76, 68R10, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, Cartesian product, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 0101 mathematics, Hypercubes

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2206.02872
    https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.57

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  17. 17

    An Improved Drift Theorem for Balanced Allocations

    Autoren: Dimitrios Los Thomas Sauerwald Los, Dimitrios

    Weitere Verfasser: Dimitrios Los Thomas Sauerwald Los, Dimitrios

    Quelle: ACM Transactions on Algorithms. 20:1-39

    Schlagwörter: FOS: Computer and information sciences, Heavily loaded case, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Discrete Mathematics (cs.DM), Power of two choices, G.3, Gap bounds, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, G.2.m, 01 natural sciences, Potential functions, Drift theorem, Memory, FOS: Mathematics, 68W20, 68W27, 68W40, 60C05, Balanced allocations, Probability (math.PR), [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], F.2.2, Balls-into-bins, Maximum load, Random allocations, Weighted balls, Mathematics - Probability, Computer Science - Discrete Mathematics

    Zugangs-URL: http://arxiv.org/abs/2308.11083
    https://hal.science/hal-04889279v1
    https://doi.org/10.1145/3673900

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  18. 18

    The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs

    Autoren: Di Marco, N. Frosini, A. Picouleau, C. et al.

    Weitere Verfasser: Di Marco, N. Frosini, A. Picouleau, C. et al.

    Quelle: Discrete Applied Mathematics. 355:232-246

    Schlagwörter: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Uniform hypergraph, Intersection graph, Triangulated graph, NP-complete, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2305.13932
    https://hal.science/hal-04576670v1
    https://doi.org/10.1016/j.dam.2024.05.009

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  19. 19

    On Graphs Coverable by \({k}\) Shortest Paths

    Autoren: Dumas, Maël Foucaud, Florent Perez, Anthony et al.

    Weitere Verfasser: Dumas, Maël Foucaud, Florent Perez, Anthony et al.

    Quelle: SIAM Journal on Discrete Mathematics. 38:1840-1862

    Schlagwörter: FOS: Computer and information sciences, Computational Complexity, covering problems, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Shortest paths, 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 15. Life on land, 01 natural sciences, 7. Clean energy, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, parameterized complexity

    Dateibeschreibung: application/pdf

    Zugangs-URL: http://arxiv.org/abs/2206.15088
    https://hal.science/hal-03895886v1
    https://doi.org/10.4230/lipics.isaac.2022.40
    https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.40

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  20. 20

    The Anchor-Robust Project Scheduling Problem

    Autoren: Pascale Bendotti Philippe Chrétienne Pierre Fouilhoux et al.

    Weitere Verfasser: Pascale Bendotti Philippe Chrétienne Pierre Fouilhoux et al.

    Quelle: Operations Research. 71:2267-2290

    Schlagwörter: anchored decisions, rescheduling, 0211 other engineering and technologies, robust optimization, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], Project scheduling

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://hal.science/hal-02990583v1

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: