An output sensitive algorithm for computing a maximum independent set of a circle graph

We present an output sensitive algorithm for computing a maximum independent set of an unweighted circle graph. Our algorithm requires O ( n min { d , α } ) time at worst, for an n vertex circle graph where α is the independence number of the circle graph and d is its density. Previous algorithms fo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 110; číslo 16; s. 630 - 634
Hlavní autori: Nash, Nicholas, Gregg, David
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 31.07.2010
Elsevier
Elsevier Sequoia S.A
Predmet:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Circle graph
Computation
Computer science; control theory; systems
Density
Design of algorithms
Exact sciences and technology
Graph algorithms
Graphs
Information retrieval. Graph
Maximum independent set
Maximum stable set
Miscellaneous
Optimization
Studies
Theoretical computing
Maximum independent set
Circle graph
Maximum stable set
Graph algorithms
Design of algorithms
Circle
Computer theory
Independence
Vertex(graph)
Computing
Maximum
Information processing
Algorithm analysis
Graph algorithm
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present an output sensitive algorithm for computing a maximum independent set of an unweighted circle graph. Our algorithm requires O ( n min { d , α } ) time at worst, for an n vertex circle graph where α is the independence number of the circle graph and d is its density. Previous algorithms for this problem required Θ ( n d ) time at worst.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2010.05.016