Výsledky vyhľadávania - Mathematics of computing Discrete mathematics Combinatorics Combinatorial algorithms*

Isomorphism Testing Parameterized by Genus and Beyond

Autori: Neuen, Daniel Daniel Neuen Mutzel, Petra a ďalší

Prispievatelia: Neuen, Daniel Daniel Neuen Mutzel, Petra a ďalší

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

Predmety: 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 súboru: application/pdf

Prí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

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

Autori: Simsek, Yilmaz

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

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

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Autori: Dreier, Jan Mählmann, Nikolas Siebertz, Sebastian a ďalší

Prispievatelia: Dreier, Jan Mählmann, Nikolas Siebertz, Sebastian a ďalší

Predmety: 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 súboru: application/pdf

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

Graphs for Pattern Recognition : Infeasible Systems of Linear Inequalities

Autori: Damir Gainanov

Typ zdroja: eBook.

Predmet: Inequalities (Mathematics), Graph theory

Kategórie: MATHEMATICS / Combinatorics, COMPUTERS / Image Processing, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Geometry / General, MATHEMATICS / Optimization

Combinatorial Point Configurations and Polytopes

Autori: Sergiy Yakovlev Oksana Pichugina Liudmyla Koliechkina

Typ zdroja: eBook.

Predmet: Combinatorial analysis

Kategórie: MATHEMATICS / Discrete Mathematics

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

Autori: Azad, Ariful Selvitopi, Oguz Hussain, Md Taufique a ďalší

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

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

Intensive use of computing resources for dominations in grids and other combinatorial problems

Autori: Talon, Alexandre

Témy: Computer Science - Discrete Mathematics, Mathematics - Combinatorics, text

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

Approximations of Points: Combinatorics and Algorithms

Autori: Mustafa, Nabil

Predmety: [INFO:INFO_CG] Computer Science/Computational Geometry, [INFO:INFO_CG] Informatique/Géométrie algorithmique, [INFO:INFO_DS] Computer Science/Data Structures and Algorithms, [INFO:INFO_DS] Informatique/Algorithme et structure de données, [MATH:MATH_ST] Mathematics/Statistics, [MATH:MATH_ST] Mathématiques/Statistiques, [STAT:TH] Statistics/Statistics Theory, [STAT:TH] Statistiques/Théorie, [MATH:MATH_CO] Mathematics/Combinatorics, [MATH:MATH_CO] Mathématiques/Combinatoire, geometric algorithms, combinatorics, discrete mathematics, computational geometry, statistics, approximation algorithms

Dostupnosť: http://tel.archives-ouvertes.fr/tel-01062825
http://tel.archives-ouvertes.fr/docs/01/06/28/25/PDF/thesis.pdf

Computation in Multicriteria Matroid Optimization

Autori: Jesús A. De Loera David C. Haws Jon Lee a ďalší

Prispievatelia: Jesús A. De Loera David C. Haws Jon Lee a ďalší

Zdroj: http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf.

Predmety: Categories and Subject Descriptors, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial Algorithms, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph Theory General Terms, Algorithms, Experimentation, Performance Additional Key Words and Phrases, Matroids, Matroid Optimization, Multicriteria Optimization, Local Search, Tabu Search, Non-linear combinatorial optimization, Multiobjective Optimization

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1553; http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1553
http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf

Mathematization Through Application and Common Sense: Motivating Intellectual Activities of Schoolchildren with Digital Tools.

Autori: Abramovich, Sergei Malyutin, Egor Pozdniakov, Sergei

Zdroj: Digital; Sep2025, Vol. 5 Issue 3, p41, 19p

Leveraging Prediction and Reflection in a Computational Setting to Enrich Undergraduate Students' Combinatorial Thinking.

Autori: Lockwood, Elise

Zdroj: Cognition & Instruction; Jul-Sep2022, Vol. 40 Issue 3, p413-455, 43p

Predmety: UNDERGRADUATES, INSTRUCTIONAL systems design, STUDENT engagement, FORECASTING, PROBLEM solving

Understanding normal and restricted normal products in soft directed graphs.

Autori: Jose, Jinta George, Bobin Thumbakara, Rajesh K. a ďalší

Zdroj: Journal of Nigerian Society of Physical Sciences; Aug2024, Vol. 6 Issue 3, p1-10, 10p

