k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
From MaRDI portal
Publication:4210228
DOI10.1137/S0895480193244322zbMath0911.05050MaRDI QIDQ4210228
Shiow-Fen Hwang, Gerard Jennhwa Chang
Publication date: 21 September 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
chordal graphstrongly chordal graph\(k\)-neighborhood-covering\(k\)-neighborhood-independencestrong elimination order
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10)
Related Items (5)
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs ⋮ An efficient algorithm to solve the distancek-domination problem on permutation graphs ⋮ Approximating weighted neighborhood independent sets ⋮ Thek-neighbourhood-covering problem on interval graphs ⋮ Minimum r-neighborhood covering set of permutation graphs
This page was built for publication: k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
