scientific article
From MaRDI portal
Publication:3428636
zbMath1141.05063MaRDI QIDQ3428636
Sibabrata Ray, Danyang Zhang, Rajgopal Kannan, Hong Jiang
Publication date: 29 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time ⋮ A polynomial algorithm for weighted scattering number in interval graphs ⋮ The fully weighted toughness of a graph ⋮ Parameterized Complexity of Safe Set ⋮ On the computational complexity of vertex integrity and component order connectivity ⋮ Computing the weighted isolated scattering number of interval graphs in polynomial time ⋮ Unnamed Item
This page was built for publication:
