Name
Abstract | ||
|---|---|---|
A neighborhood independent set (NI-set) is a subset of edges in a graph such that the closed neighborhood of any vertex contains at most one edge of the subset. Finding a maximum cardinality NI-set is an NP-complete problem. We consider the weighted version of this problem. For general graphs we give an algorithm with approximation ratio Δ, and for diamond-free graphs we give a ratio Δ/2+1, where Δ is the maximum degree of the input graph. Furthermore, we show that the problem is polynomially solvable on cographs. Finally, we give a tight upper bound on the cardinality of a NI-set on regular graphs. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ipl.2017.09.014 | Information Processing Letters |
Keywords | Field | DocType |
Weighted neighborhood independent set,Approximation algorithms,Graph algorithms | Discrete mathematics,Combinatorics,Chordal graph,Independent set,Cograph,Degree (graph theory),Pathwidth,1-planar graph,Mathematics,Split graph,Maximal independent set | Journal |
Volume | Issue | ISSN |
130 | C | 0020-0190 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Min Chih Lin | 1 | 259 | 21.22 |
| Julian Mestre | 2 | 103 | 7.88 |
| Saveliy Vasiliev | 3 | 0 | 0.68 |