Article ID Journal Published Year Pages File Type
10331102 Information Processing Letters 2015 5 Pages PDF
Abstract
As a second result, we show the following: the computation of two disjoint maximal independent sets of minimum total size, NP-hard for general graphs, can be done in linear time on trees.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On disjoint maximal independent sets in graphs
Authors
,