Large independent sets in general random intersection graphs
type: Item
instance of: scholarly article
title: Large independent sets in general random intersection graphs
zbMATH Open document ID: 1151.68044
published in: Theoretical Computer Science
publication date: 2008-11-12T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5365088
zbMATH Keywords: random intersection graph
zbMATH Keywords: randomized algorithm
zbMATH Keywords: independent set
zbMATH Keywords: wireless sensor networks
author: Sotiris E. Nikoletseas
author: Christoforos L. Raptopoulos
author: P. G. Spirakis
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.06.047
OpenAlex ID: W2029907394
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q4258216
cites work: Paths in graphs
cites work: Approximating layout problems on random geometric graphs
cites work: Q4788607
cites work: On Random Intersection Graphs: The Subgraph Problem
cites work: Sur deux propriétés des classes d'ensembles
cites work: Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
cites work: Automata, Languages and Programming
cites work: Expander Properties and the Cover Time of Random Intersection Graphs
cites work: Expander properties in random regular graphs with edge faults
cites work: Random Geometric Graphs
cites work: Q4367948
DOI: 10.1016/J.TCS.2008.06.047
description: scientific article; zbMATH DE number 5365088