Sciweavers

649 search results - page 34 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
WG
2009
Springer
14 years 3 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
FLAIRS
2004
13 years 10 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
ICALP
2009
Springer
14 years 9 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
IMAMS
2003
125views Mathematics» more  IMAMS 2003»
13 years 10 months ago
A Graph-Spectral Method for Surface Height Recovery
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
Antonio Robles-Kelly, Edwin R. Hancock