Výsledky vyhledávání - Mathematics of computing Discrete mathematics Graph theory Paths and connectivity problems*

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time

Autoři: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu a další

Přispěvatelé: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu a další

Zdroj: ACM Transactions on Algorithms
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Témata: Genomics (q-bio.GN), FOS: Computer and information sciences, Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Graph algorithm, strong connectivity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computation theory, Genes, Graph theory, Program assemblers, Reachability under failures, Strong connectivity, Bioinformatics, Theory of computation → Graph algorithms analysis, Mathematics of computing → Paths and connectivity problems, reachability under failures, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Quantitative Biology - Genomics, Applied computing → Computational biology, Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2002.10498
https://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#CairoRTZ21
https://drops.dagstuhl.de/opus/volltexte/2021/14112/
https://drops.dagstuhl.de/opus/volltexte/2021/14112/pdf/LIPIcs-ICALP-2021-43.pdf/
https://helda.helsinki.fi/handle/10138/332217
https://doi.org/10.4230/LIPIcs.ICALP.2021.43
https://researchportal.helsinki.fi/en/publications/genome-assembly-from-practice-to-theory-safe-complete-and-linear-
http://hdl.handle.net/10138/332217
http://hdl.handle.net/10138/568677
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.43
https://hdl.handle.net/11562/1057335
https://doi.org/10.4230/lipics.icalp.2021.43

Distributed Percolation Analysis for Turbulent Flows

Autoři: Friederici, Anke Köpp, Wiebke Atzori, Marco a další

Zdroj: Swedish e-Science Research Centre 2019 IEEE 9th Symposium on Large Data Analysis and Visualization, LDAV 2019. :42-51

Témata: Computing methodologies, Discrete mathematics, Distributed algorithms, Distributed computing methodologies, Graph theory, Mathematics of computing, Paths and connectivity problems, Datalogi, Computer Science, SRA - E-Science (SeRC), SRA - E-vetenskap (SeRC)

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-267897
https://kth.diva-portal.org/smash/get/diva2:1410816/FULLTEXT01.pdf

Cut paths and their remainder structure, with applications

Autoři: Cairo, Massimo Khan, Shahbaz Rizzi, Romeo a další

Přispěvatelé: Cairo, Massimo Khan, Shahbaz Rizzi, Romeo a další

Témata: safety, FOS: Computer and information sciences, covering walk, Discrete Mathematics (cs.DM), essentiality, strong bridge, 0102 computer and information sciences, Quantitative Biology - Quantitative Methods, 01 natural sciences, Mathematics of computing → Paths and connectivity problems, reachability, cut arc, strong bridge, covering walk, safety, persistence, essentiality, genome assembly, FOS: Mathematics, Mathematics - Combinatorics, Applied computing → Computational biology, Quantitative Methods (q-bio.QM), Computer and information sciences, persistence, Theory of computation → Graph algorithms analysis, FOS: Biological sciences, genome assembly, Combinatorics (math.CO), ddc:004, reachability, cut arc, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2210.07530
http://hdl.handle.net/10138/356746
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.17
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.17
https://hdl.handle.net/11562/1117633
https://doi.org/10.4230/lipics.stacs.2023.17

Efficient Isomorphism for Sd-Graphs and T-Graphs.

Autoři: Ağaoğlu Çağırıcı, Deniz Hliněný, Petr

Zdroj: Algorithmica; Feb2023, Vol. 85 Issue 2, p352-383, 32p

Témata: ISOMORPHISM (Mathematics), GRAPH theory, COMPUTATIONAL mathematics, GRAPH connectivity, COMBINATORICS, AUTOMORPHISM groups, INTERSECTION graph theory

A Java Application for Teaching Graphs in Undergraduate Courses.

Autoři: Migallón, Violeta Penadés, José

Zdroj: Applied Sciences (2076-3417); Dec2023, Vol. 13 Issue 23, p12945, 31p

