Abstract
We present O( nm ) time algorithms for the weighted domination problem and its two variants, total domination and connected domination in a trapezoid graph of n vertices and m edges.
Original language | American English |
---|---|
Journal | Information Processing Letters |
Volume | 52 |
DOIs | |
State | Published - Dec 23 1994 |
Disciplines
- Computer Sciences
Keywords
- Algorithms
- Domination
- Graph algorithm
- Trapezoid graph