Suchergebnisse - "Graph algorithms"

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond von Chuzhoy, Julia, Gao, Yu, Li, Jason, Nanongkai, Danupon, Peng, Richard, Saranurak, Thatchaphol

“… We consider the classical Minimum Balanced Cut problem: given a graph G , compute a partition of its vertices into two subsets of roughly equal volume, while …”
Volltext

Incremental k-core decomposition: algorithms and evaluation von Sarıyüce, Ahmet Erdem, Gedik, Buğra, Jacques-Silva, Gabriela, Wu, Kun-Lung, Çatalyürek, Ümit V.

“… A k -core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k -core decomposition is often …”
Volltext

PIMGCN: A ReRAM-Based PIM Design for Graph Convolutional Network Acceleration von 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 …”
Volltext

iG-kway: Incremental k-way Graph Partitioning on GPU von 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 …”
Volltext

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

“… Balanced hypergraph partitioning is a fundamental problem in applications like VLSI design, high-performance computing, etc. Nowadays, large-scale hypergraphs …”
Volltext

LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing von 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 …”
Volltext

GPart: A GNN-Enabled Multilevel Graph Partitioner von 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 …”
Volltext

Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs von 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 …”
Volltext

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

“… Electromigration (EM) becomes a major concern for VLSI circuits as the technology advances in the nanometer regime. With Korhonen equations, EM assessment for …”
Volltext

Automated building layout generation using deep learning and graph algorithms von Wang, Lufeng, Liu, Jiepeng, Zeng, Yan, Cheng, Guozhong, Hu, Huifeng, Hu, Jiahao, Huang, Xuesi

“… Designing architectural layouts is a complex task that has garnered significant attention in the research community. While automated site layout design and …”
Volltext

Graph-Structured Network Traffic Modelling for Anomaly-Based Intrusion Detection von Pratomo, Baskoro Adi, Haykal, Muhammad Farhan, Studiawan, Hudan, Purwitasari, Diana

“… The increasing complexity of cyber threats demands more advanced network intrusion detection systems (NIDS) capable of identifying both known and emerging …”
Volltext

Smaller kernels for 3-leaf power modifications problems von Tsur, Dekel

“… A graph G is a 3-leaf power if there is a tree T and a bijective mapping f from V(G) to the set of leaves of T such that (u,v)∈E(G) if and only if the distance …”
Volltext

Approximate distance oracles with improved stretch for sparse graphs von Roditty, Liam, Tov, Roei

“… Thorup and Zwick [1] introduced the notion of approximate distance oracles, a data structure that produces for an n-vertex, m-edge weighted undirected graph …”
Volltext

DS-GL: Advancing Graph Learning via Harnessing Nature's Power within Scalable Dynamical Systems von 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. Due to their …”
Volltext

Towards scaling community detection on distributed-memory heterogeneous systems von Gawande, Nitin, Ghosh, Sayan, Halappanavar, Mahantesh, Tumeo, Antonino, Kalyanaraman, Ananth

“… In most real-world networks, nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters such that nodes within a community …”
Volltext

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction von Gui, Chuangyi, Liao, Xiaofei, Zheng, Long, Yao, Pengcheng, Wang, Qinggang, Jin, Hai

“… Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem …”
Volltext

Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs von Jamour, Fuad, Skiadopoulos, Spiros, Kalnis, Panos

“… Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification …”
Volltext

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices von Bonomo, Flavia, Chudnovsky, Maria, Maceli, Peter, Schaudt, Oliver, Stein, Maya, Zhong, Mingxian

“… In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This …”
Volltext

BabelNet: The automatic construction, evaluation and application of a wide-coverage multilingual semantic network von Navigli, Roberto, Ponzetto, Simone Paolo

“… We present an automatic approach to the construction of BabelNet, a very large, wide-coverage multilingual semantic network. Key to our approach is the …”
Volltext

A review on algorithms for maximum clique problems von Wu, Qinghua, Hao, Jin-Kao

“… •We provide an updated review of exact and heuristic algorithms for maximum clique problems.•We classify the search strategies and put forward the key …”
Volltext