Approximation algorithm for coloring of dotted interval graphs
DOI10.1016/J.IPL.2008.03.021zbMATH Open1185.05142OpenAlexW2108521619MaRDI QIDQ963476FDOQ963476
Authors: V. V. Yanovskij 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.021
Recommendations
approximation algorithmsintersection graphminimum coloringdotted interval graphmicrosatellite genotyping
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Algorithmic graph theory and perfect graphs
- On the hardness of approximating minimization problems
- Nonattacking Queens on a Triangle
- Approximating minimum coloring and maximum independent set in dotted interval graphs
- Optimization problems in multiple-interval graphs
- Dotted interval graphs and high throughput genotyping
Cited In (6)
- Optimization problems in dotted interval graphs
- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
- Approximating minimum coloring and maximum independent set in dotted interval graphs
- Title not available (Why is that?)
- Dotted interval graphs and high throughput genotyping
- Dotted interval graphs
This page was built for publication: Approximation algorithm for coloring of dotted interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963476)
