3204 search results - page 159 / 641 » The b-chromatic Number of a Graph |
96
Voted
UAI
2004
15 years 2 months ago
2004
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...
91
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
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...
108
Voted
DAM
2008
15 years 26 days ago
2008
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...
125
click to vote
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
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...
80
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
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...