Finding hidden independent sets in interval graphs

DOI10.1016/S0304-3975(03)00422-5zbMath1098.68138OpenAlexW2038878443WikidataQ57690021 ScholiaQ57690021MaRDI QIDQ1884976

Alejandro López-Ortiz, Erik D. Demaine, Broňa Brejová, Tomáš Vinař, Angèle M. Hamel, Therese C. Biedl

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00422-5

zbMATH Keywords

GamesIndependent setAdaptive algorithmsInterval graphsGene findingBattleship

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Optimally adaptive integration of univariate Lipschitz functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of coloring games on perfect graphs
• Intersection graphs of segments
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• Optimal aggregation algorithms for middleware.
• Searching and pebbling
• Network Flow and Testing Graph Connectivity
• On a combinatorial game

This page was built for publication: Finding hidden independent sets in interval graphs