Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

DAM
2016

favoriteEmaildiscussreport

114views more DAM 2016»

An exact algorithm for maximum independent set in degree-5 graphs

8 years 19 days ago

An exact algorithm for maximum independent set in degree-5 graphs

Download www.amp.i.kyoto-u.ac.jp

The maximum independent set problem is a basic NP-hard problem and has been extensively studied in exact algorithms. The maximum independent set problems in low-degree graphs are also important and may be bottlenecks of the problem in general graphs. In this paper, we present an O∗

Mingyu Xiao, Hiroshi Nagamochi

Real-time Traffic

DAM 2016 |

claim paper

Related Content

» Maximum Weight Independent Sets and Matchings in Sparse Random Graphs Exact Results Using ...

» Randomized greedy algorithms for independent sets and matchings in regular graphs Exact re...

» Small Maximal Independent Sets and Faster Exact Graph Coloring

» Multiobject Tracking as Maximum Weight Independent Set

» A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

» Iterative compression and exact algorithms

» Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

» Finding Independent Sets in Unions of Perfect Graphs

» PTAS for maximum weight independent set problem with random weights in bounded degree grap...

» Finding a Maximum Independent Set in a Sparse Random Graph

Post Info
More Details (n/a)

Added	01 Apr 2016
Updated	01 Apr 2016
Type	Journal
Year	2016
Where	DAM
Authors	Mingyu Xiao, Hiroshi Nagamochi

Comments (0)