2503 search results - page 170 / 501 » A study of 3-arc graphs |
178
click to vote
ECCC
2008
15 years 6 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
168
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
155
click to vote
STACS
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
165
click to vote
JCB
2006
15 years 6 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...