Weighted irredundance of interval graphs.
From MaRDI portal
Publication:2583539
DOI10.1016/S0020-0190(98)00040-4zbMath1078.05526MaRDI QIDQ2583539
C. Pandu Rangan, Maw-Shang Chang, P. Nagavamsi
Publication date: 17 January 2006
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, Connected domination and dominating clique in trapezoid graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Irredundancy in circular arc graphs
- A note on graphs which have upper irredundance equal to independence
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Total Domination and Irredundance in Weighted Interval Graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- The Private Neighbor Cube