Sciweavers

3204 search results - page 159 / 641
» The b-chromatic Number of a Graph
Sort
View
UAI
2004
13 years 11 months ago
Identifying Conditional Causal Effects
This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in w...
Jin Tian
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 10 months ago
A note on the random greedy triangle-packing algorithm
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
DAM
2008
72views more  DAM 2008»
13 years 10 months ago
Minimization of circuit registers: Retiming revisited
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
Bruno Gaujal, Jean Mairesse
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 8 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CORR
2011
Springer
141views Education» more  CORR 2011»
13 years 5 months ago
Geometric Semigroup Theory
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show h...
Jon McCammond, John Rhodes, Benjamin Steinberg