Výsledky vyhľadávania - "Graph algorithm"

Tight bounds on the message complexity of distributed tree verification

Autori: Kutten, Shay Robinson, Peter Tan, Ming Ming a ďalší

Prispievatelia: Kutten, Shay Robinson, Peter Tan, Ming Ming a ďalší

Zdroj: Distributed Computing. 38:113-130

Predmety: FOS: Computer and information sciences, Distributed Graph Algorithm, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Lower Bound, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2401.11991
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

Exponential speedup over locality in MPC with optimal memory

Autori: Balliu, Alkida Brandt, Sebastian Fischer, Manuela a ďalší

Prispievatelia: Balliu, Alkida Brandt, Sebastian Fischer, Manuela a ďalší

Zdroj: Distributed Computing
Leibniz International Proceedings in Informatics (LIPIcs), 246
36th International Symposium on Distributed Computing (DISC 2022)

Predmety: FOS: Computer and information sciences, Distributed computing, Locally checkable labeling problems, Trees, Massively Parallel Computation, Sublinear memory, Graph algorithm, 0102 computer and information sciences, 02 engineering and technology, Massively parallel computation, Locally checkable labeling, Forest, 01 natural sciences, 7. Clean energy, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

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

Prístupová URL adresa: http://arxiv.org/abs/2208.09453
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.9
http://hdl.handle.net/20.500.11850/725623
http://hdl.handle.net/20.500.11850/579754
https://aaltodoc.aalto.fi/handle/123456789/118036

When is String Reconstruction using de Bruijn Graphs Hard?

Autori: Bals, Ben van Krieken, Sebastiaan Pissis, Solon P. a ďalší

Prispievatelia: Bals, Ben van Krieken, Sebastiaan Pissis, Solon P. a ďalší

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, graph algorithm, Data Structures and Algorithms (cs.DS), ddc:004, string algorithm, Eulerian trail, de Bruijn graph

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2508.03433
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.53

On String and Graph Sanitization

Autori: Bernardini G. Chen H. Loukides G. a ďalší

Prispievatelia: Bernardini G. Chen H. Loukides G. a ďalší

Zdroj: Bernardini, G, Chen, H, Loukides, G & Pissis, S P 2025, 'On String and Graph Sanitization', OpenAccess Series in Informatics, vol. 132, pp. 9:1-9:10. https://doi.org/10.4230/OASIcs.Grossi.9

Predmety: graph algorithms, data privacy, data sanitization, graph algorithm, string algorithm, ddc:004, string algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://hdl.handle.net/1871.1/9eb0c27e-ee74-44a9-945b-f01384060438
https://doi.org/10.4230/OASIcs.Grossi.9
https://research.vu.nl/en/publications/9eb0c27e-ee74-44a9-945b-f01384060438
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Grossi.9
https://kclpure.kcl.ac.uk/ws/files/353845480/OASIcs.Grossi.9.pdf

Shortest Undirected Paths in de Bruijn Graphs

Autori: Zuba, Wiktor Lachish, Oded Pissis, Solon P. a ďalší

Prispievatelia: Zuba, Wiktor Lachish, Oded Pissis, Solon P. a ďalší

Predmety: graph algorithm, ddc:004, string algorithm, Eulerian graph, de Bruijn graph

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.12

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

Autori: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu a ďalší

Prispievatelia: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu a ďalší

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

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

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

Coloring Reconfiguration Under Color Swapping

Autori: Fuchs, Janosch Saito, Rin Suga, Tatsuhiro a ďalší

Prispievatelia: Fuchs, Janosch Saito, Rin Suga, Tatsuhiro a ďalší

Predmety: Combinatorial reconfiguration, graph coloring, PSPACE-complete, graph algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.33

Dostupnosť: https://doi.org/10.4230/LIPIcs.ISAAC.2025.33
https://nbn-resolving.org/urn:nbn:de:0030-drops-249411
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.33

Visibility Graph with Circles Path Planner

Autori: Artur Silva

Predmety: Data structures and algorithms, Path planning, Visibility Graph algorithm, RoboCup soccer, Small Size League, algorithim

Relation: https://figshare.com/articles/conference_contribution/Visibility_Graph_with_Circles_Path_Planner/29438276

