Finding Important Nodes in Chordal Graphs

Identifying important nodes in networked systems is crucial for network analysis and many other applications. Different metrics have been used to assess the node importance within a network, generally as a property to be fulfilled by the node deletion. In this work, we consider as important nodes th...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Control, Decision and Information Technologies (Online) pp. 1448 - 1452
Main Authors Lalou, Mohammed, Kheddoucl, Hamamache
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2024
Subjects
Information technology
Measurement
Network analyzers
Partitioning algorithms
Online AccessGet full text

Cover

More Information
Summary:Identifying important nodes in networked systems is crucial for network analysis and many other applications. Different metrics have been used to assess the node importance within a network, generally as a property to be fulfilled by the node deletion. In this work, we consider as important nodes those whose deletion partitions the network into connected components of a given size. Given the graph G representing the network, we look for the smallest subset of nodes whose removal partition G into components of at most κ nodes, where κ is a given bound. This problem has already been shown to be NP-complete even when restricted to particular classes of graphs, which is the case for general chordal graphs. In this paper, we develop a polynomial-time algorithm to solve it on chordal graphs with maximum node degree Δ = 3. The proposed algorithm returns an exact solution in O(n 2 ) for a graph G of n nodes.
ISSN:2576-3555
DOI:10.1109/CoDIT62066.2024.10708414