3204 search results - page 94 / 641 » The Alcuin Number of a Graph |
147
click to vote
GD
2009
Springer
15 years 3 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...
185
click to vote
DAM
2011
15 years 23 days 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...
168
click to vote
FOCS
2002
IEEE
15 years 10 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...
156
click to vote
FOCS
2009
IEEE
16 years 16 days 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...
151
Voted
MOBIQUITOUS
2007
IEEE
16 years 2 days ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...