An O(20.304n) Algorithm for Solving Maximum Independent Set Problem | IEEE Journals & Magazine | IEEE Xplore
Subscribe
ADVANCED SEARCH
Journals & Magazines >IEEE Transactions on Computers >Volume: C-35 Issue: 9

An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

PDF
Tang Jian
All Authors

Abstract:

A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski [7]. A techniq...Show More

Metadata

Abstract:

A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski [7]. A technique to further accelerate this algorithm is also described.
Published in: IEEE Transactions on Computers ( Volume: C-35, Issue: 9, September 1986)
Page(s): 847 - 851
Date of Publication: 30 September 1986

ISSN Information:

DOI: 10.1109/TC.1986.1676847
Contact IEEE to Subscribe

References

References is not available for this document.

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.