An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs-Reference-Cited by-同舟云学术

An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs

Published:2008 Issue: Volume: Page:55-65
ISSN:0302-9743
Container-title:Parameterized and Exact Computation
language:
Short-container-title:

Author:

Bourgeois Nicolas,Escoffier Bruno,Paschos Vangelis Th.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79723-4_7

Reference8 articles.

1. Robson, J.M.: Finding a maximum independent set in time O(2 n/4). Technical Report 1251-01, LaBRI, Université de Bordeaux I (2001)

2. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA 1999, pp. 856–857 (1999)

3. Lecture Notes in Computer Science;J. Chen,2003

4. Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Inform. Process. Lett. 97, 191–196 (2006)

5. Lecture Notes in Computer Science;M. Fürer,2006

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs;Algorithmica;2023-12-15

2. Four Shorts Stories on Surprising Algorithmic Uses of Treewidth;Treewidth, Kernels, and Algorithms;2020

3. Maximum Independent Set Approximation Based on Bellman-Ford Algorithm;Arabian Journal for Science and Engineering;2014-05-31

4. Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs;Theoretical Computer Science;2013-01

5. Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms;Discrete Applied Mathematics;2011-10