Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
type: Item
instance of: scholarly article
title: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
zbMATH Open document ID: 1326.05103
DOI: 10.1007/978-3-642-19222-7_17
author: Sonia Toubaline
author: Zsolt Tuza
author: Cristina Bazgan
published in: Lecture Notes in Computer Science
publication date: 2011-05-19T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5897209
MaRDI profile type: Publication
full work available at URL: 978-3-642-19222-7 17
OpenAlex ID: W2181288515
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q4875228
cites work: A simple linear time algorithm for cograph recognition
cites work: Approximation Schemes for the Restricted Shortest Path Problem
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: Treewidth. Computations and approximations
cites work: Vertex packings: Structural properties and algorithms
cites work: Optimization, approximation, and complexity classes
cites work: The hardness of approximation: Gap location
cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
cites work: Finding the \(k\) most vital edges with respect to minimum spanning tree
cites work: Blockers and transversals
cites work: Deterministic network interdiction
description: scientific article