Výsledky vyhľadávania - Mathematics of computing Discrete mathematics Graph theory

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

“… As special cases of this general theorem, we obtain two variants of Lovász' theorem: the result by Dvořák (2010) that characterises equivalence of graphs in the k…”
Získať plný text

The Logic of Graph Neural Networks Autor Grohe, Martin

“…Graph neural networks (GNNs) are deep learning architectures for machine learning problems on graphs…”
Získať plný text

On the Expressive Power of Homomorphism Counts Autor Atserias, Albert, Kolaitis, Phokion G., Wu, Wei-Lin

“…A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left profile, that is, for every graph F, the number of homomorphisms from F to G coincides with the number…”
Získať plný text

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

“…Balanced hypergraph partitioning is a fundamental problem in applications like VLSI design, high-performance computing, etc…”
Získať plný text

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

“… of simple graphs, HyperEF aims at decomposing large hypergraphs into multiple node clusters with only a…”
Získať plný text

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

“… This work presents GRL-DSE, an automatic microarchitecture search framework based on graph embeddings…”
Získať plný text

SGIRR: Sparse Graph Index Remapping for ReRAM Crossbar Operation Unit and Power Optimization Autor Wang, Cheng-Yuan, Chang, Yao-Wen, Chang, Yuan-Hao

“…Resistive Random Access Memory (ReRAM) Crossbars are a promising process-in-memory technology to reduce enormous data movement overheads of large-scale graph processing between computation and memory units…”
Získať plný text

Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs Autor Wang, Pengyu, Li, Chao, Wang, Jing, Wang, Taolei, Zhang, Lu, Leng, Jingwen, Chen, Quan, Guo, Minyi

“…Graph sampling and random walk operations, capturing the structural properties of graphs, are playing an important role today as we cannot directly adopt computing-intensive algorithms on large-scale graphs…”
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…”
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 support for incremental updates…”
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…”
Získať plný text

GPart: A GNN-Enabled Multilevel Graph Partitioner Autor Chen, Magi, Wang, Ting-Chi

“…This paper introduces GPart, a scalable multilevel framework for graph partitioning that integrates GNN embeddings with efficient coarsening and refinement techniques…”
Získať plný text

LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing Autor Zhang, Lingling, Wu, Yijian, Jiang, Hong, Zhou, Ziyu, Lu, Tiancheng

“…Dynamic graph processing systems using conventional array-based architectures face significant throughput limitations due to inefficient memory access and index management…”
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

Consistent Graph Model Generation with Large Language Models Autor Chen, Boqi

“…Graph model generation from natural language requirements is an essential task in software engineering, for which large language models (LLMs…”
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

“…Betweenness centrality (BC) is a shortest path centrality metric used to measure the influence of individual vertices or edges on huge graphs that are used for modeling and analysis of human brain, omics data, or social networks…”
Zistit podrobnosti o prístupe

EMGraph: Fast Learning-Based Electromigration Analysis for Multi-Segment Interconnect Using Graph Convolution Networks Autor Jin, Wentian, Chen, Liang, Sadiqbatcha, Sheriff, Peng, Shaoyi, Tan, Sheldon X.-D.

“… VLSI multisegment interconnect trees can be naturally viewed as graphs. Based on this observation, we propose a new graph convolution network (GCN…”
Získať plný text

A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs Autor Firoz, Jesun Sahariar, Zalewski, Marcin, Lumsdaine, Andrew

“… We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm and compare their performance with 4 different types of standard RMAT graphs and real-world graphs…”
Získať plný text

DS-GL: Advancing Graph Learning via Harnessing Nature's Power within Scalable Dynamical Systems Autor Song, Ruibing, Wu, Chunshu, Liu, Chuan, Li, Ang, Huang, Michael, Geng, Tony Tong

“…With the rapid digitization of the world, an increasing number of real-world applications are turning to non-Euclidean data, modeled as graphs…”
Získať plný text

Automatic Code Generation for High-Performance Graph Algorithms Autor Peng, Zhen, Ashraf, Rizwan A., Guo, Luanzheng, Tian, Ruiqin, Kestor, Gokcen

“…Graph problems are common across many fields, from scientific computing to social sciences…”
Získať plný text