Suchergebnisse - graph algorithms in ((informatics OR information) OR informatika)

Unlocking the Potential: Performance Portability of Graph Algorithms on Kokkos Framework

Autoren: Arifuzzaman, Shaikh Arikan, Hasan S Faysal, MAM et al.

Schlagwörter: Distributed Computing and Systems Software, Information and Computing Sciences, Networking and Information Technology R&D (NITRD), Terms Graph algorithms, performance, portability, linear algebra, large graphs, sparse graphs, GPU

Zugangs-URL: https://escholarship.org/uc/item/5xp4g4js

Anomaly Detection in Electronic Health Records Across Hospital Networks: Integrating Machine Learning With Graph Algorithms

Autoren: Haoran Niu Olufemi A. Omitaomu Michael A. Langston et al.

Quelle: IEEE Journal of Biomedical and Health Informatics. 29:3723-3735

Schlagwörter: Machine Learning, Electronic Health Records, Humans, Algorithms, Hospitals, Medical Informatics

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/40030967

Anytime and Distributed Approaches for Graph Matching

Autoren: Abu-Aisheh, Zeina

Quelle: ELCVIA: electronic letters on computer vision and image analysis; Vol. 15, Núm. 2 (2016); p. 13-15

Schlagwörter: Pattern Recognition, Graph Matching, Graph Edit Distance, Branch-and-Bound, Distributed and Parallel Systems, Load Balancing, Performance Evaluation Metrics, Anytime Graph Matching, Anytime Algorithms.

Dateibeschreibung: application/pdf

Relation: https://www.raco.cat/index.php/ELCVIA/article/view/314858/405012; https://www.raco.cat/index.php/ELCVIA/article/downloadSuppFile/314858/2043

Zugangs-URL: https://www.raco.cat/index.php/ELCVIA/article/view/314858

ERNIE-UIE: Advancing information extraction in Chinese medical knowledge graph.

Autoren: Li, Bei Li, Changbiao Sun, Jianwei et al.

Quelle: PLoS ONE; 5/29/2025, Vol. 20 Issue 5, p1-21, 21p

Schlagwörter: KNOWLEDGE graphs, LANGUAGE models, KNOWLEDGE representation (Information theory), DATA mining, GRAPH algorithms

Accelerating Subgraph Matching Through Advanced Compression and Label Filtering.

Autoren: Chai, Yanfeng Li, Jiashu Zhang, Qiang

Quelle: Algorithms; Sep2025, Vol. 18 Issue 9, p541, 17p

Schlagwörter: GRAPH algorithms, DATA compression, NP-complete problems, QUERY (Information retrieval system)

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure: XNLP-completeness for parameterized problems on graphs with a linear structure

Autoren: Bodlaender, Hans L. Groenland, Carla Jacob, Hugo et al.

Weitere Verfasser: Bodlaender, Hans L. Groenland, Carla Jacob, Hugo et al.

Quelle: Leibniz International Proceedings in Informatics
8:1-8:18
Algorithmica
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
IPEC

Schlagwörter: bandwidth, FOS: Computer and information sciences, XP space requirement, Parameterized complexity, tractability and kernelization, Pathwidth, Linear clique-width, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, 7. Clean energy, Bandwidth, Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), linear mim-width, parameterized complexity, pathwidth, Parameterized complexity, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), XNLP, linear width measures, hardness proofs, ddc:004, W-hierarchy, Linear mim-width, Software, linear clique-width

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://arxiv.org/abs/2201.13119
https://research-portal.uu.nl/en/publications/df89aedd-7a2e-4055-938c-d21b56bced16
https://doi.org/10.1007/s00453-024-01274-9
https://hdl.handle.net/11250/3041006
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.8
https://dspace.library.uu.nl/handle/1874/425595
https://hdl.handle.net/11250/3170553

Enhancing cybersecurity through autonomous knowledge graph construction by integrating heterogeneous data sources.

Autoren: Alharbi, Hatoon Hur, Ali Alkahtani, Hasan et al.

Quelle: PeerJ Computer Science; Apr2025, p1-46, 46p

Schlagwörter: KNOWLEDGE graphs, DATA integration, ELECTRONIC data processing, GRAPH algorithms, NATURAL language processing, KNOWLEDGE representation (Information theory), CYBERTERRORISM, INTERNET security

Graph-Structured Network Traffic Modelling for Anomaly-Based Intrusion Detection

Autoren: Baskoro Adi Pratomo Muhammad Farhan Haykal Hudan Studiawan et al.

Quelle: Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI), Vol 14, Iss 2 (2025)

Schlagwörter: Graph Algorithms, Anomaly Detection, intrusion detection, Network, Information technology, T58.5-58.64

Dateibeschreibung: electronic resource

Relation: https://ejournal.undiksha.ac.id/index.php/janapati/article/view/94959; https://doaj.org/toc/2089-8673; https://doaj.org/toc/2548-4265

