Výsledky vyhledávání - Mathematics of computing Discrete mathematics Combinatorial Combinatorial algorithms

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming

Autoři: Timothy F. Chan Jacob W. Cooper Martin Koutecký a další

Přispěvatelé: Timothy F. Chan Jacob W. Cooper Martin Koutecký a další

Zdroj: SIAM Journal on Computing. 51:664-700

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, Mathematics of computing → Combinatorial optimization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, branch-width, width parameters, fixed parameter tractability, Optimization and Control (math.OC), Mathematics of computing → Matroids and greedoids, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics of computing → Combinatorial algorithms, Matroid algorithms, ddc:004, integer programming, Mathematics - Optimization and Control, branch-depth, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1907.06688
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.26

NEW FAMILIES OF SPECIAL NUMBERS FOR COMPUTING NEGATIVE ORDER EULER NUMBERS AND RELATED NUMBERS AND POLYNOMIALS

Autoři: Simsek, Yilmaz

Zdroj: Applicable Analysis and Discrete Mathematics, 2018 Apr 01. 12(1), 1-35.

Přístupová URL adresa: https://www.jstor.org/stable/90020602

Combinatorial Point Configurations and Polytopes

Autoři: Sergiy Yakovlev Oksana Pichugina Liudmyla Koliechkina

Resource Type: eBook.

Témata: Combinatorial analysis

Categories: MATHEMATICS / Discrete Mathematics

The Past and Future of High Technology.

Zdroj: Studia Humana; Apr2024, Vol. 13 Issue 2, p41-45, 5p

Témata: COMPUTER logic, HIGH technology, DISCRETE mathematics, TECHNOLOGICAL innovations, PARALLEL algorithms, PROGRAMMING languages, CYBERNETICS

Geografický termín: TALLINN (Estonia), SOVIET Union

Reusability report: A distributed strategy for solving combinatorial optimization problems with hypergraph neural networks.

Autoři: Li, Xiaodi Gui, Jianfeng Xue, Wei a další

Zdroj: Nature Machine Intelligence; Nov2025, Vol. 7 Issue 11, p1870-1878, 9p

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees

Autoři: Zhuan Khye Koh Georg Loho

Zdroj: Logical Methods in Computer Science, Vol 21, Issue 2 (2025)

Témata: data structures and algorithms, discrete mathematics, logic in computer science, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95

Popis souboru: electronic resource

Relation: http://lmcs.episciences.org/11587/pdf; https://doaj.org/toc/1860-5974

Přístupová URL adresa: https://doaj.org/article/2e1b4daafe214f57bdf5b189181c6af1

Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems

Autoři: Azad, Ariful Selvitopi, Oguz Hussain, Md Taufique a další

Témata: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Discrete Mathematics, Computer Science - Performance, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/2106.14402

Combinatorial optimization in networks with Shared Risk Link Groups

Autoři: David Coudert Stéphane Pérennes Hervé Rivano a další

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Distributed Computing and... (2016)

