3267 search results - page 282 / 654 » Generalized quasirandom graphs |
184
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
163
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
154
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
124
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
160
click to vote
BIRTHDAY
2005
Springer
16 years 11 days ago
2005
Springer
Abstract In this paper, we propose a new loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantic...