On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (Q1123898): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59442098 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3934404 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3739144 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90226-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069169607 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:24, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three |
scientific article |
Statements
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (English)
0 references
1988
0 references
For a graph \(G=(V,E)\) and a set \(S\subset V\) let G-S be the graph obtained from G by deleting the vertices in S. A set of vertices F is called a feedback set of G if G-F contains no circuit. The feedback set problem is to find a minimum feedback set. It is known both the nonseparating independent set problem (to find the maximum independent set which contains no separating sets) and feedback set problem are NP- complete graph problems. In the paper these problems for graphs with no vertex degree exceeding 3 are reduced to the corresponding problems for 3-regular graphs, and then to the matching problem and the spanning set problem of some linearly represented 2-polymatroid, respectively, for which Lovászś polynomial-time algorithms are known.
0 references
feedback set problem
0 references
minimum feedback set
0 references
nonseparating independent set
0 references
NP-complete graph problems
0 references
3-regular graphs
0 references
matching problem
0 references
spanning set problem
0 references