1027 search results - page 16 / 206 » Ordered Vertex Partitioning |
SDM
2011
SIAM
12 years 10 months ago
2011
SIAM
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
DM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
ENDM
2002
13 years 7 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
WG
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...