Výsledky vyhledávání - G.2 DISCRETE MATHEMATICS. Graph algorithms

An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem

Autoři: Geraci F Pellegrini M Renda M E

Zdroj: Ninth International Conference on Intelligent Systems Design and Applications, Pisa, Italy, 2009
info:cnr-pdr/source/autori:Geraci F.; Pellegrini M.; Renda M. E./congresso_nome:Ninth International Conference on Intelligent Systems Design and Applications/congresso_luogo:Pisa, Italy/congresso_data:2009/anno:2009/pagina_da:/pagina_a:/intervallo_pagine

Témata: (l-d) Challenge Problem, graph-based algorithm, G.2 DISCRETE MATHEMATICS. Graph algorithms, TFBS detection, motif finding problem

Přístupová URL adresa: https://publications.cnr.it/doc/83677
http://www.cnr.it/prodotto/i/83677
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/motif-ISDA.pdf
https://dblp.uni-trier.de/db/conf/isda/isda2009.html#GeraciPR09
https://ieeexplore.ieee.org/document/5364851/
http://dblp.uni-trier.de/db/conf/isda/isda2009.html#GeraciPR09
http://ieeexplore.ieee.org/document/5364851/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005364851
https://hdl.handle.net/20.500.14243/75927

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

Random Schreier Graphs as Expanders

Autoři: Caillat-Grenier, Geoffroy

Zdroj: Lecture Notes in Computer Science ISBN: 9789819610891

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, G.2, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2305.02154

Improved Outerplanarity Bounds for Planar Graphs

Autoři: Biedl, Therese Mondal, Debajyoti

Zdroj: Lecture Notes in Computer Science ISBN: 9783031754081

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), F.2, Computer Science - Data Structures and Algorithms, G.2, Data Structures and Algorithms (cs.DS), 05C85, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2407.04282

Low-temperature Sampling on Sparse Random Graphs

Autoři: Galanis, A Goldberg, LA Smolarova, P a další

Přispěvatelé: Galanis, A Goldberg, LA Smolarova, P a další

Témata: FOS: Computer and information sciences, 60J10, 68Q87, 68Q25, G.2, G.3, Discrete Mathematics (cs.DM), Probability (math.PR), Glauber dynamics, random cluster model, FOS: Mathematics, approximate sampling, ddc:004, Erdős-Rényi Graphs, approximate counting, Mathematics - Probability, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2502.08328
https://ora.ox.ac.uk/objects/uuid:23ed3204-6ce2-4c40-950f-3714e21f65b8
https://doi.org/10.4230/lipics.icalp.2025.83
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.83

The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm

Autoři: Mateus C. Silva Rafael A. Melo Mauricio G.C. Resende a další

Zdroj: Computers & Operations Research. 183:107136

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Optimization and Control (math.OC), F.2, G.2, FOS: Mathematics, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2411.14533

Discordant Voting Processes on Finite Graphs

Autoři: Colin Cooper Martin Dyer Alan Frieze a další

Přispěvatelé: Colin Cooper Martin Dyer Alan Frieze a další

Zdroj: Cooper, C, Dyer, M, Frieze, A & Rivera, N 2016, Discordant voting processes on finite graphs . in Leibniz International Proceedings in Informatics, LIPIcs . vol. 55, 145, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, 12/07/2016 . https://doi.org/10.4230/LIPIcs.ICALP.2016.145

Témata: FOS: Computer and information sciences, Randomized algorithm, Discrete Mathematics (cs.DM), F.2, G.2, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, Distributed consensus, C.2.4, Voter model, Interacting particles, ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://eprints.whiterose.ac.uk/140904/1/16m1105979.pdf
http://arxiv.org/abs/1604.06884
https://eprints.whiterose.ac.uk/140904/1/16m1105979.pdf
https://eprints.whiterose.ac.uk/114300/
https://epubs.siam.org/doi/abs/10.1137/16M1105979
https://dblp.uni-trier.de/db/journals/corr/corr1604.html#CooperDFR16
https://arxiv.org/abs/1604.06884
https://arxiv.org/pdf/1604.06884v2
https://drops.dagstuhl.de/opus/volltexte/2016/6289/
https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#CooperDFR16
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.145
https://kclpure.kcl.ac.uk/portal/en/publications/31dc1de2-187e-4713-a784-f4a55fccade9
https://kclpure.kcl.ac.uk/en/publications/31dc1de2-187e-4713-a784-f4a55fccade9

The simultaneous conjugacy problem in the symmetric group

Autoři: Andrej Brodnik Aleksander Malnič Rok Požar

