Maximal independent set - PDFSEARCH.IO - Document Search Engine

Maximal independent set
Results: 70

#	Item
1	Lecture 5 Maximal Independent Set 5.1 The Problem Add to Reading List Source URL: www.mpi-inf.mpg.de Language: English - Date: 2016-11-24 14:49:03
2	Noname manuscript No. (will be inserted by the editor) An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs Johannes Schneider · Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch - Date: 2014-09-26 08:36:35
3	Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science, Add to Reading List Source URL: www.dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:55 Graph theory Graph coloring Defective coloring Maximal independent set Independent set Interval edge coloring MaxCliqueDyn maximum clique algorithm
4	arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-05-18 20:53:11 Computational complexity theory Mathematics Graph theory Theoretical computer science Maximal independent set Signal-to-interference-plus-noise ratio Time complexity Algorithm
5	Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:28 Graph theory Planar graphs Maximal independent set Graph minor Minimum spanning tree Graph coloring Graph Planar separator theorem Line graph
6	On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:02 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Combinatorial optimization Maximal independent set Matching Connectivity Vertex cover Minimum spanning tree Leader election
7	Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:22 Graph theory NP-complete problems Maximal independent set Independent set Dominating set Vertex cover Graph coloring Planar graph Graph minor Planar separator theorem Tree decomposition
8	Gossip-Based Computation of Aggregate Information David Kempe∗, Alin Dobra, and Johannes Gehrke† Department of Computer Science, Cornell University Ithaca, NY 14853, USA {kempe,dobra,johannes}@cs.cornell.edu Abstract Add to Reading List Source URL: www-bcf.usc.edu Language: English - Date: 2007-10-12 00:29:55 Graph theory Computing Mathematics Distributed data storage Stochastic processes Network theory Networks Chord Gossip protocol Rope Random walk Maximal independent set
9	Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a mess Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-10-28 15:42:58 Graph theory NP-complete problems Graph coloring Independent set Maximal independent set
10	Ultra-Fast Rumor Spreading in Social Networks Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2012-04-03 10:06:29 Mathematics Graph theory Discrete mathematics Second moment method Graph Maximal independent set Draft:Sub-linear time algorithm