Dotted interval graphs

DOI10.1145/2151171.2151172MaRDI QIDQ3189050zbMATH OpenOpenAlexWikidataFDO

Authors Yonatan Aumann, Oren Melamud, Zohar Yakhini, Moshe Lewenstein, Ron Y. Pinter

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2151171.2151172

zbMATH Keywords

approximation algorithmscircular arc graphgraph coloringgraph theoryintersection graphinterval graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Dotted interval graphs and high throughput genotyping
• Approximating minimum coloring and maximum independent set in dotted interval graphs
• Approximation algorithm for coloring of dotted interval graphs
• Optimization problems in dotted interval graphs
• Optimization problems in dotted interval graphs

Cited in

(6)

• Dotted interval graphs and high throughput genotyping
• Optimization problems in dotted interval graphs
• Optimization problems in dotted interval graphs
• Interval line graphs
• Approximating minimum coloring and maximum independent set in dotted interval graphs
• Approximation algorithm for coloring of dotted interval graphs

This page was built for publication: Dotted interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189050)