Sciweavers

1199 search results - page 51 / 240
» Graph Theory
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 6 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
130
Voted
ECCC
2008
122views more  ECCC 2008»
15 years 2 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
110
Voted
GC
2010
Springer
15 years 1 months ago
Intriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
Bart De Bruyn, Hiroshi Suzuki
115
Voted
JGT
2010
103views more  JGT 2010»
15 years 1 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
131
Voted
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
15 years 1 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia