2283 search results - page 37 / 457 » Bounds of Graph Characteristics |
ESWS
2005
Springer
15 years 3 months ago
2005
Springer
The Resource Description Framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework to incorporate temporal reasoning into RDF, yieldi...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
SIAMDM
2010
14 years 4 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
DAM
2008
14 years 9 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
EJC
2006
14 years 9 months ago
2006
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...