An algorithm for the maximum weight independent set problem on outerstring graphs
From MaRDI portal
(Redirected from Publication:680149)
Recommendations
- Computing maximum independent set on outerstring graphs and their relatives
- Computing maximum independent set on outerstring graphs and their relatives
- Algorithms and Computation
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- A note on greedy algorithms for the maximum weighted independent set problem
- scientific article; zbMATH DE number 2119675
- An optimal maximal independent set algorithm for bounded-independence graphs
- The weighted maximum independent set problem in permutation graphs
Cites work
- scientific article; zbMATH DE number 4200260 (Why is no real title available?)
- scientific article; zbMATH DE number 3981198 (Why is no real title available?)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Comparability graphs and intersection graphs
- Computing the independence number of intersection graphs
- Data Mining with optimized two-dimensional association rules
- Every planar graph is the intersection graph of segments in the plane (extended abstract)
- Intersection graphs of curves in the plane
- Label placement by maximum independent set in rectangles
- Maximum independent set in 2-direction outersegment graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Noncrossing Subgraphs in Topological Layouts
- On the rectangle escape problem
- Recognizing string graphs in NP
- String graphs and incomparability graphs
- String graphs requiring exponential representations
- String graphs. I: The number of critical nonstring graphs is infinite
- String graphs. II: Recognizing string graphs is NP-hard
- The clique problem in ray intersection graphs
- The max clique problem in classes of string-graphs
- Topology of Thin Film RC Circuits
- Vertex disjoint paths for dispatching in railways
Cited in
(20)- Computing maximum independent set on outerstring graphs and their relatives
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- The Maximum Disjoint Routing Problem
- Faster multi-sided one-bend boundary labelling
- On dominating set of some subclasses of string graphs
- Generalized disk graphs
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Boundary labeling for rectangular diagrams
- An algorithm for outerplanar graphs with parameter
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
- Approximating dominating set on intersection graphs of rectangles and L-frames
- Intersection graphs of rays and grounded segments
- Algorithm to find a maximum 2-packing set in a cactus
- On approximating MIS over B1-VPG graphs*
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Order-preserving 1-string representations of planar graphs
- Maximum independent set in 2-direction outersegment graphs
- Finding a Maximum Clique in a Grounded 1-Bend String Graph
- On the size of outer-string representations
- Packing boundary-anchored rectangles and squares
This page was built for publication: An algorithm for the maximum weight independent set problem on outerstring graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680149)
