3757 search results - page 184 / 752 » The overlap number of a graph |
233
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
165
click to vote
SODA
1990
ACM
15 years 7 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
159
click to vote
DM
2010
15 years 6 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
149
click to vote
IWSOC
2003
IEEE
15 years 11 months ago
2003
IEEE
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extra...
210
click to vote
ACPC
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...