<--- Back to Details
First PageDocument Content
Art gallery problem / Computational geometry / Outerplanar graph / Clique / Bipartite graph / Independent set / Arrangement of lines / Matching / Distance / Graph theory / NP-complete problems / Graph coloring
Date: 2009-08-26 19:18:37
Art gallery problem
Computational geometry
Outerplanar graph
Clique
Bipartite graph
Independent set
Arrangement of lines
Matching
Distance
Graph theory
NP-complete problems
Graph coloring

Add to Reading List

Source URL: arxiv.org

Download Document from Source Website

File Size: 1,87 MB

Share Document on Facebook

Similar Documents

SectionDisclosure of independent expenditures is amended as follows, and a new sectionis added to the Part: (a) Purpose and Overview. The purpose of this Regulation is to set forth the requirements unde

DocID: 1vrhz - View Document

For personal use only BARD1 ANNOUNCES ADDITIONAL POSITIVE RESULTS USING BARD1-OVARIAN TEST IN FOLLOW-ON STUDY • Successful application of BARD1-Ovarian test to an independent sample set of 82 new ovarian cancers and 2

DocID: 1vmm1 - View Document

Lecture 5 Maximal Independent Set 5.1 The Problem

DocID: 1v2MD - View Document

INSPIRING POSSIBILITIES Set an Independent Living Destination and Map a Course to Get There People usually plan journeys with a specific destination in mind and map the way accordingly. When you are planning for your chi

DocID: 1uHYX - View Document

On the Approximability of Independent Set Problem on Power Law Graphs Mathias Hauptmann∗ Marek Karpinski†

DocID: 1uefJ - View Document