Dominations in Trapezoid Graphs

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

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 languageAmerican English
JournalInformation Processing Letters
Volume52
DOIs
StatePublished - Dec 23 1994

Disciplines

  • Computer Sciences

Keywords

  • Algorithms
  • Domination
  • Graph algorithm
  • Trapezoid graph

Fingerprint

Dive into the research topics of 'Dominations in Trapezoid Graphs'. Together they form a unique fingerprint.

Cite this