On the hardness of optimization in power-law graphs. Ferrante, A., Pandurangan, G., & Park, K. Theor. Comput. Sci., 393(1-3):220-230, 2008.
On the hardness of optimization in power-law graphs. [link]Link  On the hardness of optimization in power-law graphs. [link]Paper  bibtex   
@article{journals/tcs/FerrantePP08,
  added-at = {2008-07-11T00:00:00.000+0200},
  author = {Ferrante, Alessandro and Pandurangan, Gopal and Park, Kihong},
  biburl = {http://www.bibsonomy.org/bibtex/28fb9bafc2c81bd117e874c933ef9ad14/dblp},
  date = {2008-07-11},
  description = {dblp},
  ee = {http://dx.doi.org/10.1016/j.tcs.2007.12.007},
  interhash = {2fce1fbcd369108c927e5c190ff75d9a},
  intrahash = {8fb9bafc2c81bd117e874c933ef9ad14},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  number = {1-3},
  pages = {220-230},
  timestamp = {2008-07-12T11:58:00.000+0200},
  title = {On the hardness of optimization in power-law graphs.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs393.html#FerrantePP08},
  volume = 393,
  year = 2008
}
Downloads: 0