165 search results - page 12 / 33 » A New Algorithm for On-line Coloring Bipartite Graphs |
ASP
2005
Springer
14 years 1 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
COCOA
2009
Springer
14 years 8 days ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
SIBGRAPI
2006
IEEE
14 years 1 months ago
2006
IEEE
Region-based approaches to cel painting typically use shape similarity and topology relations between regions of consecutive animation frames. This paper presents a new colorizati...
JGT
2007
13 years 7 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...