A Polynomial Algorithm for Weighted Toughness of Interval Graphs

A Polynomial Algorithm for Weighted Toughness of Interval Graphs

The concept of toughness, introduced by Chva´tal, has been widely used as an important invulnerability parameter. This parameter is generalized to weighted graphs, and the concept of weighted toughness is proposed. A polynomial algorithm for computing the weighted toughness of interval graphs is giv...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematics (Hidawi) 2021, Vol.2021, p.1-5
Hauptverfasser: Shi, Ming, Wei, Zongtian
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Graphs
Mathematics
Parameters
Polynomials
Toughness
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The concept of toughness, introduced by Chva´tal, has been widely used as an important invulnerability parameter. This parameter is generalized to weighted graphs, and the concept of weighted toughness is proposed. A polynomial algorithm for computing the weighted toughness of interval graphs is given.
ISSN:2314-4629
2314-4785
DOI:10.1155/2021/6657594