Dongxiao Yu
Biographic Data
| ID | 8285333 |
|---|---|
| NAME | Dongxiao Yu |
| GIVEN NAMES | Dongxiao |
| FAMILY NAME | Yu |
| SIGNATURE | YU D |
| AFFILIATIONS | Shandong University |
| ORCID | 0000-0001-6835-5981 |
| VERIFIED | Yes |
| TOTAL WORKS | 3 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 3 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2020 |
| LATEST PUBLICATION YEAR | 2023 |
| H-INDEX | 0 |
Influence blocking maximization under refutation
Fast Core Maintenance in Dynamic Graphs
This article studies the core maintenance problem in dynamic graphs. The core number is a fundamental index reflecting the cohesiveness of a graph, which is widely used in large-scale graph analytics. The core maintenance problem requires updating the core numbers of vertices after a set of edges and vertices are inserted into or deleted from the graph. Previous works focus on the scenario of single-edge updates and process the edges one by one w…
Batch Processing for Truss Maintenance in Large Dynamic Graphs
This article studies the batch processing of truss maintenance in large graphs. Trussness is a widely used index in graph analytics for cohesive subgraph mining. It is defined on edges to reflect the closeness of vertices connected by the edges. The trussness maintenance problem, i.e., updating trussness after edge insertions/deletions and avoiding recomputation, was proposed by Cohen (2008) with the assumption that real graphs are continuously e…
No prominent works on this page.
Batch Processing for Truss Maintenance in Large Dynamic Graphs
This article studies the batch processing of truss maintenance in large graphs. Trussness is a widely used index in graph analytics for cohesive subgraph mining. It is defined on edges to reflect the closeness of vertices connected by the edges. The trussness maintenance problem, i.e., updating trussness after edge insertions/deletions and avoiding recomputation, was proposed by Cohen (2008) with the assumption that real graphs are continuously e…
Fast Core Maintenance in Dynamic Graphs
This article studies the core maintenance problem in dynamic graphs. The core number is a fundamental index reflecting the cohesiveness of a graph, which is widely used in large-scale graph analytics. The core maintenance problem requires updating the core numbers of vertices after a set of edges and vertices are inserted into or deleted from the graph. Previous works focus on the scenario of single-edge updates and process the edges one by one w…
Influence blocking maximization under refutation
Algorithm (3 works) · Complex Network Analysis Techniques (3 works) · Computer Science (3 works) · Artificial Intelligence (2 works) · Enhanced Data Rates for GSM Evolution (2 works) · Graph (2 works) · Mathematics (2 works) · Scalability (2 works) · Theoretical Computer Science (2 works) · Advanced Graph Neural Networks (1 works)