176 search results - page 11 / 36 » Unbalanced Points and Vertices Problem |
126
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
146
click to vote
DM
2007
15 years 4 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
146
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
101
click to vote
ADCM
2008
15 years 4 months ago
2008
We consider the problem of constructing a C1 piecewise quadratic interpolant, Q, to positional and gradient data defined at the vertices of a tessellation of n-simplices in IRn . T...
144
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...