Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs (Q4210127): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q233432 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Maw-Shang Chang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 14:47, 5 March 2024
scientific article; zbMATH DE number 1200769
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs |
scientific article; zbMATH DE number 1200769 |
Statements
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs (English)
0 references
21 September 1998
0 references
graph algorithm
0 references
total dominating set
0 references
connected dominating set
0 references
interval graph
0 references
circular-arc graph
0 references
