Approximation Algorithms for Finding Highly Connected Subgraphs

Simple item page
dc.contributor.authorKhuller, Samiren_US
dc.date.accessioned2004-05-31T22:29:45Z
dc.date.available2004-05-31T22:29:45Z
dc.date.created1995-01en_US
dc.date.issued1998-10-15en_US
dc.description.abstract(Also cross-referenced as UMIACS-TR-95-4)en_US
dc.format.extent359746 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/689
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3398en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-4en_US
dc.titleApproximation Algorithms for Finding Highly Connected Subgraphsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-3398.ps
Size:
351.31 KB
Format:
Postscript Files
Download
Thumbnail Image
Name:
CS-TR-3398.pdf
Size:
326.37 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-3398.ps
Download

Collections

Technical Reports from UMIACS
Technical Reports of the Computer Science Department