A fine-grained analysis of a simple independent set algorithm
type: Item
instance of: scholarly article
zbMATH Open document ID: 1248.05202
author: Joachim Kneis
author: Alexander Langer
author: Peter Rossmanith
publication date: 2012-10-24T00:00:00Z
full work available at URL: frontdoor dadd.html
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6098235
zbMATH Keywords: exact algorithms
zbMATH Keywords: independent set
zbMATH Keywords: computer-aided proof
zbMATH Keywords: satellites
MaRDI profile type: Publication
OpenAlex ID: W2153667368
DOI: 10.4230/LIPICS.FSTTCS.2009.2326
Recommended article: On the complexity of approximating the independent set problem
Recommended article: Exact algorithms for maximum independent set
Recommended article: Exact Algorithms for Maximum Independent Set
Recommended article: A note on the random greedy independent set algorithm
Recommended article: A Simple Parallel Algorithm for the Maximal Independent Set Problem
Recommended article: Probabilistic analysis of a parallel algorithm for finding maximal independent sets
Recommended article: Q4864968
Recommended article: A Bottom-Up Method and Fast Algorithms for max independent set
Recommended article: Algorithms for maximum independent sets
title: A fine-grained analysis of a simple independent set algorithm
description: scientific article; zbMATH DE number 6098235