Dominating sets of random 2-in 2-out directed graphs

Howe, Stephen

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Dominating sets of random 2-in 2-out directed graphs

Date

2008

Authors

Howe, Stephen

Publisher

International Press

Abstract

We analyse an algorithm for finding small dominating sets of 2-in 2-out directed graphs using a deprioritised algorithm and differential equations. This deprioritised approach determines an a.a.s. upper bound of 0.39856n on the size of the smallest dominating set of a random 2-in 2-out digraph on n vertices. Direct expectation arguments determine a corresponding lower bound of 0.3495n.

URI

http://hdl.handle.net/1885/17285

Collections

ANU Research Publications

Source

Electronic Journal of Combinatorics

Type

Journal article

Restricted until

2037-12-31

Downloads

File

Description

01_Howe_Dominating_sets_of_random_2-in_2008.pdf (188.74 KB)

Full item page

Cultural advice

Dominating sets of random 2-in 2-out directed graphs

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

Downloads