Maximum weight independent sets and cliques in intersection graphs of filaments
From MaRDI portal
(Redirected from Publication:294733)
Recommendations
Cites work
- scientific article; zbMATH DE number 3566474 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- O(M\cdot N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Algorithms on circular-arc graphs
- Comparability graphs and intersection graphs
- Decomposition by clique separators
- Intersection graphs of Helly families of subtrees
- Recognition of Circle Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Thresholds for classes of intersection graphs
- Trapezoid graphs and generalizations, geometry and algorithms
Cited in
(43)- The graphs with maximum induced matching and maximum matching the same size
- A faster algorithm for maximum independent set on interval filament graphs
- Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
- Towards a comprehensive theory of conflict-tolerance graphs
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Minimum weight feedback vertex sets in circle graphs
- Algorithms on Subtree Filament Graphs
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Independent packings in structured graphs
- On strict (outer-)confluent graphs
- On strict (outer-)confluent graphs
- On the structure of certain intersection graphs
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
- Maximum independent set in 2-direction outersegment graphs
- The complexity of dissociation set problems in graphs
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- On-line approach to off-line coloring problems on graphs with geometric representations
- The induced separation dimension of a graph
- Traversing combinatorial 0/1-polytopes via optimization
- Maximum independent set and maximum clique algorithms for overlap graphs
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
- Robust maximum weighted independent-set problems on interval graphs
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- Recognising the overlap graphs of subtrees of restricted trees is hard
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
- Algorithms for maximum weight induced paths
- Simultaneous contact representations of planar graphs
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Subtree filament graphs are subtree overlap graphs
- The maximum clique problem in multiple interval graphs
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- Algorithms for induced biclique optimization problems
- Induced separation dimension
- The critical node detection problem in networks: a survey
- Induced matchings in intersection graphs.
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- 3D-interval-filament graphs
- The k-separator problem: polyhedra, complexity and approximation results
- Finding a maximum induced matching in weakly chordal graphs
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- An algorithm for the maximum weight independent set problem on outerstring graphs
This page was built for publication: Maximum weight independent sets and cliques in intersection graphs of filaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294733)
