Algorithms for a maximum clique and a maximum independent set of a circle graph
From MaRDI portal
Publication:5675749
DOI10.1002/net.3230030305zbMath0259.05125WikidataQ56210413 ScholiaQ56210413MaRDI QIDQ5675749
Publication date: 1973
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230030305
Related Items
Using Fifth Generation Tools for Solving the Clique Number Problem, A branch and bound algorithm for the maximum clique problem, Trapezoid graphs and generalizations, geometry and algorithms, Independence and domination in polygon graphs, Finding maximum cliques in arbitrary and in special graphs, APX-hardness of domination problems in circle graphs, Finding Hamiltonian circuits in proper interval graphs, On the chromatic number of multiple interval graphs and overlap graphs, On decomposing polygons into uniformly monotone parts, On dimensional properties of graphs, Representations of graphs and networks (coding, layouts and embeddings), New clique and independent set algorithms for circle graphs, Finding a maximum set of independent chords in a circle, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, On a graph partition problem with application to VLSI layout, The complexity of domination problems in circle graphs, Some simplified NP-complete graph problems, The maximum clique problem, An exact algorithm for the maximum stable set problem, Maximum independent set and maximum clique algorithms for overlap graphs, Container ship stowage problem complexity and connection to the coloring of circle graphs, Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture, On the computational complexity of 2-interval pattern matching problems, 3D-interval-filament graphs, Approximating the minimum clique cover and other hard problems in subtree filament graphs, An algorithm for finding a maximum weighted independent set in an arbitrary graph, Online Bounded Coloring of Permutation and Overlap Graphs, An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs, The Complexity of Coloring Circular Arcs and Chords
Cites Work
