183 search results - page 17 / 37 » On the Matching Problem for Special Graph Classes |
ICRA
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
132
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
146
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
111
click to vote
DLOG
2004
15 years 2 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...