An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
type: Item
instance of: scholarly article
title: An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
zbMATH Open document ID: 0677.68056
DOI: 10.1016/0020-0190(89)90220-2
author: S. H. Smith
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4110120
zbMATH Keywords: maximum weight clique algorithm
zbMATH Keywords: maximum weight clique problem
zbMATH Keywords: maximum weight independent sets
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90220-2
OpenAlex ID: W1978033460
cites work: Finding maximum cliques on circular-arc graphs
cites work: Algorithms on circular-arc graphs
cites work: Q3328583
cites work: Interval graphs and related topics
cites work: Stability in circular arc graphs
cites work: Efficient algorithms for interval graphs and circular-arc graphs
cites work: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
cites work: Q3898496
cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets
cites work: Coloring a Family of Circular Arcs
cites work: An Efficient Test for Circular-Arc Graphs
cites work: Preserving order in a forest in less than logarithmic time and linear space
description: scientific article; zbMATH DE number 4110120