3471 search results - page 66 / 695 » Obstacle Numbers of Graphs |
108
Voted
RSA
2000
15 years 2 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
105
click to vote
SAS
2004
Springer
15 years 8 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
109
Voted
DM
2010
15 years 2 months ago
2010
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
77
Voted
INFOCOM
1993
IEEE
15 years 6 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
126
Voted
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...