B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem - Dominating set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2006-08-14 16:34:49 Graph theory NP-complete problems Clique Degeneracy Dominating set Independent set Graph Degree Graph coloring Extremal graph theory		B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem Add to Reading List Source URL: www.caam.rice.edu Download Document from Source Website File Size: 292,08 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