Suchergebnisse - Mathematics of computing Discrete mathematics Graph theory Paths and connectivity problems~

Treffer weiter einschränken
  1. 1

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

    Autoren: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu et al.

    Weitere Verfasser: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu et al.

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

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

    Zugangs-URL: 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

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

    Cut paths and their remainder structure, with applications

    Autoren: Cairo, Massimo Khan, Shahbaz Rizzi, Romeo et al.

    Weitere Verfasser: Cairo, Massimo Khan, Shahbaz Rizzi, Romeo et al.

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

    Zugangs-URL: 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

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

    Distributed Percolation Analysis for Turbulent Flows

    Autoren: Friederici, Anke Köpp, Wiebke Atzori, Marco et al.

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

    Schlagwörter: 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)

    Dateibeschreibung: electronic

    Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-267897
    https://kth.diva-portal.org/smash/get/diva2:1410816/FULLTEXT01.pdf

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

    Efficient Isomorphism for Sd-Graphs and T-Graphs.

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

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

    Schlagwörter: ISOMORPHISM (Mathematics), GRAPH theory, COMPUTATIONAL mathematics, GRAPH connectivity, COMBINATORICS, AUTOMORPHISM groups, INTERSECTION graph theory

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

    Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

    Autoren: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian et al.

    Weitere Verfasser: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian et al.

    Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Data structures, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Fixed-parameter algorithms and complexity, Mathematics - Logic, 0102 computer and information sciences, Theory of computation → Finite Model Theory, 01 natural sciences, Logic in Computer Science (cs.LO), Theory of computation → Fixed parameter tractability, Computational applications of logic, Computer Science - Data Structures and Algorithms, Combinatorics and graph theory, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Logic (math.LO), Graph algorithms, Computer Science - Discrete Mathematics

    Dateibeschreibung: application/pdf

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

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

    Evaluation of Various Topological Indices of Flabellum Graphs.

    Autoren: Shi, Xiaolong Kosari, Saeed Ahmad, Uzma et al.

    Quelle: Mathematics (2227-7390); Oct2023, Vol. 11 Issue 19, p4167, 23p

    Schlagwörter: MOLECULAR connectivity index, MOLECULAR graphs, CHEMICAL properties, COMPUTATIONAL mathematics, GRAPH theory

    Geografische Kategorien: ZAGREB (Croatia)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    A Java Application for Teaching Graphs in Undergraduate Courses.

    Autoren: Migallón, Violeta Penadés, José

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

    Schlagwörter: INFORMATION technology, COMPUTATIONAL mathematics, HIGH school curriculum, HIGH school teachers, COMPUTER engineering, GRAPH algorithms, SOFTWARE engineering

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

    An Enumerative Perspective on Connectivity

    Autoren: Shyan Akmal

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

    Schlagwörter: 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

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

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

    On Landmark Distances in Polygons

    Autoren: Gotsman, C. Hormann, K.

    Quelle: Faculty Publications

    Schlagwörter: CCS Concepts, • Mathematics of computing → Paths and connectivity problems, Graph algorithms, • Theory of computation → Routing and network design problems

    Relation: https://digitalcommons.njit.edu/fac_pubs/3898

    Verfügbarkeit: https://digitalcommons.njit.edu/fac_pubs/3898
    https://doi.org/10.1111/cgf.14373

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

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

    Autoren: 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) et al.

    Weitere Verfasser: 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) et al.

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

    Schlagwörter: 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

    Verfügbarkeit: 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

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  11. 11

    Dynamic Connectivity in Disk Graphs.

    Autoren: Baumann, Alexander Kaplan, Haim Klost, Katharina et al.

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

    Schlagwörter: *DATA structures, *INTERSECTION graph theory, *INVERSE functions

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  12. 12

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

    Autoren: DE LOERA, JESÚUS A. GOAOC, XAVIER MEUNIER, FRÚEDÚERIC et al.

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

    Schlagwörter: GRAPH theory, COMBINATORIAL geometry, MATHEMATICAL optimization, COMPUTATIONAL geometry, COMPUTATIONAL mathematics

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  13. 13

    A complex network perspective on brain disease.

    Autoren: Papo D Buldú JM

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

    Publikationsart: Journal Article

    Info zur Zeitschrift: 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

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  14. 14

    Mobile Network Analysis Using Probabilistic Connectivity Matrices.

    Autoren: Brooks, Richard R. Pillai, Brijesh Racunas, Stephen et al.

    Quelle: 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

    Schlagwörter: GRAPH theory, COMPUTATIONAL mathematics, FREE probability theory, NETWORK analysis (Planning), LINEAR algebra

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  15. 15

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

    Autoren: Tao, Yun Giunta, Valeria Börger, Luca et al.

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

    HTML Volltext PDF-Volltext
    Zu den Favoriten
  16. 16

    2-Edge Connectivity in Directed Graphs

    Autoren: Georgiadis L Italiano G Laura L et al.

    Weitere Verfasser: Georgiadis L Italiano G Laura L et al.

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

    Schlagwörter: 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)

    Dateibeschreibung: application/pdf

    Zugangs-URL: 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

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

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

    Autoren: Komang Dharmawan Ngurah Agus Sanjaya ER

    Resource Type: eBook.

    Schlagworte: Mathematics--Congresses, Computer simulation--Congresses

    Categories: COMPUTERS / Computer Simulation

    PDF-Volltext
    Zu den Favoriten
  18. 18

    Phase Coexistence for the Hard-Core Model on ℤ2.

    Autoren: BLANCA, ANTONIO CHEN, YUXUAN GALVIN, DAVID et al.

    Quelle: Combinatorics, Probability & Computing; Jan2019, Vol. 28 Issue 1, p1-22, 22p

    Schlagwörter: COMPUTATIONAL mathematics, LATTICE gas, STATISTICAL physics, PROBABILITY theory, GRAPH theory

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

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

    Autoren: Asaf Nachmias

    Resource Type: eBook.

    Schlagworte: Random walks (Mathematics)

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

    PDF-Volltext ePub Volltext
    Zu den Favoriten
  20. 20

    Maximal Planar Graph Theory and the Four-Color Conjecture

    Autoren: Jin Xu

    Resource Type: eBook.

    Schlagworte: Graph coloring, Geometry

    Categories: COMPUTERS / Computer Science

    PDF-Volltext ePub Volltext
    Zu den Favoriten

Suchwerkzeuge: