215 search results - page 14 / 43 » On extremal k-outconnected graphs |
INFOVIS
2003
IEEE
14 years 1 months ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
SPAA
2000
ACM
14 years 24 days ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
PLDI
1994
ACM
14 years 15 days ago
1994
ACM
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
LCTRTS
2009
Springer
14 years 3 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...