<--- Back to Details
First PageDocument Content
NP-complete problems / Graph coloring / Tree / Clique / Maximal independent set / Graph / Connectivity / Connected component / Independent set / Graph theory / Mathematics / Theoretical computer science
Date: 2013-04-17 12:02:13
NP-complete problems
Graph coloring
Tree
Clique
Maximal independent set
Graph
Connectivity
Connected component
Independent set
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: www.cs.technion.ac.il

Download Document from Source Website

File Size: 277,76 KB

Share Document on Facebook

Similar Documents

Lecture 5 Maximal Independent Set 5.1 The Problem

DocID: 1v2MD - View Document

Noname manuscript No. (will be inserted by the editor) An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs Johannes Schneider · Roger Wattenhofer

DocID: 1rvrw - View Document

Graph theory / Graph coloring / Defective coloring / Maximal independent set / Independent set / Interval edge coloring / MaxCliqueDyn maximum clique algorithm

Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,

DocID: 1rrEj - View Document

Computational complexity theory / Mathematics / Graph theory / Theoretical computer science / Maximal independent set / Signal-to-interference-plus-noise ratio / Time complexity / Algorithm

arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

DocID: 1rlA9 - View Document

Graph theory / Planar graphs / Maximal independent set / Graph minor / Minimum spanning tree / Graph coloring / Graph / Planar separator theorem / Line graph

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

DocID: 1rcqn - View Document