Výsledky vyhľadávania - Mathematics of computing-Graph algorithms

Metro Maps on Octilinear Grid Graphs Autor Bast, Hannah, Brosi, Patrick, Storandt, Sabine

“…Schematic transit maps (often called “metro maps” in the literature) are important to produce comprehensible visualizations of complex public transit networks…”
Získať plný text

GraphCoder: Enhancing Repository-Level Code Completion via Coarse-to-fine Retrieval Based on Code Context Graph Autor Liu, Wei, Yu, Ailun, Zan, Daoguang, Shen, Bo, Zhang, Wei, Zhao, Haiyan, Jin, Zhi, Wang, Qianxiang

“…The performance of repository-level code completion depends upon the effective leverage of both general and repository-specific knowledge. Despite the…”
Získať plný text

Target set selection with maximum activation time Autor Keiler, Lucas, Lima, Carlos V.G.C., Maia, Ana Karolinna, Sampaio, Rudini, Sau, Ignasi

“…A target set selection model is a graph G with a threshold function τ : V → N upper-bounded by the vertex degree. For a given model, a set S0 ⊆ V (G) is a…”
Získať plný text

General Variable Neighborhood Search for computing graph separators Autor Sánchez-Oro, Jesús, Mladenović, Nenad, Duarte, Abraham

“…Computing graph separators in networks has a wide range of real-world applications…”
Získať plný text

PyGTED: Python Application for Computing Graph Traversal Edit Distance Autor Ebrahimpour Boroojeny, Ali, Shrestha, Akash, Sharifi-Zarchi, Ali, Gallagher, Suzanne Renick, Sahinalp, Süleyman Cenk, Chitsaz, Hamidreza

“… The kernel paradigm beautifully decouples the learning algorithm from the underlying geometric space, which renders graph kernels important for the aforementioned applications…”
Zistit podrobnosti o prístupe

The Logic of Graph Neural Networks Autor Grohe, Martin

“… It has recently been shown that the expressiveness of GNNs can be characterised precisely by the combinatorial Weisfeiler-Leman algorithms and by finite variable counting logics…”
Získať plný text

Lovász-Type Theorems and Game Comonads Autor Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“…Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the…”
Získať plný text

When Dimensionality Reduction Meets Graph (Drawing) Theory: Introducing a Common Framework, Challenges and Opportunities Autor Paulovich, F. V., Arleo, A., van den Elzen, S.

“…In the vast landscape of visualization research, Dimensionality Reduction (DR) and graph analysis are two popular subfields, often essential to most visual…”
Získať plný text

Local Higher-Order Graph Clustering Autor Yin, Hao, Benson, Austin R, Leskovec, Jure, Gleich, David F

“…Local graph clustering methods aim to find a cluster of nodes by exploring a small region of the graph. These methods are attractive because they enable…”
Zistit podrobnosti o prístupe

Graph Representation Learning for Microarchitecture Design Space Exploration Autor Yi, Xiaoling, Lu, Jialin, Xiong, Xiankui, Xu, Dong, Shang, Li, Yang, Fan

“…Design optimization of modern microprocessors is a complex task due to the exponential growth of the design space. This work presents GRL-DSE, an automatic…”
Získať plný text

Clone detection in automotive model-based development Autor Deissenboeck, F., Hummel, B., Jurgens, E., Schatz, B., Wagner, S., Girard, J.-F., Teuchert, S.

“…Model-based development is becoming an increasingly common development methodology. In important domains like embedded systems already major parts of the code…”
Získať plný text

GraphFI: An Efficient Fault Injection Framework for Graph Processing on GPGPUs Autor Jiang, Nan, Yue, Hengshan, Tan, Jingweijia, Zhou, Mengting, Wang, Xiaonan, Wang, Yuchun, Wei, Wenda, Qiu, Meikang, Wei, Xiaohui

“…As graph tasks become pervasive in real-time and safetycritical domains (e.g., financial fraud detection and electrical power systems), it is also essential to…”
Získať plný text

PIMGCN: A ReRAM-Based PIM Design for Graph Convolutional Network Acceleration Autor Yang, Tao, Li, Dongyue, Han, Yibo, Zhao, Yilong, Liu, Fangxin, Liang, Xiaoyao, He, Zhezhi, Jiang, Li

“…Graph Convolutional Network (GCN) is a promising but computing- and memory-intensive learning model. Processing-in-memory (PIM) architecture based on the ReRAM…”
Získať plný text

TurboBC: A Memory Efficient and Scalable GPU Based Betweenness Centrality Algorithm in the Language of Linear Algebra Autor Artiles, Oswaldo, Saeed, Fahad

“… The application of the BC algorithm to modern graphs must deal with the size of the graphs, as well with highly irregular data-access patterns…”
Zistit podrobnosti o prístupe

Re-imaginig the Networks: Detecting Local Communities in Networks by Approximating Derivatives in Graph Space Autor Rigi, M. Amin, Moser, Irene, Rigi, Seddigh, Liu, Chengfei

“…Finding communities in networks has become very important because various social and physical complex systems are represented as networks. Because of their…”
Získať plný text

Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers Autor Klavžar, Sandi, Vesel, Aleksander

“…Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer-based approach for searching graph invariants on rotagraphs is…”
Získať plný text

iG-kway: Incremental k-way Graph Partitioning on GPU Autor Lee, Wan Luan, Jiang, Shui, Lin, Dian-Lun, Chang, Che, Zhang, Boyang, Chung, Yi-Hua, Schlichtmann, Ulf, Ho, Tsung-Yi, Huang, Tsung-Wei

“…Recent advances in GPU-accelerated graph partitioning have achieved significant performance gains but remain limited to full graph partitioning, lacking…”
Získať plný text

A Scalable and Robust Compilation Framework for Emitter-Photonic Graph State Autor Ren, Xiangyu, Huang, Yuexun, Liang, Zhiding, Barbalace, Antonio

“…Quantum graph states are critical resources for various quantum algorithms, and also determine essential interconnections in distributed quantum computing…”
Získať plný text

HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering Autor Aghdaei, Ali, Feng, Zhuo

“… few inter-cluster hyperedges. The key component in HyperEF is a nearly-linear time algorithm for estimating hyperedge effective resistances, which allows incorporating the latest diffusion-based non-linear quadratic operators defined on hypergraphs…”
Získať plný text

BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning Autor Tong, Shengbo, Pei, Chunyan, Yu, Wenjian

“… Thus, fast and high-quality deterministic partitioning algorithms are largely in demand…”
Získať plný text