Zdroj: Mathematics of Computation. 90:2977-2995

Témata: graph isomorphism, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2, 68R99, 0102 computer and information sciences, deli in vladaj, algoritem za hitro množenje, problem simultane konjugacije, iteracija, 01 natural sciences, množenje permutacij, fast multiplication algorithm, simultaneous conjugacy problem, izomorfizem grafov, permutation multiplication, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), divide-and-conquer, 0101 mathematics, Computer Science - Discrete Mathematics

Popis souboru: text/url

Přístupová URL adresa: http://arxiv.org/pdf/1907.07889
http://arxiv.org/abs/1907.07889
https://arxiv.org/pdf/1907.07889
https://www.ams.org/journals/mcom/2021-90-332/S0025-5718-2021-03637-6/
https://dblp.uni-trier.de/db/journals/moc/moc90.html#BrodnikMP21
https://www.ams.org/mcom/2021-90-332/S0025-5718-2021-03637-6/mcom3637_AM.pdf
https://hdl.handle.net/20.500.12556/RUP-16063
https://doi.org/10.1090/mcom/3637
https://repozitorij.upr.si/IzpisGradiva.php?id=16063

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

Autoři: Deligkas, Argyrios Eiben, Eduard Ganian, Robert a další

Přispěvatelé: Deligkas, Argyrios Eiben, Eduard Ganian, Robert a další

Témata: coordinated motion planning, I.2, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), F.2, G.2, ddc:004, multi-agent path finding, parameterized complexity, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

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

Sparse Pose Graph Optimization in Cycle Space

Autoři: Fang Bai Teresa Vidal-Calleja Giorgio Grisetti

Zdroj: IEEE Transactions on Robotics. 37:1381-1400

Témata: Computer Science - Robotics, 0209 industrial biotechnology, Minimum cycle basis, pose graph optimization (PGO), simultaneous localization and mapping (SLAM), special Euclidean group (SE(3)), G.2, I.2.9, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://ieeexplore.ieee.org/ielx7/8860/9556521/09346012.pdf
http://arxiv.org/abs/2203.15597
https://dblp.uni-trier.de/db/journals/trob/trob37.html#BaiVG21
https://ieeexplore.ieee.org/document/9346012/

An algorithm for road coloring

Autoři: A. N. Trahtman

Zdroj: Lecture Notes in Computer Science ISBN: 9783642250101

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2, 0102 computer and information sciences, Synchronization, 01 natural sciences, Graph, Theoretical Computer Science, Algorithm, Computational Theory and Mathematics, Deterministic finite automaton, Discrete Mathematics and Combinatorics, 0101 mathematics, Road coloring, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://www.cs.biu.ac.il/%7Etrakht/algRoad.pdf
http://arxiv.org/abs/0801.2838
https://u.cs.biu.ac.il/~trakht/algRoad.pdf
https://www.sciencedirect.com/science/article/pii/S1570866712001001
https://link.springer.com/chapter/10.1007/978-3-642-25011-8_28
https://core.ac.uk/display/81977781
http://www.sciencedirect.com/science/article/pii/S1570866712001001
https://dblp.uni-trier.de/db/conf/iwoca/iwoca2011.html#Trahtman11
https://doi.org/10.1007/978-3-642-25011-8_28
https://link.springer.com/10.1007/978-3-642-25011-8_28
https://link.springer.com/chapter/10.1007%2F978-3-642-25011-8_28

On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph

Autoři: Si, Hang

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2, weighted Delaunay triangulations, flip graph, 0102 computer and information sciences, 01 natural sciences, monotone sequence, weighted Delaunay triangulations -- non-regular triangulations -- Lawson's flip algorithm -- directed flips -- monotone sequence -- flip graph -- Higher Stasheff-Tamari poset -- redundant interior vertices -- Schönhardt polyhedron -- Steiner points, 0101 mathematics, Lawson's flip algorithm, ddc:510, 65M50, redundant interior vertices, 65D18, article, I.1.2, Schönhardt polyhedron, 65D18, 68U05, 68Q25, 65M50, 65N50, 68U05, non-regular triangulations, Steiner points, directed flips, Higher Stasheff-Tamari poset, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/1809.09701

A Linear Algorithm for Computing Independence Polynomials of Trees

Autoři: Kadrawi, Ohr Levit, Vadim E. Yosef, Ron a další

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), F.2, G.2, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 05C31, 05C05 (Primary) 05C69 (Secondary), 01 natural sciences, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2201.00432

Some properties of proper power graphs in finite Abelian groups

Autoři: G. Dhawlath V. Raja

