Skip navigation
Skip navigation

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

Liang, Weifa; Shen, Xiaojun; Hu, Qing


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

CollectionsANU Research Publications
Date published: 2000
Type: Journal article
Source: International Journal of Parallel and Distributed Systems and Networks


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator