Finding the most vital edge for graph minimization problems on meshes and hypercubes
Loading...
Date
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
Citation
Collections
Source
International Journal of Parallel and Distributed Systems and Networks