Dostupnosť: https://doi.org/10.6084/m9.figshare.29438276.v1
https://figshare.com/articles/conference_contribution/Visibility_Graph_with_Circles_Path_Planner/29438276

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring

Autori: El-Hayek, Antoine Hanauer, Kathrin Henzinger, Monika a ďalší

Prispievatelia: El-Hayek, Antoine Hanauer, Kathrin Henzinger, Monika a ďalší

Predmety: dynamic algorithm, graph algorithm, matching, b-matching, edge coloring

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 330, 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.4

Dostupnosť: https://doi.org/10.4230/LIPIcs.SAND.2025.4
https://nbn-resolving.org/urn:nbn:de:0030-drops-230571
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.4

Early detection of Parkinson’s disease through enriching the electronic health record using a biomedical knowledge graph

Autori: Soman, Karthik Nelson, Charlotte A Cerono, Gabriel a ďalší

Predmety: Health Services and Systems, Health Sciences, Networking and Information Technology R&D (NITRD), Parkinson's Disease, Neurodegenerative, Neurosciences, Brain Disorders, Aging, Clinical Research, 4.1 Discovery and preclinical testing of markers and technologies, Detection, screening and diagnosis, Neurological, Good Health and Well Being, Parkinson disease, neurodegenerative disorder, electronic health record, knowledge graph, graph algorithm, machine learning, Biomedical and clinical sciences, Health sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/0cp563pp
https://escholarship.org/content/qt0cp563pp/qt0cp563pp.pdf

Finding the k Shortest Simple Paths: Time and Space Trade-offs

Autori: Ali Al Zoobi David Coudert Nicolas Nisse a ďalší

Prispievatelia: Ali Al Zoobi David Coudert Nicolas Nisse a ďalší

Zdroj: ACM Journal of Experimental Algorithmics. 28:1-23

