CORE
CO
nnecting
RE
positories
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Research partnership
About
About
About us
Our mission
Team
Blog
FAQs
Contact us
Community governance
Governance
Advisory Board
Board of supporters
Research network
Innovations
Our research
Labs
research
An
O
∗
(
1.0821
n
)
O^*(1.0821^n)
O
∗
(
1.082
1
n
)
-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
Authors
Davis Issac
Ragesh Jaiswal
Publication date
12 April 2015
Publisher
View
on
arXiv
Abstract
We give an
O
∗
(
1.0821
n
)
O^*(1.0821^n)
O
∗
(
1.082
1
n
)
-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem
Similar works
Full text
Available Versions
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.767.6...
Last time updated on 30/10/2017
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:1308.1351
Last time updated on 24/10/2014
