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

Simple item page
dc.contributor.authorLiang, Weifa
dc.contributor.authorShen, Xiaojun
dc.contributor.authorHu, Qing
dc.date.accessioned2015-12-13T23:21:06Z
dc.date.available2015-12-13T23:21:06Z
dc.date.issued2000
dc.date.updated2015-12-12T09:05:32Z
dc.description.abstractLet 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
dc.identifier.issn1206-2138
dc.identifier.urihttp://hdl.handle.net/1885/91026
dc.publisherACT Press
dc.sourceInternational Journal of Parallel and Distributed Systems and Networks
dc.subjectKeywords: Computer simulation; Edge detection; Graph theory; Mathematical models; Parallel algorithms; Problem solving; Hypercube arrays; Mesh arrays; Parallel processing systems
dc.titleFinding the most vital edge for graph minimization problems on meshes and hypercubes
dc.typeJournal article
local.bibliographicCitation.issue4
local.bibliographicCitation.lastpage205
local.bibliographicCitation.startpage197
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.contributor.affiliationShen, Xiaojun, University of Missouri
local.contributor.affiliationHu, Qing, FutureNet Technologies Corporation
local.contributor.authoruidLiang, Weifa, u9404892
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor010406 - Stochastic Analysis and Modelling
local.identifier.ariespublicationMigratedxPub21531
local.identifier.citationvolume3
local.identifier.scopusID2-s2.0-0034481923
local.type.statusPublished Version

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS