3471 search results - page 166 / 695 » Obstacle Numbers of Graphs |
136
click to vote
SODA
1990
ACM
15 years 5 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...
129
click to vote
DM
2010
15 years 4 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
113
click to vote
IWSOC
2003
IEEE
15 years 9 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...
172
click to vote
ACPC
1999
Springer
15 years 8 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...
118
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...