Finding maximum cliques in circle graphs

DOI10.1002/net.3230110305zbMath0459.68029OpenAlexW2125837271MaRDI QIDQ3910008

Doron Rotem, Jorge Urrutia

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110305

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

An algorithm for the maximum internally stable set in a weighted graph ⋮ Computing the all-pairs longest chains in the plane ⋮ A Faster Algorithm for Maximum Induced Matchings on Circle Graphs ⋮ The complexity of colouring circle graphs ⋮ A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints ⋮ New clique and independent set algorithms for circle graphs ⋮ A branch and bound algorithm for the maximum clique problem ⋮ A parallel algorithm to generate all maximal independent sets on permutation graphs ⋮ Container ship stowage problem complexity and connection to the coloring of circle graphs ⋮ Finding maximum cliques in arbitrary and in special graphs ⋮ The maximum clique problem ⋮ Fast distance multiplication of unit-Monge matrices ⋮ An efficient algorithm to generate all maximal independent sets on trapezoid graphs

Cites Work

• Longest Increasing and Decreasing Subsequences
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Finding maximum cliques in circle graphs