Témata: INFORMATION technology, COMPUTATIONAL mathematics, HIGH school curriculum, HIGH school teachers, COMPUTER engineering, GRAPH algorithms, SOFTWARE engineering

An Enumerative Perspective on Connectivity

Autoři: Shyan Akmal

Zdroj: 2024 Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977936

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

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

On Landmark Distances in Polygons.

Autoři: Gotsman, C. Hormann, K.

Zdroj: Computer Graphics Forum. Aug2021, Vol. 40 Issue 5, p275-287. 13p. 16 Diagrams.

Témata: POLYGONS, GEODESIC distance, ROBOT hands, ROUTING algorithms, DISTANCES, GREEDY algorithms, GRAPH algorithms

Connectivity in Networks and Compact Labeling Schemes for Emergency Planning ; Connexité dans les Réseaux et Schémas d'Étiquetage Compact d'Urgence

Autoři: Halftermeyer, Pierre Laboratoire Bordelais de Recherche en Informatique (LaBRI) Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) a další

Přispěvatelé: Halftermeyer, Pierre Laboratoire Bordelais de Recherche en Informatique (LaBRI) Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) a další

Zdroj: https://tel.archives-ouvertes.fr/tel-01110316 ; Algorithme et structure de données [cs.DS]. Universite de Bordeaux, 2014. Français.

Témata: emergency planning, forbidden-set connectity, labeling scheme, graphs on surfaces, graph minor, planification de l’urgence, schéma d’étiquetage, connexité avec panne, mineur de graphe, graphes sur les surfaces, 05C10 05C78 05C83 05C85 68R10 68W15, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Relation: tel-01110316; https://tel.archives-ouvertes.fr/tel-01110316; https://tel.archives-ouvertes.fr/tel-01110316/document; https://tel.archives-ouvertes.fr/tel-01110316/file/these.pdf

Dostupnost: https://tel.archives-ouvertes.fr/tel-01110316
https://tel.archives-ouvertes.fr/tel-01110316/document
https://tel.archives-ouvertes.fr/tel-01110316/file/these.pdf

Dynamic Connectivity in Disk Graphs.

Autoři: Baumann, Alexander Kaplan, Haim Klost, Katharina a další

Zdroj: Discrete & Computational Geometry. Jan2024, Vol. 71 Issue 1, p214-277. 64p.

Témata: *DATA structures, *INTERSECTION graph theory, *INVERSE functions

Mobile Network Analysis Using Probabilistic Connectivity Matrices.

Autoři: Brooks, Richard R. Pillai, Brijesh Racunas, Stephen a další

Zdroj: IEEE Transactions on Systems, Man & Cybernetics: Part C - Applications & Reviews; Jul2007, Vol. 37 Issue 4, p694-702, 9p, 4 Black and White Photographs, 6 Graphs

Témata: GRAPH theory, COMPUTATIONAL mathematics, FREE probability theory, NETWORK analysis (Planning), LINEAR algebra

THE DISCRETE YET UBIQUITOUS THEOREMS OF CARATHÚEODORY, HELLY, SPERNER, TUCKER, AND TVERBERG.

Autoři: DE LOERA, JESÚUS A. GOAOC, XAVIER MEUNIER, FRÚEDÚERIC a další

Zdroj: Bulletin (New Series) of the American Mathematical Society; Jul2019, Vol. 56 Issue 3, p415-511, 97p

Témata: GRAPH theory, COMBINATORIAL geometry, MATHEMATICAL optimization, COMPUTATIONAL geometry, COMPUTATIONAL mathematics

Towards transient space-use dynamics: re-envisioning models of utilization distribution and their applications.

Autoři: Tao, Yun Giunta, Valeria Börger, Luca a další

Zdroj: Movement Ecology. 2/28/2025, Vol. 13 Issue 1, p1-14. 14p.

Proceedings of the First International Conference on Applied Mathematics, Statistics, and Computing (ICAMSAC 2023)

