Maximum weight independent set in trees
categorical shape theoryclassificationcomparison 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 theorypattern recognition
Computing a maximum independent set, weighted or unweighted, is NP-hard for general as well as planar graphs. However, polynomial time algorithms do exist for solving this problem on special classes of graphs. In this paper we present an efficient algorithm for computing a maximum 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 of Borsuk the category A is the homotopy category of polyhedra, B the homotopy category of compact metric spaces and K is the inclusion. In this note the authors set out to interpret the simpler parts of categorical shape theory in terms of the basic theoretical problems of pattern recognition, namely the classification and recognition problems. In this interpretation A is a category of archetypes or models whilst B is a category of objects of interest, K being a ``comparison functor. The consequences of such a basic recognition system are explored and certain problems that naturally occur in this theory are discussed with reference to pattern recognition. The authors intend to write further notes of this form in the expectation that the ideas, suitably modified, may prove to be of use within the theory of pattern recognition. The authors would like to point out that reference 2 is to be published under the title ``Shape theory: Categorical approximation methods by Ellis Horwood Ltd. (expected publication date Spring 1989).
- 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
- 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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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
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)
