Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs

Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs

The k-core, a kind of structure of graphs, is a maximal connected subgraph with the minimum degree greater than or equal to k, and has been used in many fields. The maximum k such that a k-core contains u is the K value of u. Especially, for an edge-weighted graph, the degree of a vertex is the sum...

Full description

Bibliographic Details
Main Authors: Bin Liu, Feiteng Zhang
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-core
edge-weighted graph
core maintenance algorithm
hierarchical process
Online Access:https://ieeexplore.ieee.org/document/9055356/

Internet

https://ieeexplore.ieee.org/document/9055356/

Similar Items