Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph

DOI10.1016/0196-6774(92)90012-2zbMath0767.68082OpenAlexW2023875617MaRDI QIDQ3990622

Toshinobu Kashiwabara, Kazuo Nakajima, Toshio Fujisawa, Sumio Masuda

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(92)90012-2

zbMATH Keywords

maximum cliques of a circular-arc graphmaximum independent sets of a bipartite graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

Approximately counting locally-optimal structures ⋮ Approximately Counting Locally-Optimal Structures ⋮ On the \(k\)-colored rainbow sets in fixed dimensions ⋮ Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy ⋮ An optimal algorithm to generate tilings ⋮ A new fast heuristic for labeling points ⋮ A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ The maximum clique problem

This page was built for publication: Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph