Header menu link for other important links
X
Minimum 2-edge connected spanning subgraph of certain graphs
, A. William
Published in Charles Babbage Research Centre
2015
Volume: 92
   
Pages: 255 - 264
Abstract
Given an undirected 2-edge connected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for Butterfly network, Benes network, Honeycomb network and Sierpiński gasket graph.
About the journal
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
PublisherCharles Babbage Research Centre
ISSN08353026