Sciweavers

990 search results - page 64 / 198
» Sub-Graphs of Complete Graph
Sort
View
EJC
2007
13 years 9 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
14 years 25 days ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 9 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
SCAM
2003
IEEE
14 years 2 months ago
The Java System Dependence Graph
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
Neil Walkinshaw, Marc Roper, Murray Wood