<--- 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

arXiv:submitmath.CO] 25 MayOn edges not in monochromatic copies of a fixed bipartite graph Jie Ma∗ Abstract

DocID: 1v3xG - View Document

Radio Resource Sharing for MTC in LTE-A: An Interference-Aware Bipartite Graph Approach Safa Hamdoun, Abderrezak Rachedi, Yacine Ghamri-Doudane To cite this version: Safa Hamdoun, Abderrezak Rachedi, Yacine Ghamri-Doudan

DocID: 1t6Yp - View Document

Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that

DocID: 1sjuw - View Document

Spectral Graph Theory Lecture 26 Bipartite Ramanujan Graphs of Every Degree Daniel A. Spielman

DocID: 1rNPK - View Document

Graph theory / Bipartite graphs / Planar graphs / Induced path / NP-complete problems / Parity graph

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

DocID: 1rsEH - View Document