3471 search results - page 167 / 695 » Obstacle Numbers of Graphs |
239
Voted
VL
2010
IEEE
15 years 2 months ago
2010
IEEE
— Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by...
127
click to vote
GD
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
157
click to vote
DAM
2011
14 years 11 months ago
2011
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...
150
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
145
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...