Zdroj: Discrete Mathematics, Algorithms and Applications.

Témata: G.2, Mathematics - Combinatorics, Mathematics - Group Theory

Přístupová URL adresa: http://arxiv.org/abs/2401.11873

How to Spread a Rumor: Call Your Neighbors or Take a Walk?

Autoři: Giakkoupis, George Mallmann-Trenn, Frederik Saribekyan, Hayk a další

Přispěvatelé: Giakkoupis, George Mallmann-Trenn, Frederik Saribekyan, Hayk a další

Zdroj: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. :24-33

Témata: FOS: Computer and information sciences, Rumor spreading, 60G50, G.2, G.3, cs.DC, Discrete Mathematics (cs.DM), Information dissemination, cs.DM, 0102 computer and information sciences, information dissemination, [INFO] Computer Science [cs], 01 natural sciences, Random Walks, rumor spreading, Stochastic processes, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), Random walks, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3293611.3331622
http://arxiv.org/abs/2006.02368
http://www.repository.cam.ac.uk/handle/1810/294733
https://www.repository.cam.ac.uk/bitstream/1810/294733/1/giakkoupis_mallmann-trenn-saribekyan-podc-2019.pdf
https://hal.inria.fr/hal-02388328/document
https://dl.acm.org/doi/pdf/10.1145/3293611.3331622
https://hal.inria.fr/hal-02388328
https://arxiv.org/abs/2006.02368
https://dl.acm.org/doi/10.1145/3293611.3331622
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-02368
http://arxiv.org/pdf/2006.02368.pdf
https://arxiv.org/abs/2006.02368
https://ui.adsabs.harvard.edu/abs/2020arXiv200602368G/abstract

Well-Quasi-Ordering Eulerian Digraphs Embeddable in Surfaces by Strong Immersion

Autoři: Cavallaro, Dario Kawarabayashi, Ken-ichi Kreutzer, Stephan

Témata: FOS: Computer and information sciences, 05C10, 05C20, 05C45, 05C60, 05C83, 06F30, 57N35, 06A06, Discrete Mathematics (cs.DM), Discrete Mathematics, Combinatorics, FOS: Mathematics, G.2, F.2, Combinatorics (math.CO)

Přístupová URL adresa: http://arxiv.org/abs/2509.26260

The Maximum Number of Sets for 12 Cards is 14

Autoři: Stevens, Justin Wilson, Duncan

Témata: G.4, FOS: Computer and information sciences, G.2, Mathematics - Number Theory, Discrete Mathematics (cs.DM), 05Cxx (Primary), 11Txx, 68Rxx (Secondary), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Number Theory (math.NT), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2501.12565

A hypocoloring model for batch scheduling

Autoři: Demange, Marc Monnot, Jérôme Paschos, Vangelis a další

Přispěvatelé: Demange, Marc Monnot, Jérôme Paschos, Vangelis a další

Zdroj: Discrete Applied Mathematics. 146:3-26

Témata: Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, G.2, 0211 other engineering and technologies, Hypocolorings, Weighted colorings, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Coloring of graphs and hypergraphs, Discrete Mathematics and Combinatorics, NP-complete, Applied Mathematics, Batch scheduling, Graph coloring, Graph theory (including graph drawing) in computer science, Approximability, Subcolorings, F.1.3, chromatic scheduling, Recherche opérationnelle, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis souboru: application/xml; application/pdf

Differential approximation results for the Steiner tree problem

Autoři: Demange, Marc Monnot, Jérôme Paschos, Vangelis, Th. a další

Přispěvatelé: Demange, Marc Monnot, Jérôme Paschos, Vangelis, Th. a další

Zdroj: Applied Mathematics Letters. 16:733-739

Témata: G.2, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Differential ratio, Trees, Abstract computational complexity for mathematical programming problems, Steiner tree, Applied Mathematics, Approximate algorithms, Complexity, Programming involving graphs or networks, Approximation algorithms, Analysis of Algorithms, algorithmical approximation, Performance ratio, Algorithmical approximation, F.1.3, Reductions, Recherche opérationnelle, Algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/S0893965903000752
https://www.sciencedirect.com/science/article/pii/S0893965903000752
https://dblp.uni-trier.de/db/journals/appml/appml16.html#DemangeMP03

Counting maximal near perfect matchings in quasirandom and dense graphs

Autoři: Jing, Yifan Rafiey, Akbar

Témata: FOS: Computer and information sciences, 05C70, 05C80, 05C85, Discrete Mathematics (cs.DM), G.2, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 01 natural sciences, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/1807.04803