Welcome Guest
|
login
ACADEMIC PROGRAMS
ABOUT US
CONTACT US
SECS SITE
APPLY NOW!
>> Information
Chair's Message
Faculty/Staff Directory
Grad Students Dir
Technical Support
Curricula
Course Description
CS News
Open Positions
Publications
Research Groups
RSS feeds
>> Related Links
CS Webmail
DU NEWS
Calendars
Blackboard
>> Search
Home
ยป
Biblio
Approximating Minimum-Size k-Connected Spanning Subgraph via Matching
Posted January 25th, 2008 by webmaster
CS Publications
Authors:
J.Cheriyan
;
R. Thurimella
Source:
(2000)
URL:
http://www.cs.du.edu/~ramki/papers/spanSubgraphs.pdf
Tagged
XML
BibTex
