Return to search

Approximation algorithms for finding planar and highly connected subgraphs

No description available.
Identiferoai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/8164
Date January 1997
CreatorsFernandes, Cristina G.
PublisherGeorgia Institute of Technology
Source SetsGeorgia Tech Electronic Thesis and Dissertation Archive
Languageen_US
Detected LanguageEnglish
TypeDissertation
Format245 bytes, text/html
RightsAccess restricted to authorized Georgia Tech users only.

Page generated in 0.0017 seconds