Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs (Q4210127)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs |
scientific article; zbMATH DE number 1200769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9014487266540528
0 references
0.8810933828353882
0 references
0.8801982998847961
0 references
0.8748193383216858
0 references
0.868744432926178
0 references
