4315 search results - page 54 / 863 » Sorting in linear time |
ALGORITHMICA
2008
13 years 7 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
SCL
2010
13 years 6 months ago
2010
We deal with dynamic equations on time scales, where we characterize the positivity of a system. Uniform exponential stability of a system is determined by the spectrum of its mat...
ICIAP
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we propose a computational scheme named an interval-based linear hybrid dynamical system (ILHDS) to represent complex dynamic events based on temporal intervals, ea...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
ISPD
1998
ACM
13 years 12 months ago
1998
ACM
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...