Témata: colored graphs, shared risk link group, complexity, algorithms, multi-layer networks, [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/1297/pdf; https://doaj.org/toc/1365-8050

Přístupová URL adresa: https://doaj.org/article/1ce3f4a6a91444cfa9541f4485aaf64d

A new distance measure based on the exchange operator for the HFF-AVRP

Autoři: Marmion, Marie-Eleonore Jourdan, Laetitia Dhaenens, Clarisse a další

Přispěvatelé: Marmion, Marie-Eleonore Jourdan, Laetitia Dhaenens, Clarisse a další

Zdroj: https://inria.hal.science/inria-00475710 ; [Intern report] RR-7263, INRIA. 2010.

Témata: distance, HFF-AVRP, ACM: G.: Mathematics of Computing, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics/G.2.1.0: Combinatorial algorithms, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnost: https://inria.hal.science/inria-00475710
https://inria.hal.science/inria-00475710/document
https://inria.hal.science/inria-00475710/file/RR-7263.pdf

Cost-sharing in Parking Games

Autoři: Jennifer Elder Pamela E. Harris Jan Kretschmann a další

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Combinatorics (2024)

Témata: mathematics - combinatorics, computer science - discrete mathematics, computer science - computer science and game theory, 05a05, 91a12, 91a46, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: http://dmtcs.episciences.org/13113/pdf; https://doaj.org/toc/1365-8050

Přístupová URL adresa: https://doaj.org/article/a3dfb287411f4e948a35385c399f4255

On the Length of Monotone Paths in Polyhedra

Autoři: Blanchard, Moïse De Loera, Jesús A Louveaux, Quentin

Zdroj: SIAM Journal on Discrete Mathematics. 35(3)

Témata: Theory Of Computation, Applied Mathematics, Information and Computing Sciences, Pure Mathematics, Mathematical Sciences, simplex method, diameter and height of polytopes, pivot rules, monotone paths, graphs of polyhedra, polyhedral combinatorics, Computation Theory and Mathematics, Computation Theory & Mathematics, Theory of computation, Applied mathematics, Pure mathematics

Přístupová URL adresa: https://escholarship.org/uc/item/6mk1d53m

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Autoři: Dreier, Jan Mählmann, Nikolas Siebertz, Sebastian a další

Přispěvatelé: Dreier, Jan Mählmann, Nikolas Siebertz, Sebastian a další

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, NIP, Mathematics - Logic, 0102 computer and information sciences, stability, Theory of computation → Finite Model Theory, combinatorial characterization, 01 natural sciences, Logic in Computer Science (cs.LO), FOS: Mathematics, Mathematics - Combinatorics, first-order model checking, Combinatorics (math.CO), ddc:004, 0101 mathematics, Logic (math.LO), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2206.13765
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.125

Isomorphism Testing Parameterized by Genus and Beyond

Autoři: Neuen, Daniel Daniel Neuen Mutzel, Petra a další

Přispěvatelé: Neuen, Daniel Daniel Neuen Mutzel, Petra a další

Zdroj: 29th Annual European Symposium on Algorithms (ESA 2021)

Témata: graph isomorphism, Weisfeiler-Leman algorithm, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 01 natural sciences, Mathematics of computing → Graphs and surfaces, Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, Euler genus, fixed-parameter tractability, 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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2106.14869
https://drops.dagstuhl.de/opus/volltexte/2021/14653/
https://publications.cispa.saarland/id/eprint/3458
https://doi.org/10.4230/LIPIcs.ESA.2021.72
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-14869
https://drops.dagstuhl.de/opus/volltexte/2021/14653/pdf/LIPIcs-ESA-2021-72.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.72

Recoverable Robust Timetables: An Algorithmic Approach on Trees

Autoři: Gianlorenzo D'ANGELO Gabriele DI STEFANO NAVARRA, Alfredo a další

Přispěvatelé: Gianlorenzo D'ANGELO Gabriele DI STEFANO NAVARRA, Alfredo a další

Zdroj: Combinatorial Optimization and Applications. Third International Conference-COCOA 2009, pp. 451–462, Huangshan, China, 10-12 giugno 2009
info:cnr-pdr/source/autori:D'Angelo G.; Di Stefano G.; Navarra A.; Pinotti M. C./congresso_nome:Combinatorial Optimization and Applications. Third International Conference-COCOA 2009/congresso_luogo:Huangshan, China/congresso_data:10-12 giugno 2009/anno:2009/pagina_da:451/pagina_a:462/intervallo_pagine:451–462

Témata: Dynamic Programming G.2.2 Graph Theory, G.0 Mathematics of Computing. General, Timetable, combinatorial optimization, dynamic programming, robustness, scheduling activities, D.4.8 Simulation, Scheduling, G.2 Discrete Mathematics, D.4 Operating Systems, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Reliability, Time Tabling

Popis souboru: application/pdf

Přístupová URL adresa: http://hal.inria.fr/hal-00643980/PDF/RobustTree.pdf
https://inria.hal.science/hal-00643980v1
https://inria.hal.science/hal-00643980v1/document
https://doi.org/10.1109/tc.2010.142
http://doi.ieeecomputersociety.org/10.1109/TC.2010.142
https://dblp.uni-trier.de/db/journals/tc/tc60.html#DAngeloSNP11
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005487505
https://doi.org/10.1109/TC.2010.142
http://ieeexplore.ieee.org/document/5487505/
https://ieeexplore.ieee.org/document/5487505/
https://openportal.isti.cnr.it/doc?id=people______::dd7757cd481f0a01af7a342508d1c4f8

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

Autoři: Kanté, Mamadou Moustapha Kim, Eun Jung Kwon, O-Joung a další

Přispěvatelé: Kanté, Mamadou Moustapha Kim, Eun Jung Kwon, O-Joung a další

Zdroj: Journal of Combinatorial Theory, Series B. 160:15-35

Témata: Linear rank-width, path-width, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 0102 computer and information sciences, 01 natural sciences, Graph, forbidden minor, FOS: Mathematics, Vertex-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, pivot-minor, Matroid, linear rank-width, Pivot-minor, graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Path-width, Combinatorics, vertex-minor, Forbidden minor, matroid, Combinatorics (math.CO), ddc:004, Recherche opérationnelle, 05B35 (Primary), 05C75 (Secondary)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2109.12291
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.40
https://hal.science/hal-04056695v1
https://doi.org/10.1016/j.jctb.2022.12.004
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2
https://doi.org/10.4230/lipics.stacs.2022.40

Optimal Construction of Hierarchical Overlap Graphs

Autoři: Khan, Shahbaz Gawrychowski, Pawel Starikovskaya, Tatiana a další

Přispěvatelé: Khan, Shahbaz Gawrychowski, Pawel Starikovskaya, Tatiana a další

Zdroj: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)

