research-article

Finding a Maximum Independent Set

Authors:

Robert Endre Tarjan,

Anthony E. TrojanowskiAuthors Info & Claims

SIAM Journal on Computing, Volume 6, Issue 3

Pages 537 - 546

https://doi.org/10.1137/0206038

Published: 01 September 1977 Publication History

Abstract

We present an algorithm which finds a maximum independent set in an n-vertex graph in $O(2^{n/3})$ time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.

References

[1]

J. G. Augustin, J. Minker, An analysis of some graph theoretical cluster techniques, J. Assoc. Comput. Mach., 17 (1970), 571–588

Google Scholar

[2]

E. Balas, A. Samuelson, Finding a minimum node cover in an arbitrary graph, Management Sciences Research Rep., 325, Graduate School of Business Administration, Carnegie-Mellon Univ., Pittsburgh, PA, 1973

Google Scholar

[3]

C. Bron, J. Kerbosch, Algorithm 457, Finding all cliques of an undirected graph, Comm. ACM, 16 (1973), 575–577

Digital Library

Google Scholar

[4]

S. Cook, The complexity of theorem-proving procedures, Proc. Third ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1970, 151–158

Google Scholar

[5]

E. Horowitz, S. Sahni, Computing partitions with applications to the knapsack problem, Tech. Rep., 72-134, Computer Sci. Dept., Cornell Univ., Ithaca, NY, 1972

Google Scholar

[6]

H. C. Johnston, Cliques of a graph–variations on the Bron-Kerbosch algorithm, Internat. J. Comput. Information Sci., 5 (1976), 209–238

Crossref

Google Scholar

[7]

Richard M. Karp, R. E. Miller, J. W. Thatcher, Reducibility among combinatorial problemsComplexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), Plenum, New York, 1972, 85–103

Google Scholar

[8]

G. D. Mulligan, D. G. Cornell, Corrections to Bierstone's algorithm for generating cliques, J. Assoc. Comput. Mach., 19 (1972), 244–247

Digital Library

Google Scholar

[9]

G. L. Nemhauser, L. E. Trotter, Jr., Vertex packings: structural properties and algorithms, Math. Programming, 8 (1975), 232–248

Digital Library

Google Scholar

[10]

R. Tarjan, Finding a maximum clique, Tech. Rep., 72-123, Computer Sci. Dept., Cornell Univ., Ithaca, NY, 1972

Google Scholar

Cited By

View all

Ye HXu HWang HWang CJiang YKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)GNN&GBDT-guided fast optimizing framework for large-scale integer programmingProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3620072(39864-39878)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3620072
Chang L(2023)Efficient Maximum k-Defective Clique Computation with Improved Time ComplexityProceedings of the ACM on Management of Data10.1145/36173131:3(1-26)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3617313
Mao JCao LGao CWang HFan HJin DLi YSingh ASun YAkoglu LGunopulos DYan XKumar ROzcan FYe J(2023)Detecting Vulnerable Nodes in Urban Infrastructure Interdependent NetworkProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599804(4617-4627)Online publication date: 6-Aug-2023
https://dl.acm.org/doi/10.1145/3580305.3599804
Show More Cited By

Index Terms

Finding a Maximum Independent Set
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
    2. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Design and analysis of algorithms
  2. Randomness, geometry and discrete structures

Index terms have been assigned to the content through auto-classification.

Recommendations

Maximum independent set and maximum clique algorithms for overlap graphs

We give polynomial time algorithms for the maximum independent set and maximum clique problems for classes of overlap graphs, assuming an overlap model is provided as input. The independent set algorithm applies to any class of overlap graphs for which ...
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs

The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs of maximum degree at most three (also called subcubic graphs). In this paper, we will study its complexity in subclasses of subcubic graphs.Let S i , j , k be the graph ...
Maximum independent sets in 3- and 4-regular Hamiltonian graphs

Smooth 4-regular Hamiltonian graphs are generalizations of cycle-plus-triangles graphs. While the latter have been shown to be 3-choosable, 3-colorability of the former is NP-complete. In this paper we first show that the independent set problem for 3-...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 6, Issue 3

Sep 1977

204 pages

ISSN:0097-5397

DOI:10.1137/smjcat.1977.6.issue-3

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 September 1977

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ye HXu HWang HWang CJiang YKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)GNN&GBDT-guided fast optimizing framework for large-scale integer programmingProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3620072(39864-39878)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3620072
Chang L(2023)Efficient Maximum k-Defective Clique Computation with Improved Time ComplexityProceedings of the ACM on Management of Data10.1145/36173131:3(1-26)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3617313
Mao JCao LGao CWang HFan HJin DLi YSingh ASun YAkoglu LGunopulos DYan XKumar ROzcan FYe J(2023)Detecting Vulnerable Nodes in Urban Infrastructure Interdependent NetworkProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599804(4617-4627)Online publication date: 6-Aug-2023
https://dl.acm.org/doi/10.1145/3580305.3599804
Zamir OSaha BServedio R(2023)Algorithmic Applications of Hypergraph and Partition ContainersProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585163(985-998)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585163
Kornyak V(2023)Complementarity in Finite Quantum Mechanics and Computer-Aided Computations of Complementary ObservablesProgramming and Computing Software10.1134/S036176882302010X49:5(423-432)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1134/S036176882302010X
Bezerra JKuznetsov PMilani AWoelfel P(2022)Brief Announcement: How to Tame Multiple Spending in Decentralized CryptocurrenciesProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538465(427-429)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.1145/3519270.3538465
Niu YGlowinski R(2022)Discrete Dynamical System Approaches for Boolean Polynomial OptimizationJournal of Scientific Computing10.1007/s10915-022-01882-z92:2Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s10915-022-01882-z
Bezerra JKuznetsov PKoroleva A(2022)Relaxed Reliable Broadcast for Decentralized TrustNetworked Systems10.1007/978-3-031-17436-0_8(104-118)Online publication date: 17-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-17436-0_8
Xiao MHuang SZhou YDing B(2021)Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent SetProceedings of the Web Conference 202110.1145/3442381.3450130(3930-3940)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3442381.3450130
van Rooij Svan Rooij J(2019)Algorithms and Complexity Results for the Capacitated Vertex Cover ProblemSOFSEM 2019: Theory and Practice of Computer Science10.1007/978-3-030-10801-4_37(473-489)Online publication date: 27-Jan-2019
https://dl.acm.org/doi/10.1007/978-3-030-10801-4_37
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Maximum independent set and maximum clique algorithms for overlap graphs

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs

Maximum independent sets in 3- and 4-regular Hamiltonian graphs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations