Maximum independent set and maximum clique algorithms for overlap graphs
From MaRDI portal
Recommendations
- Efficient algorithms for finding maximum cliques of an overlap graph
- Polynomial time algorithms on circular-arc overlap graphs
- New clique and independent set algorithms for circle graphs
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
Cites work
- A study on two geometric location problems
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Arbres et dimension des ordres
- Characterizing intersection classes of graphs
- Containment Graphs, Posets, and Related Classes of Graphs
- Covering and coloring polygon-circle graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 4177086 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 125465 (Why is no real title available?)
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- scientific article; zbMATH DE number 867674 (Why is no real title available?)
- Maximum weight independent sets and cliques in intersection graphs of filaments
- On rectangle intersection and overlap graphs
- Partially Ordered Sets
- Polynomial time algorithms on circular-arc overlap graphs
- Sur deux propriétés des classes d'ensembles
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The max clique problem in classes of string-graphs
Cited in
(15)- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Towards a comprehensive theory of conflict-tolerance graphs
- Subtree filament graphs are subtree overlap graphs
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- 3D-interval-filament graphs
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
- Polynomial time algorithms on circular-arc overlap graphs
- Efficient algorithms for finding maximum cliques of an overlap graph
- Minimum vertex cover in rectangle graphs
- How to guard a graph?
- New formulation for coloring circle graphs
- Polynomial-time recognition and maximum independent set in Burling graphs
- On simultaneous planar graph embeddings
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
This page was built for publication: Maximum independent set and maximum clique algorithms for overlap graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408815)
