Dominations in trapezoid graphs

Y. Daniel Liang

doi:10.1016/0020-0190(94)00159-6

Dominations in trapezoid graphs

Y. Daniel Liang

Computer Science

Indiana Purdue Univ at Fort Wayne

Research output: Contribution to journal › Article › peer-review

25 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 language	English
Pages (from-to)	309-315
Number of pages	7
Journal	Information Processing Letters
Volume	52
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(94)00159-6
State	Published - Dec 23 1994

Scopus Subject Areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Keywords

Algorithms
Domination
Graph algorithm
Trapezoid graph

Access to Document

10.1016/0020-0190(94)00159-6License: Unspecified

Cite this

@article{6429be3e4eec43f4b7be953d4519161b,

title = "Dominations in trapezoid graphs",

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. ",

keywords = "Algorithms, Domination, Graph algorithm, Trapezoid graph",

author = "\{Daniel Liang\}, Y.",

note = "We present O(nm) time algorithms for the weighted domination problem and its two variants, total domination and connected domination in a trapezoid gr...",

year = "1994",

month = dec,

day = "23",

doi = "10.1016/0020-0190(94)00159-6",

language = "English",

volume = "52",

pages = "309--315",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Dominations in trapezoid graphs

AU - Daniel Liang, Y.

N1 - We present O(nm) time algorithms for the weighted domination problem and its two variants, total domination and connected domination in a trapezoid gr...

PY - 1994/12/23

Y1 - 1994/12/23

N2 - 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.

AB - 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.

KW - Algorithms

KW - Domination

KW - Graph algorithm

KW - Trapezoid graph

UR - https://www.scopus.com/pages/publications/0028697825

U2 - 10.1016/0020-0190(94)00159-6

DO - 10.1016/0020-0190(94)00159-6

M3 - Article

SN - 0020-0190

VL - 52

SP - 309

EP - 315

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

Dominations in trapezoid graphs

Abstract

Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this