Weighted irredundance of interval graphs.

DOI10.1016/S0020-0190(98)00040-4MaRDI QIDQ2583539zbMATH OpenFDO

Authors Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(98)00040-4

zbMATH Keywords

AlgorithmsComputational complexityInterval graphsIrredundant set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A note on graphs which have upper irredundance equal to independence
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• Chordal graphs and upper irredundance, upper domination and independence
• Contributions to the theory of domination, independence and irredundance in graphs
• scientific article; zbMATH DE number 3859049 (Why is no real title available?)
• scientific article; zbMATH DE number 3869363 (Why is no real title available?)
• scientific article; zbMATH DE number 4055676 (Why is no real title available?)
• scientific article; zbMATH DE number 3625441 (Why is no real title available?)
• Irredundancy in circular arc graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The Private Neighbor Cube
• Total Domination and Irredundance in Weighted Interval Graphs

Cited in

(3)

• Connected domination and dominating clique in trapezoid graphs
• scientific article; zbMATH DE number 5720912 (Why is no real title available?)
• Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack

This page was built for publication: Weighted irredundance of interval graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583539)