A note on sampling scale-free graphs K. M. Briggs BT Research, Adastral Park Martlesham UK IP5 3RE 2007 November 19 16:47 In Proc. Nat. Acad. Sci. 102, ), Stumpf et al. have shown

First Page		Document Content
Date: 2008-01-02 07:43:53 Analytic number theory Meromorphic functions Degree distribution Scale-free network Riemann zeta function Degree Random graphs NP-complete problems Dominating set Graph theory Mathematics Mathematical analysis		A note on sampling scale-free graphs K. M. Briggs BT Research, Adastral Park Martlesham UK IP5 3RE 2007 November 19 16:47 In Proc. Nat. Acad. Sci. 102, ), Stumpf et al. have shown Add to Reading List Source URL: keithbriggs.info Download Document from Source Website File Size: 86,03 KB Share Document on Facebook

	Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen DocID: 1tR7l - View Document
	Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.ch DocID: 1s1V7 - View Document
	A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken DocID: 1rpJU - View Document
	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont DocID: 1rlxP - View Document
	Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract DocID: 1rg2z - View Document