Sciweavers

1963 search results - page 155 / 393
» The Maximum Solution Problem on Graphs
Sort
View
AIR
2006
46views more  AIR 2006»
13 years 10 months ago
Spatial inference with geometric proportional analogies
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
Emma-Claire Mullally, Diarmuid P. O'Donoghue
DAC
1998
ACM
14 years 11 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
14 years 2 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya
FOCS
2000
IEEE
14 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
ICALP
2011
Springer
13 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...