Finding hidden independent sets in interval graphs
From MaRDI portal
Publication:1884976
DOI10.1016/S0304-3975(03)00422-5zbMath1098.68138WikidataQ57690021 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
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item