1395 search results - page 63 / 279 » (k, )-Distance-Hereditary Graphs |
150
Voted
IPL
2007
15 years 3 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
138
click to vote
DAM
2007
15 years 3 months ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
117
Voted
JGT
2010
15 years 1 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
163
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
136
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...