Témata: String algorithms, FOS: Computer and information sciences, Genome assembly, Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Hierarchical Overlap Graphs, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004, Theory of computation → Data compression, Mathematics of computing → Trees, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2102.02873
https://drops.dagstuhl.de/opus/volltexte/2021/13968/pdf/LIPIcs-CPM-2021-17.pdf/
https://researchportal.helsinki.fi/en/publications/optimal-construction-of-hierarchical-overlap-graphs
https://drops.dagstuhl.de/opus/volltexte/2021/13968/
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-02873
https://helda.helsinki.fi/handle/10138/334910
http://hdl.handle.net/10138/334910
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.17

Isomorphism for Tournaments of Small Twin Width

Autoři: Grohe, Martin Neuen, Daniel Martin Grohe and Daniel Neuen

Přispěvatelé: Grohe, Martin Neuen, Daniel Martin Grohe and Daniel Neuen

Zdroj: Saarbrücken/Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 297, 78:[1]-78:20 (2024). doi:10.4230/LIPICS.ICALP.2024.78
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson51. International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, 2024-07-08-2024-07-12
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming

Témata: Weisfeiler-Leman algorithm, FOS: Computer and information sciences, twin width, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Finite Model Theory, tournament isomorphism, Theory of computation → Fixed parameter tractability, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2312.02048
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.78
https://publications.rwth-aachen.de/record/1006759

Markov Bases: Their Complexity and Applications to Network Analysis

Autoři: Almendra Hernandez, Felix

Témata: Mathematics, Statistics, Applied mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/2pq6k753
https://escholarship.org/content/qt2pq6k753/qt2pq6k753.pdf

A Characterization of Individualization-Refinement Trees

Autoři: Anders, Markus Brachter, Jendrik Schweitzer, Pascal a další

Přispěvatelé: Anders, Markus Brachter, Jendrik Schweitzer, Pascal a další

Témata: graph isomorphism, FOS: Computer and information sciences, F.2.2, G.2.2, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, 0102 computer and information sciences, 01 natural sciences, Theory of computation → Graph algorithms analysis, individualization refinement algorithms, Computer Science - Data Structures and Algorithms, 05C75, Data Structures and Algorithms (cs.DS), ddc:004, backtracking trees, Mathematics of computing → Trees, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2109.07302
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.24

Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems

Autoři: Ariful Azad Oguz Selvitopi Md Taufique Hussain a další

Zdroj: IEEE Transactions on Parallel and Distributed Systems, vol 33, iss 4

Témata: FOS: Computer and information sciences, Data structures, Discrete Mathematics (cs.DM), graph theory, Libraries, Data analysis, 02 engineering and technology, 01 natural sciences, Computer Software, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, 0101 mathematics, Communications Technologies, Computer Science - Performance, parallel computing, Distributed computing and systems software, Indexes, Computational modeling, communication-avoidance algorithms, Performance (cs.PF), Computer Science - Distributed, Parallel, and Cluster Computing, combinatorics, Sparse matrices, Three-dimensional displays, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), Distributed Computing, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/pdf/2106.14402
http://arxiv.org/abs/2106.14402
https://dblp.uni-trier.de/db/journals/tpds/tpds33.html#AzadSHGB22
https://escholarship.org/uc/item/97f5g1vw