The weighted integrity problem is polynomial for interval graphs

MaRDI QIDQ3428636zbMATHFDO

Authors Sibabrata Ray, R. Kannan, Danyang Zhang, Hong Jiang

Publication date 29 March 2007

zbMATH Keywords

computational complexitygraph algorithminterval graphgraph vulnerability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• scientific article; zbMATH DE number 718663
• The mean integrity of paths and cycles.
• scientific article; zbMATH DE number 6836971
• Computing the weighted isolated scattering number of interval graphs in polynomial time
• scientific article; zbMATH DE number 4035869

Cited in

(7)

• The fully weighted toughness of a graph
• scientific article; zbMATH DE number 7310279 (Why is no real title available?)
• Computing the weighted isolated scattering number of interval graphs in polynomial time
• Parameterized complexity of safe set
• A polynomial algorithm for weighted scattering number in interval graphs
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
• scientific article; zbMATH DE number 718663 (Why is no real title available?)

This page was built for publication: The weighted integrity problem is polynomial for interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428636)