The weighted integrity problem is polynomial for interval graphs

MaRDI QIDQ3428636zbMATH OpenFDO

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

Publication date 29 March 2007

zbMATH Keywords

computational complexitygraph algorithmgraph vulnerabilityinterval graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) 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)

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

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)