Sciweavers

CPC
2004
51views more  CPC 2004»
14 years 9 days ago
A Note on a Question of Erdos and Graham
József Solymosi
CPC
2004
70views more  CPC 2004»
14 years 9 days ago
Random Assignment with Integer Costs
Robert Parviainen
CPC
2004
76views more  CPC 2004»
14 years 9 days ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
Kate Morris, Alois Panholzer, Helmut Prodinger
CPC
2004
92views more  CPC 2004»
14 years 9 days ago
Large Topological Cliques in Graphs Without a 4-Cycle
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
Daniela Kühn, Deryk Osthus
CPC
2004
62views more  CPC 2004»
14 years 9 days ago
Optimizing LRU Caching for Variable Document Sizes
Predrag R. Jelenkovic, Ana Radovanovic
CPC
2004
136views more  CPC 2004»
14 years 9 days ago
On the Strong Chromatic Number
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
Penny E. Haxell
CPC
2004
83views more  CPC 2004»
14 years 9 days ago
Embedding a Markov Chain into a Random Walk on a Permutation Group
Using representation theory, we obtain a necessary and sufficient condition for a discrete
Steven N. Evans