Maximum weight independent set in trees
From MaRDI portal
Publication:1101239
classificationpattern recognitioncategorical shape theorycomparison functormaximum wehe extent to which, given two categories A and B and a functor K from A to B, the functor K can be used to gain information on the objects of B via approximations by K-images of objects in A. In the shape geometric theory
Recommendations
- The structure and maximum number of maximum independent sets in trees
- scientific article; zbMATH DE number 5717280
- On maximal independent sets of nodes in trees
- The Number of Maximal Independent Sets in a Tree
- scientific article; zbMATH DE number 5904022
- scientific article; zbMATH DE number 6470693
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Trees with a unique maximum independent set and their linear properties
- Trees with extremal numbers of maximal independent sets including the set of leaves
- Trees with a given number of leaves and the maximal number of maximum independent sets
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Depth-first search and the vertex cover problem
- Efficient bounds for the stable set, vertex cover and set packing problems
- Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
- Solving NP-hard problems in 'almost trees': vertex cover
- Vertex packings: Structural properties and algorithms
Cited in
(2)
This page was built for publication: Maximum weight independent set in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101239)