Zugangs-URL: https://doaj.org/article/0557d26060a5495183f4e2747d55f937

Negative-Weight Single-Source Shortest Paths in Near-linear Time.

Autoren: Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian

Quelle: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Schlagwörter: GRAPH algorithms, ALGORITHMS, GRAPH theory, COMPUTATIONAL complexity

Intelligent fault diagnosis of rotor system based on Visibility Graph algorithm and Graph Transformer.

Autoren: Yue, Lei Han, Shiqian Wang, Jun

Quelle: Engineering Computations; 2025, Vol. 42 Issue 9, p3294-3316, 23p

Schlagwörter: FAULT diagnosis, ROTORS, MACHINE learning, TRANSFORMER models, VIBRATION tests, GRAPH algorithms

Algorithms for graph theory matching problems based on computer science.

Autoren: Jin, Jingjing

Quelle: International Journal of Modern Physics C: Computational Physics & Physical Computation; Aug2025, Vol. 36 Issue 8, p1-19, 19p

Schlagwörter: PARTICLE swarm optimization, GRAPH theory, MATCHING theory, COMPUTER science, REPRESENTATIONS of graphs, GRAPH algorithms

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs

Autoren: Jannick Borowitz Ernestine Großmann Christian Schulz et al.

Quelle: Journal of Graph Algorithms and Applications. 29:159-186

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

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

Practical and Accurate Local Edge Differentially Private Graph Algorithms

Autoren: Mundra, Pranay Papamanthou, Charalampos Shun, Julian et al.

Quelle: Proceedings of the VLDB Endowment. 18:4199-4213

Schlagwörter: FOS: Computer and information sciences, Databases, Data Structures and Algorithms, Cryptography and Security, Data Structures and Algorithms (cs.DS), Databases (cs.DB), Cryptography and Security (cs.CR)

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

基于高阶邻域信息交互的自监督异质图嵌入算法.

Alternate Title: Self-supervised heterogeneous graph embedding algorithm based on higher-order neighborhood information interaction.

Autoren: 董家浩 武永亮 王志强 et al.

Quelle: Application Research of Computers / Jisuanji Yingyong Yanjiu. Jul2025, Vol. 42 Issue 7, p2011-2017. 7p.

Schlagwörter: *GRAPH algorithms, *LEARNING modules, *NEIGHBORHOODS, *ALGORITHMS, *CLASSIFICATION

A Census of Graph-Drawing Algorithms Based on Generalized Transversal Structures

Autoren: Olivier Bernardi Eric Fusy Shizhe Liang

Quelle: Journal of Graph Algorithms and Applications. 29:187-246

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Combinatorics (math.CO)

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

The lattice of cycles of an undirected graph

Autoren: Averkov, G Chavez, A De Loera, JA et al.

Schlagwörter: Applied Mathematics, Pure Mathematics, Mathematical Sciences, Undirected graphs, Graph cycles, Cycle lattice, Lattice basis, Linear hull, Abelian group, Graph algorithms, Algorithmic complexity, Information and Computing Sciences, Engineering, Numerical & Computational Mathematics, Mathematical sciences

Zugangs-URL: https://escholarship.org/uc/item/20f776vg

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

Autoren: Azad, Ariful Aznaveh, Mohsen Mahmoudi Beamer, Scott et al.

Schlagwörter: Information and Computing Sciences, Software Engineering, Networking and Information Technology R&D (NITRD), graph algorithms, benchmarking

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/4vc7g1zc
https://escholarship.org/content/qt4vc7g1zc/qt4vc7g1zc.pdf

Generating random graphs with prescribed graphlet frequency bounds derived from probabilistic networks.

Autoren: Mornie, Bram Colle, Didier Audenaert, Pieter et al.

Quelle: PLoS ONE; 8/26/2025, Vol. 20 Issue 8, p1-22, 22p

Schlagwörter: RANDOM graphs, GRAPH algorithms, BIOINFORMATICS, STOCHASTIC models

Biclique: an R package for maximal biclique enumeration in bipartite graphs

Autoren: Lu, Yuping Phillips, Charles A Langston, Michael A

Quelle: BMC Research Notes. 13(1)

Schlagwörter: 32 Biomedical and Clinical Sciences (for-2020), Networking and Information Technology R&D (NITRD) (rcdc), Algorithms (mesh), Software (mesh), Time Factors (mesh), Algorithms (mesh), Time Factors (mesh), Software (mesh), Biclique, Bipartite graph, Graph algorithms, Maximality, R package, Algorithms (mesh), Software (mesh), Time Factors (mesh), 0601 Biochemistry and Cell Biology (for), 1199 Other Medical and Health Sciences (for), Bioinformatics (science-metrix), 32 Biomedical and clinical sciences (for-2020)

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/0sr6j9wk
https://escholarship.org/content/qt0sr6j9wk/qt0sr6j9wk.pdf

Flow-augmentation I: Directed graphs.

Autoren: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Quelle: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-38, 38p

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs