Stability in circular arc graphs
From MaRDI portal
Publication:3796775
DOI10.1016/0196-6774(88)90023-5zbMath0651.68083MaRDI QIDQ3796775
Peter L. Hammer, Martin Charles Golumbic
Publication date: 1988
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(88)90023-5
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone, Unnamed Item, A note on \(\alpha\)-redundant vertices in graphs, Irredundancy in circular arc graphs, Consensus algorithms for the generation of all maximal bicliques, Representations of graphs and networks (coding, layouts and embeddings), Linear time algorithms on circular-arc graphs, Efficient parallel recognition of some circular arc graphs. I, The maximum clique problem, On the use of Boolean methods for the computation of the stability number, Struction revisited, Induced matchings in intersection graphs., New results on induced matchings, Solving the path cover problem on circular-arc graphs by using an approximation algorithm, Independent packings in structured graphs, Local transformations of graphs preserving independence number
