Efficiently covering complex networks with cliques of similar vertices. Behrisch, M. & Taraz, A. Theor Comput Sci, 355(1):37–47, 2006.  doi  bibtex   @Article{behrisch06efficiently,
  author    = {Michael Behrisch and Anusch Taraz},
  title     = {Efficiently covering complex networks with cliques of similar vertices},
  journal   = TCS,
  year      = {2006},
  volume    = {355},
  number    = {1},
  pages     = {37--47},
  doi       = {10.1016/j.tcs.2005.12.005},
  keywords  = {fpt},
  owner     = {Sebastian},
  timestamp = {2007.02.06},
} 
Downloads: 0
{"_id":"XP2a6zzAAenqFzSev","bibbaseid":"behrisch-taraz-efficientlycoveringcomplexnetworkswithcliquesofsimilarvertices-2006","authorIDs":[],"author_short":["Behrisch, M.","Taraz, A."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Michael"],"propositions":[],"lastnames":["Behrisch"],"suffixes":[]},{"firstnames":["Anusch"],"propositions":[],"lastnames":["Taraz"],"suffixes":[]}],"title":"Efficiently covering complex networks with cliques of similar vertices","journal":"Theor Comput Sci","year":"2006","volume":"355","number":"1","pages":"37–47","doi":"10.1016/j.tcs.2005.12.005","keywords":"fpt","owner":"Sebastian","timestamp":"2007.02.06","bibtex":"@Article{behrisch06efficiently,\n  author    = {Michael Behrisch and Anusch Taraz},\n  title     = {Efficiently covering complex networks with cliques of similar vertices},\n  journal   = TCS,\n  year      = {2006},\n  volume    = {355},\n  number    = {1},\n  pages     = {37--47},\n  doi       = {10.1016/j.tcs.2005.12.005},\n  keywords  = {fpt},\n  owner     = {Sebastian},\n  timestamp = {2007.02.06},\n}\n\n","author_short":["Behrisch, M.","Taraz, A."],"key":"behrisch06efficiently","id":"behrisch06efficiently","bibbaseid":"behrisch-taraz-efficientlycoveringcomplexnetworkswithcliquesofsimilarvertices-2006","role":"author","urls":{},"keyword":["fpt"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:41.570Z","downloads":0,"keywords":["fpt"],"search_terms":["efficiently","covering","complex","networks","cliques","similar","vertices","behrisch","taraz"],"title":"Efficiently covering complex networks with cliques of similar vertices","year":2006,"dataSources":["C5FtkvWWggFfMJTFX"]}