Predmety: DIRECTED graphs, SOFT sets, COMBINATORICS, UNCERTAINTY, GRAPH theory

Explicit OR-dispersers with polylogarithmic degree

Autori: Saks, M. Srinivasan, A. Zhou, S. a ďalší

Prispievatelia: Saks, M. Srinivasan, A. Zhou, S. a ďalší

Zdroj: Journal of the ACM. 45:123-154

Predmety: F.1.3 [Computaion by Abstract Devices]: Complexity Classes - relations among randomized complexity classes, G.2.1 [Discrete Mathematics]: Combinatorics - combinatorial algorithms, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, RP algorithms, G.3 [Probability and Statistics]: probabilistic algorithms, 01 natural sciences, Algorithms, bipartite multigraph

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1190615
https://doi.org/10.1145/273865.273915
https://dl.acm.org/doi/10.1145/273865.273915
https://dblp.uni-trier.de/db/journals/jacm/jacm45.html#SaksSZ98
https://www.researchwithrutgers.com/en/publications/explicit-or-dispersers-with-polylogarithmic-degree

Traversing combinatorial 0/1-polytopes via optimization

Autori: Merino, Arturo Mütze, Torsten

Témy: Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, text

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

Fast algorithms for Vizing's theorem on bounded degree graphs

Autori: Anton Bernshteyn Abhishek Dhawan

Zdroj: Journal of Combinatorial Theory, Series B. 175:69-125

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing, 0102 computer and information sciences, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), 01 natural sciences

Prístupová URL adresa: http://arxiv.org/abs/2303.05408

Polyhedral approach to weighted connected matchings in general graphs

Autori: Phillippe Samer Phablo F.S. Moura

Zdroj: Discrete Applied Mathematics

Predmety: G.4, FOS: Computer and information sciences, Combinatorial optimization, Induced connectivity, Discrete Mathematics (cs.DM), MINIMUM CUT-SETS, G.1.6, Mathematics, Applied, G.2.2, Polyhedral combinatorics, NP-COMPLETENESS, Computation Theory & Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), 0102 Applied Mathematics, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, 4901 Applied mathematics, Data Structures and Algorithms (cs.DS), connected subgraphs, polyhedral combinatorics, integer programming, 0802 Computation Theory and Mathematics, 4613 Theory of computation, Science & Technology, Connected matchings, induced connectivity, 4601 Applied computing, Integer programming, 90C27, 90C57, 90C11, 68R10, Connected subgraphs, Physical Sciences, connected matchings, combinatorial optimization, Combinatorics (math.CO), Mathematics, Computer Science - Discrete Mathematics

Popis súboru: application/xml; application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2310.05733
https://hdl.handle.net/11250/3145882

A complex network perspective on brain disease.

Autori: Papo D Buldú JM

Zdroj: Biological reviews of the Cambridge Philosophical Society [Biol Rev Camb Philos Soc] 2025 Oct 15. Date of Electronic Publication: 2025 Oct 15.

Spôsob vydávania: Journal Article

Informácie o časopise: Publisher: Cambridge University Press Country of Publication: England NLM ID: 0414576 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 1469-185X (Electronic) Linking ISSN: 00063231 NLM ISO Abbreviation: Biol Rev Camb Philos Soc Subsets: MEDLINE

Computing Distances on Graph Associahedra is Fixed-parameter Tractable

Autori: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. a ďalší

Prispievatelia: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. a ďalší

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, reconfiguration, Discrete Mathematics (cs.DM), fixed-parameter tractable algorithm, elimination tree, G.2.1, G.2.2, G.2.3, rotation distance, graph associahedra, combinatorial shortest path, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 05C85, 05C10, 0C05, 90C08, 90C27, parameterized complexity, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2504.18338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.63

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.

Autori: Goos, Gerhard Hartmanis, Juris van Leeuwen, Jan a ďalší

Zdroj: Algorithm Engineering. 2001, p195-206. 12p.

Sparse induced subgraphs of large treewidth

Autori: Édouard Bonnet

Zdroj: Journal of Combinatorial Theory, Series B. 173:184-203

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 05C99, 05C69, sparsity, Theory of computing, General logic, induced subgraphs, Graph theory, Computer Science - Data Structures and Algorithms, treewidth, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), F.2.2, Computer Science - Discrete Mathematics

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2405.13797