5084 search results - page 698 / 1017 » Proving Possibility Properties |
175
Voted
DAM
2008
15 years 6 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
170
click to vote
EOR
2008
15 years 6 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
170
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
175
click to vote
IJIIDS
2008
15 years 6 months ago
2008
: Main aim of Intelligent Transport Systems (ITS) applied to roads is to increase their safety. To achieve this aim, many researchers are focused on developing robust and efficient...
177
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...