3757 search results - page 188 / 752 » The overlap number of a graph |
191
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
151
click to vote
CPC
2006
15 years 6 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
150
click to vote
JGT
2008
15 years 6 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
155
click to vote
ENDM
2000
15 years 6 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
147
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of ...