28 search results - page 4 / 6 » On the circular chromatic number of circular partitionable g... |
SIAMCOMP
1998
13 years 6 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
GD
2003
Springer
13 years 12 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
SOFSEM
2005
Springer
14 years 4 days ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
APVIS
2006
13 years 8 months ago
2006
A multivariate network is a graph whose nodes contain multi-dimensional attributes. We propose a method to visualize such a network using spherical Self-Organizing Map (SOM) and c...
MP
2006
13 years 6 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...