Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cristina Bazgan / rank
Normal rank
 
Property / author
 
Property / author: Cristina Bazgan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2181288515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) most vital edges with respect to minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:21, 4 July 2024

scientific article
Language Label Description Also known as
English
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references