Sciweavers

7840 search results - page 190 / 1568
» On generalized Ramsey numbers
Sort
View
CATS
2006
15 years 8 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
DAGSTUHL
2003
15 years 8 months ago
Organising Computation through Dynamic Grouping
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
Michael Fisher, Chiara Ghidini, Benjamin Hirsch
BIRTHDAY
2009
Springer
15 years 7 months ago
An ASM-Characterization of a Class of Distributed Algorithms
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
Andreas Glausch, Wolfgang Reisig
ENDM
2007
75views more  ENDM 2007»
15 years 6 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...
JPDC
2006
92views more  JPDC 2006»
15 years 6 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang