1105 search results - page 90 / 221 » Linear choosability of graphs |
144
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
132
click to vote
CCCG
2008
15 years 5 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
140
click to vote
COR
2006
15 years 4 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
115
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
142
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...