The weighted integrity problem is polynomial for interval graphs

zbMATH Open1141.05063MaRDI QIDQ3428636FDOQ3428636

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

Publication date: 29 March 2007

Recommendations

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

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)

Cited In (8)

• Computing the weighted isolated scattering number of interval graphs in polynomial time
• Title not available (Why is that?)
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
• The fully weighted toughness of a graph
• Title not available (Why is that?)
• A polynomial algorithm for weighted scattering number in interval graphs
• Parameterized complexity of safe set
• On the computational complexity of vertex integrity and component order connectivity

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)