Predmety: space-time trade-off, graph algorithm, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], k shortest simple paths, [INFO] Computer Science [cs], [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-03196830v2/document
https://hal.science/hal-03196830v2
https://doi.org/10.1145/3626567

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory: On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory

Autori: Dániel Gerbner Balázs Keszegh Dániel Lenger a ďalší

Zdroj: Discrete Applied Mathematics

Predmety: Extremal problems in graph theory, QA Mathematics / matematika, query, 05C35, 90B40, Turán number, 0102 computer and information sciences, 01 natural sciences, search theory, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, graph algorithm, FOS: Mathematics, Mathematics - Combinatorics, game, subgraph, Combinatorics (math.CO), Searching and sorting

Popis súboru: application/xml; text

Prístupová URL adresa: http://arxiv.org/abs/2210.04712
https://zbmath.org/7764556
https://doi.org/10.1016/j.dam.2023.08.012

Cyclic Action Graphs for goal recognition problems with inaccurately initialised fluents

Autori: Helen Harman Pieter Simoens

Zdroj: KNOWLEDGE AND INFORMATION SYSTEMS

Predmety: Goal recognition, Context aware, context aware, Technology and Engineering, Graph algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Inferring intent, I400 - Artificial intelligence, 0202 electrical engineering, electronic engineering, information engineering, intention prediction, PLAN RECOGNITION, ASSISTANCE, goal recognition, Cyclic graph

Popis súboru: application/pdf

Prístupová URL adresa: https://biblio.ugent.be/publication/01HEJ3K1VC0369Y91F5KBT2RMY/file/01HN09W094EHVHF19CSR1GG16F
http://hdl.handle.net/1854/LU-01HEJ3K1VC0369Y91F5KBT2RMY
http://doi.org/10.1007/s10115-023-01976-6
https://biblio.ugent.be/publication/01HEJ3K1VC0369Y91F5KBT2RMY

Speeding Up Floyd–Warshall’s Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph

Autori: Giuseppe Lancia Marcello Dalpasso

Zdroj: Algorithms, Vol 18, Iss 9, p 560 (2025)

Predmety: Floyd–Warshall graph algorithm, all-pairs shortest paths, transitive closure, SmartForce technique, FastSet data structure, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Popis súboru: electronic resource

Relation: https://www.mdpi.com/1999-4893/18/9/560; https://doaj.org/toc/1999-4893

Prístupová URL adresa: https://doaj.org/article/bade35a06ea743f287002cdc037223e3

Efficient Direct Reconstruction of Bipartite (Multi)Graphs from Their Line Graphs Through a Characterization of Their Edges

Autori: Drago Bokal Janja Jerebic

Zdroj: Mathematics, Vol 13, Iss 17, p 2876 (2025)

Predmety: UNO-graph, line graph, bipartite graph, bipartite multigraph, graph algorithm, Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://www.mdpi.com/2227-7390/13/17/2876; https://doaj.org/toc/2227-7390

Prístupová URL adresa: https://doaj.org/article/807c01aed1fb4985b74fedc99472cbc0

Identifying Influential Nodes Based on Evidence Theory in Complex Network

Autori: Fu Tan Xiaolong Chen Rui Chen a ďalší

Zdroj: Entropy ; Volume 27 ; Issue 4 ; Pages: 406

Predmety: complex network, influential node identification, multi-attribute features, Dempster–Shafer evidence theory, visibility graph algorithm

Popis súboru: application/pdf

Relation: Complexity; https://dx.doi.org/10.3390/e27040406

Dostupnosť: https://doi.org/10.3390/e27040406

Efficient Graph-Based Multi-Story Path Planning with Optimized Elevator Selection for Indoor Delivery Robots

Autori: Seungmin Kim Hyunseo Jang Jiseung Ha a ďalší

Zdroj: Electronics ; Volume 14 ; Issue 5 ; Pages: 982

Predmety: indoor robotics, path planning, multi-story building, graph algorithm, delivery robot, hierarchical algorithms, multi-floor navigation

Popis súboru: application/pdf

Relation: https://dx.doi.org/10.3390/electronics14050982

Dostupnosť: https://doi.org/10.3390/electronics14050982

Analysis of Aftershocks from California and Synthetic Series by Using Visibility Graph Algorithm

Autori: Alejandro Muñoz-Diosdado Ana María Aguilar-Molina Eric Eduardo Solis-Montufar a ďalší

Zdroj: Entropy ; Volume 27 ; Issue 2 ; Pages: 178

Predmety: seismicity series, seismicity from California, spring-block model, visibility graph algorithm, complex networks

Popis súboru: application/pdf

Relation: Complexity; https://dx.doi.org/10.3390/e27020178

Dostupnosť: https://doi.org/10.3390/e27020178

Connecting de Bruijn Graphs

Autori: Bernardini, Giulia Chen, Huiping Gørtz, Inge Li a ďalší

Prispievatelia: Bernardini, Giulia Chen, Huiping Gørtz, Inge Li a ďalší

Zdroj: Bernardini, G, Chen, H, Gørtz, I L, Krogh, C, Loukides, G, Pissis, S P, Stougie, L & Sweering, M 2024, ' Connecting de Bruijn Graphs ', Leibniz International Proceedings in Informatics, LIPIcs, vol. 296, pp. 6:1-6:16 . https://doi.org/10.4230/LIPIcs.CPM.2024.6

Predmety: graph algorithm, Graph algorithm, string algorithm, de Bruijn graph, Eulerian graph, ddc:004, Pattern matching, String algorithm, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis súboru: application/pdf

Prístupová URL adresa: https://hdl.handle.net/11368/3079058
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.6
https://orbit.dtu.dk/en/publications/a55049c6-ecd5-4457-ada2-f10d462e4809
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.6

Mixed Integer Linear Programming Framework for SAT Variants of the Connected Flow Problem ; Modélisations par Programmation Linéaire en Nombres Entiers pour des Variantes SAT du Problème de Flot connexe

Autori: Epain, Victor Thuillier, Kerian Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB) a ďalší

Prispievatelia: Epain, Victor Thuillier, Kerian Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB) a ďalší

Zdroj: https://hal.science/hal-05133695 ; 2025.

Predmety: Discrete global combinatoric optimization problem, Graph algorithm, Exploration tree, Problème d'optimisation combinatoire globale discrete, Algorithmique des graphes, Arbre d'exploration, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://hal.science/hal-05133695
https://hal.science/hal-05133695v1/document
https://hal.science/hal-05133695v1/file/main.pdf