Autoři: Komang Dharmawan Ngurah Agus Sanjaya ER

Resource Type: eBook.

Témata: Mathematics--Congresses, Computer simulation--Congresses

Categories: COMPUTERS / Computer Simulation

Planar Maps, Random Walks and Circle Packing : École D'Été De Probabilités De Saint-Flour XLVIII - 2018

Autoři: Asaf Nachmias

Resource Type: eBook.

Témata: Random walks (Mathematics)

Categories: MATHEMATICS / Probability & Statistics / General, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Geometry / General, SCIENCE / Physics / Mathematical & Computational

Maximal Planar Graph Theory and the Four-Color Conjecture

Autoři: Jin Xu

Resource Type: eBook.

Témata: Graph coloring, Geometry

Categories: COMPUTERS / Computer Science

Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems

Autoři: Andreica, Mugurel Ionut Tapus, Nicolae

Témata: FOS: Computer and information sciences, F.2.2, G.2.1, Computer Science - Distributed, Parallel, and Cluster Computing, 0203 mechanical engineering, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, Distributed, Parallel, and Cluster Computing (cs.DC), Computer Science - Discrete Mathematics

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

2-Edge Connectivity in Directed Graphs

Autoři: Georgiadis L Italiano G Laura L a další

Přispěvatelé: Georgiadis L Italiano G Laura L a další

Zdroj: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. :1988-2005

Témata: FOS: Computer and information sciences, Connectivity, flow graph, Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, 0102 computer and information sciences, directed graph, 16. Peace & justice, 01 natural sciences, dominators, mathematics (miscellaneous), dominator, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Popis souboru: application/pdf

Přístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611973730.132
http://arxiv.org/pdf/1409.6277.pdf
http://arxiv.org/abs/1407.3041
https://dl.acm.org/doi/abs/10.1145/2968448
https://dblp.uni-trier.de/db/journals/talg/talg13.html#GeorgiadisILP16
https://dblp.uni-trier.de/db/journals/corr/corr1407.html#GeorgiadisILP14
https://core.ac.uk/display/25041881
https://art.torvergata.it/handle/2108/115646
http://dblp.uni-trier.de/db/journals/corr/corr1407.html#GeorgiadisILP14
https://epubs.siam.org/doi/pdf/10.1137/1.9781611973730.132
https://iris.luiss.it/handle/11385/182816
http://dl.acm.org/citation.cfm?id=J982
https://doi.org/10.1145/2968448
https://hdl.handle.net/2108/201134
http://dl.acm.org/citation.cfm?doid=2997037.2968448
https://hdl.handle.net/11385/182816
https://doi.org/10.1145/2968448

The White Puzzle: A Framework for Computation as a Recursive‑Harmonic Phenomenon

Autoři: KULIK, DEAN

Foundations of Software Science and Computation Structures : 21st International Conference, FOSSACS 2018, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings

Autoři: Christel Baier Ugo Dal Lago

Resource Type: eBook.

Témata: Computer software--Congresses, Software engineering--Congresses

Categories: COMPUTERS / Computer Science, BUSINESS & ECONOMICS / Careers / General, COMPUTERS / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Architecture, COMPUTERS / Software Development & Engineering / General, MATHEMATICS / Discrete Mathematics

Reducing Path TSP to TSP

Autoři: Traub, Vera Vygen, Jens Zenklusen, Rico

Zdroj: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

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

Přístupová URL adresa: http://arxiv.org/abs/1907.10376
https://arxiv.org/pdf/1907.10376.pdf
https://dl.acm.org/doi/pdf/10.1145/3357713.3384256
https://www.research-collection.ethz.ch/handle/20.500.11850/423466
https://doi.org/10.1145/3357713.3384256
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-10376
https://arxiv.org/abs/1907.10376
https://epubs.siam.org/doi/abs/10.1137/20M135594X