Algorithmic Aspects of Domination in Graphs

Gerard J. Chang
Additional contact information
Gerard J. Chang: National Chiao Tung University, Department of Applied Mathematics

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1811-1877 from Springer

Abstract: Abstract Graph theory was founded by Euler [78] in 1736 as a generalization to the solution of the famous problem of the Könisberg bridges. From 1736 to 1936, the same concept as graph, but under different names, was used in various scientific fields as models of real world problems, see the historic book by Biggs, Lloyd and Wilson [19]. This chapter intents to survey the domination problem in graph theory, which is a natural model for many location problems in operations research, from an algorithmic point of view.

Keywords: Steiner Tree; Interval Graph; Domination Number; Chordal Graph; Total Domination (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_28

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().