Sciweavers

1984 search results - page 65 / 397
» The colourful feasibility problem
Sort
View
DM
2008
127views more  DM 2008»
13 years 10 months ago
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
David Cariolaro
STTT
2008
89views more  STTT 2008»
13 years 10 months ago
Modelling defence logistics networks
Military logistics concerns the activities required to support operational forces. It encompasses the storage and distribution of materiel, management of personnel and the provisio...
Guy Edward Gallasch, Nimrod Lilith, Jonathan Billi...
ER
2009
Springer
96views Database» more  ER 2009»
13 years 7 months ago
Screenography - Systematic and Adaptive Layout Development
Abstract Currently, the development of the visual design of Web Information Systems is mainly based on developers' experiences. Late considerations of graphical issues during ...
René Noack
DAM
2011
13 years 5 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 10 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...