2021
DOI: 10.1109/tkde.2021.3094549
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Top-k Vulnerable Nodes Detection in Uncertain Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(1 citation statement)
references
References 46 publications
0
1
0
Order By: Relevance
“…A graph [12][13] is usually used to represent the relationship between objects and objects, and it is an object with a wide range of meanings. In mathematics, a graph is composed of vertices (Vertex) and edges connecting the vertices, which can be written as G = (V, E), where V represents the set of vertices and E represents the set of edges.…”
Section: Graph Neural Networkmentioning
confidence: 99%
“…A graph [12][13] is usually used to represent the relationship between objects and objects, and it is an object with a wide range of meanings. In mathematics, a graph is composed of vertices (Vertex) and edges connecting the vertices, which can be written as G = (V, E), where V represents the set of vertices and E represents the set of edges.…”
Section: Graph Neural Networkmentioning
confidence: 99%