Pages that link to "Item:Q5261054"
From MaRDI portal
The following pages link to A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054):
Displaying 6 items.
- Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
- Restrained and total restrained domination in cographs (Q2151385) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Restrained domination and its variants in extended supergrid graphs (Q2699221) (← links)
- A linear algorithm for double Roman domination of proper interval graphs (Q5216450) (← links)