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.

Finding the most vital edge for graph minimization problems on meshes and hypercubes

Thumbnail Image

Date

2000

Authors

Liang, Weifa
Shen, Xiaojun
Hu, Qing

Journal Title

Journal ISSN

Volume Title

Publisher

ACT Press

Abstract

Let G(V, E, w) be an undirected, weighted, connected simple graph. Let P be a minimization problem in G. Edge e*∈E is called the most vital edge if its removal from G maximizes the value of P in G(V, E-{e*}, w). This paper considers the most vital edge

Description

Keywords

Keywords: Computer simulation; Edge detection; Graph theory; Mathematical models; Parallel algorithms; Problem solving; Hypercube arrays; Mesh arrays; Parallel processing systems

Citation

URI

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

Collections

ANU Research Publications

Source

International Journal of Parallel and Distributed Systems and Networks

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

DSpace software copyright © 2002-2026 LYRASIS

abcd